Sciweavers

155 search results - page 21 / 31
» A New Necessary Condition for Shortest Path Routing
Sort
View
INFOCOM
2002
IEEE
14 years 1 months ago
Beyond Routing: An Algebraic Approach to Network Coding
Abstract— In this paper we consider the issue of network capacity. The recent work by Li and Yeung examined the network capacity of multicast networks and related capacity to cut...
Muriel Médard, Ralf Koetter
CCR
2004
86views more  CCR 2004»
13 years 8 months ago
On the scaling of congestion in the internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...
BROADNETS
2007
IEEE
14 years 2 months ago
Resource dimensioning in WDM networks under state-based routing schemes
— Network dimensioning for wavelength-routed WDM networks has been extensively studied to maximize connection acceptance rate while minimizing the total cost. However, Internet s...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
MONET
2006
97views more  MONET 2006»
13 years 8 months ago
Pre-Reply Probe and Route Request Tail: Approaches for Calculation of Intra-Flow Contention in Multihop Wireless Networks
Several applications have been envisioned for multihop wireless networks that require different qualities of service from the network. In order to support such applications, the n...
Kimaya Sanzgiri, Ian D. Chakeres, Elizabeth M. Bel...
SIGCOMM
1991
ACM
13 years 12 months ago
Efficient and Robust Policy Routing Using Multiple Hierarchical Addresses
One of the most compelling long term problems facing the IP and emerging 0S1 Internet is growth, At the same time, policy routing-the ability of a packet source to determine the t...
Paul F. Tsuchiya