检索结果-内蒙古大学图书馆

16th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2015

作者： Rai, Anurag Li, Chih-Ping Paschos, Georgios Modiano, Eytan LIDS MIT CambridgeMA United States Qualcomm Research San DiegoCA United States Mathematical and Algorithmic Sciences Lab. France Research Center Huawei Technologies Co. Ltd. China

ISBN: (纸本)9781450334891

The backpressure routing policy is known to be a throughput optimal policy that supports any feasible traffic demand in data networks, but may have poor delay performance when packets traverse loops in the network. In this paper, we study loop-free backpressure routing policies that forward packets along directed acyclic graphs (DAGs) to avoid the looping problem. These policies use link reversal algorithms to improve the DAGs in order to support any achievable traffic demand. For a network with a single commodity, we show that a DAG that supports a given traffic demand can be found after a finite number of iterations of the link-reversal process. We use this to develop a joint link-reversal and backpressure routing policy, called the loop free backpressure (LFBP) algorithm. This algorithm forwards packets on the DAG, while the DAG is dynamically updated based on the growth of the queue backlogs. We show by simulations that such a DAG-based policy improves the delay over the classical backpressure routing policy. We also propose a multicommodity version of the LFBP algorithm, and via simulation we show that its delay performance is better than that of backpressure. Copyright © 2015 ACM.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Link availability modeling for routing algorithms to reduce the link break time in MANETs

Link availability modeling for routing algorithms to reduce ...

引用

International Conference on Networking, Sensing and Control

作者： Yu, Ming Liu, Wei Xing, Tian Dept. of Electrical and Computer Engineering Florida State University Tallahassee FL 32310 United States

ISBN: (纸本)9781424495702

In the design of mobile ad hoc networks, a challenging problem is how to route information reliably and efficiently from one node to another in moderate to high level of mobility. In this paper, we propose a new routing protocol, called link effective available time (LEAT) routing. First, we propose a method to find the link available time during an epoch by measuring the distances between the two nodes of a mobile link, instead of using complete localization information. Second, in order to reduce the link breakage, we propose a new link cost for routing, i.e., the product of the available time and availability of a link. Based on the new cost, the routing is formulated as an optimal routing problem, for which a heuristic algorithm is developed. Simulation results have demonstrated that LEAT significantly reduces link breakages while maintains network performance in delay, hopcounts and throughput, as compared to the existing routing algorithms. © 2011 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Robust and risk-averse routing algorithms in road networks

Robust and risk-averse routing algorithms in road networks

引用

作者： Crisostomi, E. Kirkl, S. Shorten, R. Department of Energy and Systems Engineering University of Pisa Largo Lucio Lazzarino 1 56127 Pisa Italy Co. Kildare Ireland

ISBN: (纸本)9783902661937

Recent works have shown that Markov chain theory can be used to model and realistically describe road network dynamics. Properties of the Markov transition matrix such as the Perron eigenvector, the second eigenvalue, and the Kemeny constant have nice corresponding interpretations in the road network counterparts. Our objective in this paper is to use this modelling paradigm to develop new traffic management applications. In particular, our framework is particularly suited to routing algorithm development, offering new approaches to this old problem. This is the focus of the present paper. © 2011 IFAC.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Study of routing algorithms Considering Real Time Restrictions Using a Connectivity Function

Study of Routing Algorithms Considering Real Time Restrictio...

引用

12th Annual Conference on Towards Autonomous Robotic Systems, TAROS 2011

作者： Arellano-Vázquez, Magali Benítez-Pérez, Héctor Ortega-Arjona, Jorge L. Posgrado en Ciencia e Ingeniería de la computación Mexico Departamento de Ingeniería de Sistemas Computacionales y Automatización Mexico Departamento de Matemáticas Facultad de Ciencias UNAM México D.F Mexico

ISBN: (纸本)9783642232312

The paper focuses on the study of a mobile distributed system that is characterized by frequently changing topology. The routing algorithms [4,5,1] for such a system should be, in general, fully adaptive. Additionally, it is important to know the state of the task scheduler of each node in order to determine whether it acts as a router. Traditionally, existing routing algorithms [3,2] resort to the path discovery process for each modification in topology. © 2011, Springer-Verlag Berlin Heidelberg.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Economic Optimization of Sawmill Residues Collection for Bioenergy Conversion

