Trade-Offs between Stretch Factor and Load-Balancing Ratio in Routing on Growth-Restricted Graphs

An unweighted graph has density rho and growth rate k if the number of nodes in every ball with radius r is bounded by rhor k . The communication graphs of wireless networks and peer-to-peer networks often have constant bounded density and small growth rate. In this paper, we study the trade-off bet...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on parallel and distributed systems Ročník 20; číslo 2; s. 171 - 179
Hlavní autori: Gao, Jie, Zhang, Li
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.02.2009
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Computer networks
Density
Graphs
Growth rate
growth-restricted graphs
Length measurement
Load balancing
Load balancing (computing)
Load management
Networks
Peer to peer computing
Relays
Routing
Routing (telecommunications)
Studies
Telecommunication traffic
Tradeoffs
Very large scale integration
Wireless networks
Wireless sensor networks
Tradeoffs between Complexity Measures
Nonnumerical Algorithms and Problems
Data Structures
ISSN:1045-9219, 1558-2183
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:An unweighted graph has density rho and growth rate k if the number of nodes in every ball with radius r is bounded by rhor k . The communication graphs of wireless networks and peer-to-peer networks often have constant bounded density and small growth rate. In this paper, we study the trade-off between two quality measures for routing in growth-restricted graphs. The two measures we consider are the stretch factor, which measures the lengths of the routing paths, and the load-balancing ratio, which measures the evenness of the traffic distribution. We show that if the routing algorithm is required to use paths with stretch factor c, then its load-balancing ratio is bounded by O(rho 1/k (n/c) 1-1/k ), and the bound is tight in the worst case. We show the application and extension of the trade-off to the wireless network routing and VLSI layout design. We also present a load-balanced routing algorithm with the stretch factor constraint in an online setting, in which the routing requests come one by one.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2008.75