Finding Minimum-Cost Dynamic Routing Policies in Stochastic-State Networks with Link Failures
نویسندگان
چکیده
Transportation Research Record: Journal of the Transportation Research Board, No. 2283, Transportation Research Board of the National Academies, Washington, D.C., 2012, pp. 113–121. DOI: 10.3141/2283-12 School of Civil and Environmental Engineering, University of New South Wales, Sydney, New South Wales 2052, Australia. Corresponding author: D. Fajardo, [email protected]. research that was taken from the field of communications is the need for the rerouting of units from an origin, that is, the routing representation of a lost routing unit or, in the case of telecommunication networks, information packets.
منابع مشابه
Robust path choice in networks with failures
The problem of adaptive routing in a network with failures is considered The network may be in one of nitely many states characterized by di erent travel times along the arcs and transi tions between the states occur according to a continuous time Markov chain The objective is to develop a routing strategy that minimizes the total expected travel time Dynamic programming models and ow oriented ...
متن کاملTop-percentile traffic routing problem by Dynamic Programming
Multi-homing is a technology used by Internet Service Provider (ISP) to connect to the Internet via different network providers. To make full use of the underlying networks with minimum cost, an optimal routing strategy is required by ISPs. This study investigates the optimal routing strategy in case where network providers charge ISPs according to top-percentile pricing. We call this problem t...
متن کاملIntuitionistic fuzzy logic for adaptive energy efficient routing in mobile ad-hoc networks
In recent years, mobile ad-hoc networks have been used widely due to advances in wireless technology. These networks are formed in any environment that is needed without a fixed infrastructure or centralized management. Mobile ad-hoc networks have some characteristics and advantages such as wireless medium access, multi-hop routing, low cost development, dynamic topology and etc. In these netwo...
متن کاملA New Approach to Routing with Dynamic Metrics
We present a new routing algorithm to compute paths within a network using dynamic link metrics. Dynamic link metrics are cost metrics that depend on a link’s dynamic state, e.g., the congestion on the link. Our algorithm is destination-initiated: a destination initiates a global path computation to itself using dynamic link metrics. All other destinations that do not initiate this dynamic metr...
متن کاملOptimal Routing, Link Scheduling , and Power Control in Multi-hop Wireless Networks
In this paper, we study the problem of joint routing, link scheduling and power control to support high data rates for broadband wireless multi-hop networks. We first address the problem of finding an optimal link scheduling and power control policy that minimizes the total average transmission power in the wireless multi-hop network, subject to given constraints regarding the minimum average d...
متن کامل