引用

IFAC-PapersOnLine 2016年第7期49卷 857-862页

作者： Zamar, David S. Gopaluni, Bhushan Sokhansanj, Shahab Ebadian, Mahmood Department of Chemical and Biological Engineering University of British Columbia VancouverBC V6T 1Z3 Canada Resource and Engineering Systems Group Environmental Sciences Division Oak Ridge National Laboratory Oak RidgeTN37831-6422 United States

The collection of sawmill residuals is an important logistic activity for the pulp and paper industry, which use the biomass as a source of energy. We study a vehicle routing problem for a network composed of a single depot and 25 nearby sawmills in the Lower Mainland region of British Columbia, Canada. The sawmills serve as potential suppliers of residual biomass to the depot, which in turn processes and distributes the sawmill residuals to the pulp and paper mills. This problem consists of identifying the best daily routing schedule for a fixed number of vehicles. The objective is to maximize the ratio of residual dry tonnes collected to kilometers traveled, while achieving a minimum daily amount of residual dry mass. There are several random components in the problem, including the availability and moisture content of the residuals as well as the time spent on the road to retrieve the residuals. We use a combination of scenario analysis and heuristics to solve this stochastic vehicle routing problem (SPVRP). © 2016

关键词： Paper and pulp industry Approximation algorithms Biomass Paper and pulp mills Pulp routing algorithms Sawing Sawmills Stochastic systems Vehicle routing Vehicles Wood products British Columbia , Canada Pulp and paper industry Renewable energy systems Robust estimation Stochastic approximations Stochastic vehicle routing uncertainty Vehicle routing Problems

来源：评论

学校读者我要写书评

暂无评论

Optimised flexible transport mode without advanced reservations by a DES approach

引用

IFAC-PapersOnLine 2016年第18期49卷 974-979页

作者： Lioris, Jennie Eugénie Cohen, Guy IFSTTAR 77455 Marne la Vallée on leave from CERMICS-École des Ponts-ParisTech France Researcher Emeritus at CERMICS École des Ponts-ParisTech Marne la Vallée France

Decentralized management of an autonomous demand responsive transport system (DRTS) is studied. Clients appear in the network in a continuous Poisson stream, without any prior reservation and aiming at an immediate departure search for an adequate vehicle. When no such vehicle is available, clients decide whether to abandon the system or wait, during a desired period, for another vehicle to come. Meanwhile, vehicles travel along the network, transporting passengers while looking for potential new customers. Dynamically optimised trips are constructed adapted to the current vehicle itinerary and client preferences. Station nodes and durations are decided for idle vehicles. Client-vehicle interaction forms an asynchronous dynamical spatio-temporal system for which an event-driven approach is adopted. Developped strategies are evaluated by a made-to-measure discrete event decision tool. Involving Optimisation and Operation Research methods the best suited configuration for any demand level and system dimensioning is provided. © 2016

关键词： Discrete event simulation Distributed computer systems Dynamical systems Intelligent systems Monte Carlo methods Motor transportation Pareto principle routing algorithms Vehicles asynchronous behaviour Demand responsive transport Event driven Parameter optimisation Pareto optimality Performance evaluations Poisson arrival process Queueing network model

来源：评论

学校读者我要写书评

暂无评论

Self-stabilizing disconnected components detection and rooted shortest-path tree maintenance in polynomial steps∗

arXiv

引用

arXiv 2017年

作者： Devismes, Stéphane Ilcinkas, David Johnen, Colette Université Grenoble Alpes Grenoble France Univ. Bordeaux & CNRS LaBRI UMR 5800 TalenceF-33400 France

We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain a shortest-path tree rooted at r in its connected component, Vr, and make all processes of other components detecting that r is not part of their connected component. We propose, in the composite atomicity model, a silent self-stabilizing algorithm for this problem working in semi-anonymous networks, where edges have strictly positive weights. This algorithm does not require any a priori knowledge about global parameters of the network. We prove its correctness assuming the distributed unfair daemon, the most general daemon. Its stabilization time in rounds is at most 3nmaxCC +D, where nmaxCC is the maximum number of non-root processes in a connected component and D is the hop-diameter of Vr. Furthermore, if we additionally assume that edge weights are positive integers, then it stabilizes in a polynomial number of steps: namely, we exhibit a bound in O(WmaxnmaxCC3n), where Wmax is the maximum weight of an edge and n is the number of processes. Copyright © 2017, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Analysis of Meta-level Communication for Distributed Resource Allocation Problems 17

Analysis of Meta-level Communication for Distributed Resourc...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Matthew Saponaro Keith Decker Computer and Information Sciences University of Delaware

ISBN: (纸本)9781510855076

We examine the effects of meta-level-communication in the DSRAP (Distributed Sequential Resource Allocation Problem). In DSRAP, independent tasks are categorized into different types, where each task belonging to a particular task type shares a known distribution of task arrivals, durations, reward rates, maximum waiting times, and resource demands We first look at a single task type DSRAP (SD-SRAP) and develop an analytical model of the effect of meta-level communication about load on system performance for first-in-first-out (FIFO) local scheduling agents that forward tasks based on load. Through our analytical models and empirical results, we show how the frequency of communication affects performance for SDSRAP problems with one resource and task type. We then quantitatively measure the impact of meta-level communication on system performance with respect to the global measures of the system's load balance. We validate our analytical model's predictions experimentally, showing, e.g., as system load becomes unbalanced, performance decreases; organizational structure significantly impacts agent performance; and agents that can communicate and distribute tasks to neighbors significantly outperform agents working individually. Through our analysis on FIFO, routing algorithms, and our policy agents, we provide a framework for analyzing more complex task schedulers and task routing algorithms.

关键词： first-in first-out ANALYSIS MODELS Resource utilization Agents System performance Communication Research performance agents LOAD Religious Missions management of resources Distribute routing algorithms organization structure Analysis

来源：评论

学校读者我要写书评

暂无评论

Economic Optimization of Sawmill Residues Collection for Bioenergy Conversion

Economic Optimization of Sawmill Residues Collection for Bio...

引用

11th IFAC Symposium on Dynamics and Control of Process Systems including Biosystems

作者： Zamar, David S. Gopaluni, Bhushan Sokhansanj, Shahab Ebadian, Mahmood Univ British Columbia Dept Chem & Biol Engn Vancouver BC V6T 1Z3 Canada Oak Ridge Natl Lab Div Environm Sci Resource & Engn Syst Grp Oak Ridge TN 37831 USA

The collection of sawmill residuals is an important logistic activity for the pulp and paper industry, which use the biomass as a source of energy. Vie study a vehicle routing problem for a network composed of a single depot and 25 nearby sawmills in the Lower Mainland region of British Columbia, Canada. The sawmills serve as potential suppliers of residual biomass to the depot, which in turn processes and distributes the sawmill residuals to the pulp and paper mills This problem consists of identifying the best daily routing schedule for a fixed number of vehicles. The objective is to maximize the ratio of residual dry tonnes collected to kilometers traveled, while achieving a minimum daily amount of residual dry mass. There are several random components in the problem, including the availability and moisture content of the residuals as well as the time spent on the road to retrieve the residuals. Vie use a combination of scenario analysis and heuristics to solve this stochastic vehicle routing problem (SPVRP). (C) 2016, IFAC (International Federation of Automatic Control) I lusting by Elsevier Ltd. All rights reserved.

关键词： renewable energy systems routing algorithms robust estimation uncertainty stochastic approximation

来源：评论

学校读者我要写书评

暂无评论

Optimised flexible transport mode without advanced reservations by a DES approach

Optimised flexible transport mode without advanced reservati...

引用

10th IFAC Symposium on Nonlinear Control Systems (NOLCOS)

作者： Lioris, Jennie Eugenie Cohen, Guy IFSTTAR F-77155 Marne La Vallee France Ecole Ponts ParisTech CERMICS Marne La Vallee France

关键词： Demand responsive transport asynchronous behaviour event-driven dynamical systems discrete-event simulation Monte Carlo simulation Poisson arrival processes Pareto optimality performance evaluation parameter optimisation routing algorithms queueing network model

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：