Sciweavers

478 search results - page 29 / 96
» Diameter and Center Computations in Networks
Sort
View
ICPP
1991
IEEE
15 years 3 months ago
Emulation of a PRAM on Leveled Networks
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...
Michael A. Palis, Sanguthevar Rajasekaran, David S...
COMGEO
2008
ACM
14 years 12 months ago
Constructing minimum-interference networks
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
Marc Benkert, Joachim Gudmundsson, Herman J. Haver...
IPPS
2005
IEEE
15 years 5 months ago
A Novel QoS Multicast Model in Mobile Ad Hoc Networks
Multicast applications for large-scale Mobile Ad hoc NETworks (MANETs) require an efficient and effective Quality of Service (QoS)-aware multicast model. The new requirements to ...
Guojun Wang, Jiannong Cao, Lifan Zhang, Keith C. C...
DSN
2008
IEEE
15 years 1 months ago
Enhanced server fault-tolerance for improved user experience
Interactive applications such as email, calendar, and maps are migrating from local desktop machines to data centers due to the many advantages offered by such a computing environ...
Manish Marwah, Shivakant Mishra, Christof Fetzer
P2P
2009
IEEE
103views Communications» more  P2P 2009»
15 years 6 months ago
Towards Robust Peer Counting
Abstract—This paper describes T-SIZE, a peer counting protocol that is based on gossip-based aggregation. Peer counting has become increasingly important as the size of the netwo...
Alberto Montresor, Ali Ghodsi