Heterogeneity-aware shortest parh routing: Flow holding time, user demand and network state

Show simple item record

dc.contributor.author Yang, Shanchieh
dc.contributor.author Su, Xun
dc.contributor.author de Veciana, Gustavo
dc.date.accessioned 2009-11-11T15:35:21Z
dc.date.available 2009-11-11T15:35:21Z
dc.date.issued 2001
dc.identifier.citation 2001 IEEE Workshop on High Performance Switching and Routing, pp. 287-297, 2001 en_US
dc.identifier.uri http://hdl.handle.net/1850/10764
dc.description.abstract We investigate possible performance improvements by exploring heterogeneity of traffic characteristics when designing a shortest path routing scheme. First we focus on the effect of the maintenance of the link metrics for connections with different holding times. We found that by using a differentiated routing scheme with respect to connection holding times, one can enhance network performance for a range of traffic loads. Second we propose a selective routing control scheme which determines whether to accept a shortest path routing decision based on user demands in the (source,destination,bandwidth request) tuple. Simulations were conducted to exhibit the effectiveness of such routing algorithm. Finally, realizing the difference in routing “local” versus “transit” traffic, we present a novel approach to aggregate network state by drawing on an analogy to circuit theory. The proposed “effective capacity” abstraction is not only efficient in terms of the signaling savings, but also maintains a compatible routing metric to represent aggregated and local states. en_US
dc.language.iso en_US en_US
dc.publisher Institute of Electrical and Electronics Engineers en_US
dc.title Heterogeneity-aware shortest parh routing: Flow holding time, user demand and network state en_US
dc.type Proceedings en_US

Files in this item

Files Size Format View
SYangConfProc2001.pdf 77.25Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse