Sciweavers

177 search results - page 22 / 36
» Stackelberg Routing in Arbitrary Networks
Sort
View
INFOCOM
2008
IEEE
14 years 4 months ago
Designing a Fault-Tolerant Network Using Valiant Load-Balancing
—Commercial backbone networks must continue to operate even when links and routers fail. Routing schemes such as OSPF, IS-IS, and MPLS reroute traffic, but they cannot guarantee...
Rui Zhang-Shen, Nick McKeown
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 3 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
INFOCOM
2007
IEEE
14 years 4 months ago
Moore: An Extendable Peer-to-Peer Network Based on Incomplete Kautz Digraph with Constant Degree
— The topological properties of peer-to-peer overlay networks are critical factors that dominate the performance of these systems. Several non-constant and constant degree interc...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
INFOCOM
2012
IEEE
12 years 15 days ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
ICN
2005
Springer
14 years 3 months ago
Packet Scheduling Across Networks of Switches
Abstract. Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the pr...
Kevin Ross, Nicholas Bambos