Sciweavers

254 search results - page 37 / 51
» Semi-autonomous networks: Network resilience and adaptive tr...
Sort
View
IPPS
2007
IEEE
15 years 5 months ago
Online Aggregation over Trees
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula
TPDS
2008
91views more  TPDS 2008»
14 years 11 months ago
SSW: A Small-World-Based Overlay for Peer-to-Peer Search
Peer-to-peer (P2P) systems have become a popular platform for sharing and exchanging voluminous information among thousands or even millions of users. The massive amount of inform...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam, Jin...
USITS
2003
15 years 19 days ago
Using Random Subsets to Build Scalable Network Services
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...
TMC
2008
136views more  TMC 2008»
14 years 11 months ago
Efficient Resource Allocation for Wireless Multicast
In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by...
De-Nian Yang, Ming-Syan Chen
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
15 years 4 months ago
Railway Delay Management: Exploring Its Algorithmic Complexity
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
Michael Gatto, Björn Glaus, Riko Jacob, Leon ...