Sciweavers

290 search results - page 45 / 58
» Network as a Computer: Ranking Paths to Find Flows
Sort
View
CCR
2004
157views more  CCR 2004»
14 years 9 months ago
Designing BGP-based outbound traffic engineering techniques for stub ASes
Today, most multi-connected autonomous systems (AS) need to control the flow of their interdomain traffic for both performance and economical reasons. This is usually done by manu...
Steve Uhlig, Olivier Bonaventure
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
15 years 10 months ago
The price of anarchy is independent of the network topology
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
Tim Roughgarden
MOBIHOC
2005
ACM
15 years 9 months ago
Efficient geographic routing in multihop wireless networks
We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proxi...
Seungjoon Lee, Bobby Bhattacharjee, Suman Banerjee
INTR
2007
87views more  INTR 2007»
14 years 9 months ago
StarPlane - a national dynamic photonic network controlled by grid applications
Purpose – This paper aims to look at a research project – StarPlane –a national dynamic photonic network controlled by grid applications. Design/methodology/approach – The...
Paola Grosso, Li Xu, Jan-Philip Velders, Cees de L...
LCN
2007
IEEE
15 years 4 months ago
Efficient MD Coding Core Selection to Reduce the Bandwidth Consumption
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
Sunoh Choi, Sang-Seon Byun, Chuck Yoo