Sciweavers

76 search results - page 3 / 16
» Can Shortest-path Routing and TCP Maximize Utility
Sort
View
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
13 years 5 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras
INFOCOM
2010
IEEE
13 years 5 months ago
Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces
In this paper we show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. The hyperbolic geometry can be used to facilitate maximally efï¬...
Fragkiskos Papadopoulos, Dmitri V. Krioukov, Mari&...
TON
2010
158views more  TON 2010»
13 years 5 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose signiï¬cant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
SDM
2012
SIAM
273views Data Mining» more  SDM 2012»
11 years 9 months ago
A Framework for the Evaluation and Management of Network Centrality
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
Vatche Ishakian, Dóra Erdös, Evimaria ...
COMCOM
2000
96views more  COMCOM 2000»
13 years 7 months ago
A routing algorithm for dynamic multicast trees with end-to-end path length control
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
Hiroshi Fujinoki, Kenneth J. Christensen