On-line routing for permanent virtual circuits

Gawlick, Rainer; Kalmanek, Charles; Ramakrishnan, K. G.

doi:10.1109/infcom.1995.515886

Cited by 14 publications

(6 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The next idea is to import the notion of controlled alternate routing into traditional link state QoS-based routing [RSR95,GKR96]. To do this, first each VC is associated with a maximum permissible routing cost.…”

Section: Atm Network ------------mentioning

confidence: 99%

A Framework for QoS-based Routing in the Internet

Crawley¹,

Nair²,

Rajagopalan³

et al. 1998

484

244

View full text Add to dashboard Cite

show abstract

Section: Atm Network ------------mentioning

confidence: 99%

A Framework for QoS-based Routing in the Internet

Crawley¹,

Nair²,

Rajagopalan³

et al. 1998

484

244

View full text Add to dashboard Cite

show abstract

“…Analysis of routing in a Poisson arrivals model was done in Kamath et al [1996]. Simulation and implementation results described in Gawlick et al [1995a;1995b] indicate that on-line routing algorithms based on our techniques outperform traditional algorithms for routing virtual circuits in ATM networks. (See also Plotkin [1995].…”

mentioning

confidence: 99%

On-line routing of virtual circuits with applications to load balancing and machine scheduling

Aspnes

Azar

Fiat

et al. 1997

J. ACM

288

229

View full text Add to dashboard Cite

In this paper we study the problem of on-line allocation of routes to virtual circuits (both point-to-point and multicast) where the goal is to route all requests while minimizing the required bandwidth. We concentrate on the case of permanent virtual circuits (i.e., once a circuit is established, A preliminary version of this paper appeared in it exists forever), and describe an algorithm that achieves an O(log n) competitive ratio with respect to maximum congestion, where n is the number of nodes in the network. Informally, our results show that instead of knowing all of the future requests, it is sufficient to increase the bandwidth of the communication links by an O(log n) factor. We also show that this result is tight, that is, for any on-line algorithm there exists a scenario in which ⍀(log n) increase in bandwidth is necessary in directed networks.We view virtual circuit routing as a generalization of an on-line load balancing problem, defined as follows: jobs arrive on line and each job must be assigned to one of the machines immediately upon arrival. Assigning a job to a machine increases the machine's load by an amount that depends both on the job and on the machine. The goal is to minimize the maximum load.For the related machines case, we describe the first algorithm that achieves constant competitive ratio. For the unrelated case (with n machines), we describe a new method that yields O(log n)-competitive algorithm. This stands in contrast to the natural greedy approach, whose competitive ratio is exactly n.

show abstract

“…We should mention that GREEDY_ROUTE2 is identical to the min-max algorithm simulated in [14] and compared to the min-hop algorithm and a variant of EXP_ROUTE. In these simulations, the goal was to maximize throughput rather than to minimize congestion.…”

Section: Outlinementioning

confidence: 99%

Greedy online algorithms for routing permanent virtual circuits

Havill¹,

Mao²

1999

Networks

View full text Add to dashboard Cite

We analyze the competitive ratio of two greedy online algorithms for routing permanent virtual circuits in a network with arbitrary topology and uniform capacity links. We show that the competitive ratio of the first algorithm, with respect to network congestion, is in ⍀( ͌ Ᏸm) and O( ͌ Ᏸᏸm), where m is the number of links in the network, Ᏸ is the maximum ratio, over all requests, of the length of the longest path for the request to the length of the shortest path for the request, and ᏸ is the ratio of the maximum-tominimum bandwidth requirement. We show that the competitive ratio of the second greedy algorithm is in ⍀(d ϩ log(n Ϫ d)) and min{O(d log n), O( ͌ Ᏸᏸm)} when the optimal route assignment is pairwise edge disjoint, where n is the number of network nodes and d is the length of the longest path that can be assigned to a request. It is known that the optimal competitive ratio for this problem is ⌰(log n). Aspnes et al. designed a ⌰(log n) competitive online algorithm that computes an exponential function of current congestion to make each decision. The greedy online algorithms, although not optimal, make each decision more quickly and still have good competitive ratios in many nontrivial situations.

show abstract

On-line routing for permanent virtual circuits

Cited by 14 publications

References 5 publications

A Framework for QoS-based Routing in the Internet

A Framework for QoS-based Routing in the Internet

On-line routing of virtual circuits with applications to load balancing and machine scheduling

Greedy online algorithms for routing permanent virtual circuits

Contact Info

Product

Resources

About