Sciweavers

3061 search results - page 529 / 613
» Network Load Games
Sort
View
CN
2010
95views more  CN 2010»
15 years 5 months ago
Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?
The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re...
Michael Menth, Matthias Hartmann, Rüdiger Mar...
142
Voted
CACM
2005
74views more  CACM 2005»
15 years 4 months ago
Separate handles from names on the internet
Networked communications inherently depend on the ability of the sender of a message to indicate through some token how the message should be delivered to a particular recipient. ...
Michael J. O'Donnell
CCR
2000
96views more  CCR 2000»
15 years 4 months ago
Decentralized optimal traffic engineering in the internet
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
Constantino M. Lagoa, Hao Che
TON
2010
300views more  TON 2010»
15 years 3 months ago
POPI: a user-level tool for inferring router packet forwarding priority
— Packet forwarding prioritization (PFP) in routers is one of the mechanisms commonly available to network operators. PFP can have a significant impact on the accuracy of networ...
Guohan Lu, Yan Chen, Stefan Birrer, Fabián ...
151
Voted
MOBIHOC
2007
ACM
16 years 4 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang