Sciweavers

632 search results - page 110 / 127
» On Routing in Circulant Graphs
Sort
View
ICALP
2005
Springer
14 years 1 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
ICDCS
2010
IEEE
14 years 10 days ago
Guaranteeing BGP Stability with a Few Extra Paths
Abstract—Policy autonomy exercised by Autonomous Systems (ASes) on the Internet can result in persistent oscillations in Border Gateway Protocol, the Internet’s inter-domain ro...
Rachit Agarwal, Virajith Jalaparti, Matthew Caesar...
DCOSS
2006
Springer
14 years 3 days ago
Distance-Sensitive Information Brokerage in Sensor Networks
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
Stefan Funke, Leonidas J. Guibas, An Nguyen, Yusu ...
KI
2008
Springer
13 years 8 months ago
Wayfinding in Scene Space
Many environments in which humans wayfind can be conveniently abstracted as networks or graphs: structures of nodes that are interconnected by edges. Examples include the street ne...
Urs-Jakob Rüetschi
MOBIHOC
2008
ACM
14 years 8 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li