Controlling alternate routing in general-mesh packet flow networks

Sibal, Sandeep; DeSimone, A.

doi:10.1145/190809.190330

Cited by 22 publications

(4 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An interesting research direction is to try to design strategies based on these new measures. Another promising research direction is to combine the ideas of the competitive online routing with the more traditional reservation-based approaches [3,27,34,35,36,30,38] in order to derive strategies that have good performance both for dense and for sparse topologies. comments on the early draft of this paper.…”

Section: Discussionmentioning

confidence: 99%

Competitive routing of virtual circuits in ATM networks

Plotkin

1995

IEEE J. Select. Areas Commun.

141

View full text Add to dashboard Cite

Classical routing and admission control strategies achieve provably good performance by relying on an assumption that the virtual circuits arrival pattern can be described by some a priori known probabilistic model. Recently a new online routing framework, based on the notion of competitive analysis, was proposed. This framework is geared towards design of strategies that have provably good performance even in the case where there are no statistical assumptions on the arrival pattern and parameters of the virtual circuits. The online strategies motivated by this framework are quite different from the min-hop and reservation-based strategies. This paper surveys the online routing framework, the proposed routing and admission control strategies, and discusses some of the implementation issues.

show abstract

Section: Discussionmentioning

confidence: 99%

Competitive routing of virtual circuits in ATM networks

Plotkin

1995

IEEE J. Select. Areas Commun.

141

View full text Add to dashboard Cite

show abstract

“…Optimal reservation thresholds have often been determined assuming a fixed (known) input traffic pattern (e.g. [30]). For simplicity, we assume all links have the same reservation threshold.…”

Section: Routing With Trunk Reservationmentioning

confidence: 99%

Load Profiling Based Routing for Guaranteed Bandwidth Flows

Matta¹,

Bestavros²,

Krunz³

1999

Trans Emerging Tel Tech

View full text Add to dashboard Cite

To support the stringent Quality of Service (QoS) requirements of real-time (e.~. audiohideo) applications in Integrated services networks, several routing algorithms that allow for the rcscrvation of the needed bandwidth over a Virtual Circuit (VC), established on one of several candidate routes, have been proposed. Traditionally, such routing is done using the least-loaded concept, and thus results in balancing the load across the set of candidate routes. In this paper, we propose the use of lotrt/prclfilirrg as an attractive alternative to load balancing for routing guaranteed bandwidth VCs (flows). Load profiling techniques allow the distribution of "available" bandwidth across a set of candidate routes to match the characteristics of incoming VC QoS rcqucsts. We thoroughly characterize the performance of VC routing using load profiling and contrast it to routing using load balancing and load packing. We do so both analytically and via extensive simulations of multi-class tralk routing in Virtual Path (VP) based networks. Our findings show that for routing guaranteed bandwidth flows in VP networks. load profiling is desirable as it reduces VP bandwidth fragmentation, which increases the likelihood of accepting new VC requests. This fragmentation could be particularly harmful when the granularity of VC requests is large. Typically, this occurs when a common VC is established to carry the cigSre@ite traffic flow of many high-bandwidth real-time sources. For VP-based networks. our simulation results show that our load-profiling VC routing scheme performs better or as well as the traditional load-balancing VC routing in terms of revenue under both skewcd and uniform workloads. Furthermore, load-profiling routing improves routing fairness by proactively increasing the chances of admitting high-bandwidth tlows. -J , 2 J 7 J > J c 11

show abstract

“…The idea is to disperse traffic flows sharing the same ingress/egress points via multiple paths on the network, in order to achieve "statistical multiplexing" of the flows over available network resources [4]. This in itself is not a new idea, and is part of a tradition of alternative routing and dispersion used in some circuit switched networks [8,11,13,12,6,3,15].…”

Section: Introductionmentioning

confidence: 99%

“…Somewhat akin to this problem, alternative routing and trunk reservation have been studied extensively, see e.9., [8,11,13]. In the context of circuit-switched networks [3,12,6], a trade-off is sought between increasing routing options and resource utilization.…”

Section: Introductionmentioning

confidence: 99%

Dynamic multi-path routing

Veciana

2001

Proceedings of the 2001 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

View full text Add to dashboard Cite

In this paper we study the dynamic multi-path routing problem. We focus on an operating regime where traffic flows arrive at and depart from the network in a bursty fashion, and where the delays involved in link state advertisement may lead to "synchronization" effects that adversely impact the performance of dynamic single-path routing schemes.We start by analyzing a simple network of parallel links, where the goal is to minimize the average increase in network congestion on the time scale of link state advertisements. We consider an asymptotic regime leading to an optimization problem permitting closed-form analysis of the number of links over which dynamic multi-path routing should be conducted. Based on our analytical result we examine three types of dynamic routing schemes, and identify a robust policy, i.e., routing the traffic to a set of links with loads within a factor of the least loaded, that exhibits robust performance. We then propose a similar policy for mesh networks and show by simulation some of its desirable properties. The main results suggest that our proposal would provide significant performance improvement for high speed networks carrying bursty traffic flows.

show abstract

Controlling alternate routing in general-mesh packet flow networks

Cited by 22 publications

References 20 publications

Competitive routing of virtual circuits in ATM networks

Competitive routing of virtual circuits in ATM networks

Load Profiling Based Routing for Guaranteed Bandwidth Flows

Dynamic multi-path routing

Contact Info

Product

Resources

About