75 search results - page 3 / 15 » Name independent routing for growth bounded networks |
INFOCOM
1993
IEEE
13 years 11 months ago
1993
IEEE
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
OPODIS
2007
13 years 9 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—This paper investigates the network performance loss of using only single-path routing when multiple paths are available. The performance metric is the aggregate utility achieve...