Sciweavers

3265 search results - page 473 / 653
» Distributed Slicing in Dynamic Systems
Sort
View
TON
2002
91views more  TON 2002»
15 years 4 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
P2P
2010
IEEE
207views Communications» more  P2P 2010»
15 years 2 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno
ICDCS
2009
IEEE
16 years 1 months ago
Q-Tree: A Multi-Attribute Based Range Query Solution for Tele-immersive Framework
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
Md. Ahsan Arefin, Md. Yusuf Sarwar Uddin, Indranil...
SIGIR
2005
ACM
15 years 10 months ago
Improving collection selection with overlap awareness in P2P search engines
Collection selection has been a research issue for years. Typically, in related work, precomputed statistics are employed in order to estimate the expected result quality of each ...
Matthias Bender, Sebastian Michel, Peter Triantafi...
ATAL
2008
Springer
15 years 6 months ago
Using organization knowledge to improve routing performance in wireless multi-agent networks
Multi-agent systems benefit greatly from an organization design that guides agents in determining when to communicate, how often, with whom, with what priority, and so on. However...
Huzaifa Zafar, Victor R. Lesser, Daniel D. Corkill...