Sciweavers

2279 search results - page 339 / 456
» Distributed Spectrum-Efficient Routing Algorithms in Wireles...
Sort
View
KIVS
2005
Springer
15 years 9 months ago
Measuring Large Overlay Networks - The Overnet Example
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...
Kendy Kutzner, Thomas Fuhrmann
FTNET
2007
107views more  FTNET 2007»
15 years 3 months ago
Network Optimization and Control
We study how protocol design for various functionalities within a communication network architecture can be viewed as a distributed resource allocation problem. This involves unde...
Srinivas Shakkottai, R. Srikant
139
Voted
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 3 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
ICDCSW
2006
IEEE
15 years 9 months ago
Dimension-Based Subscription Pruning for Publish/Subscribe Systems
Subscription pruning has been proven as valuable routing optimization for Boolean subscriptions in publish/subscribe systems. It aims at optimizing subscriptions independently of ...
Sven Bittner, Annika Hinze
CISS
2008
IEEE
15 years 10 months ago
Appropriate control of wireless networks with flow level dynamics
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
Long Le, Ravi R. Mazumdar