Sciweavers

638 search results - page 63 / 128
» Robust Topology Representing Networks
Sort
View
BERTINORO
2005
Springer
15 years 5 months ago
Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
Niloy Ganguly, Lutz Brusch, Andreas Deutsch
INFOCOM
2003
IEEE
15 years 5 months ago
Distributed Construction of Random Expander Networks
— We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globall...
Ching Law, Kai-Yeung Siu
73
Voted
LCN
2007
IEEE
15 years 6 months ago
Efficient MD Coding Core Selection to Reduce the Bandwidth Consumption
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
Sunoh Choi, Sang-Seon Byun, Chuck Yoo
NCA
2003
IEEE
15 years 5 months ago
Performance Analysis of an Application-level Cooperative Control Protocol
This paper proposes the modeling and the performance analysis of a high-level control protocol – COCOP, which enables cooperative groups of clients to control a shared server de...
Giancarlo Fortino, Carlo Mastroianni, Wilma Russo
IWANN
1997
Springer
15 years 4 months ago
A Fast Kohonen Net Implementation for Spert-II
We present an implementation of Kohonen Self-Organizing Feature Maps for the Spert-II vector microprocessor system. The implementation supports arbitrary neural map topologies and ...
Krste Asanovic