Sciweavers

266 search results - page 33 / 54
» Distributed Routing in Tree Networks with Few Landmarks
Sort
View
SPAA
2004
ACM
14 years 29 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
ISPA
2005
Springer
14 years 1 months ago
Ethernet as a Lossless Deadlock Free System Area Network
The way conventional Ethernet is used today differs in two aspects from how dedicated system area networks are used. Firstly, dedicated system area networks are lossless and only d...
Sven-Arne Reinemo, Tor Skeie
NOMS
2008
IEEE
14 years 1 months ago
Host-aware routing in multicast overlay backbone
— To support large-scale Internet-based broadcast of live streaming video efficiently in content delivery networks (CDNs), it is essential to implement a cost-effective overlay ...
Jun Guo, Sanjay Jha
IPSN
2009
Springer
14 years 2 months ago
Distributed resource management and matching in sensor networks
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
EWSN
2009
Springer
14 years 8 months ago
QoS Management for Wireless Sensor Networks with a Mobile Sink
The problem of configuration of Wireless Sensor Networks is an interesting challenge. The objective is to find the settings, for each sensor node, that optimise certain task-level ...
Rob Hoes, Twan Basten, Wai-Leong Yeow, Chen-Khong ...