Sciweavers

1511 search results - page 153 / 303
» Randomness, lowness and degrees
Sort
View
AINA
2007
IEEE
16 years 23 days ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
GLOBECOM
2006
IEEE
16 years 14 days ago
A Novel Semi-Markov Smooth Mobility Model for Mobile Ad Hoc Networks
Abstract— Existing random mobility models have their limitations such as speed decay and sharp turn which have been demonstrated by the previous studies. More importantly, mobili...
Ming Zhao 0001, Wenye Wang
SIGMETRICS
2005
ACM
15 years 12 months ago
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
Derek Leonard, Vivek Rai, Dmitri Loguinov
GCC
2005
Springer
15 years 12 months ago
A Mathematical Foundation for Topology Awareness of P2P Overlay Networks
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying ...
Habib Rostami, Jafar Habibi
MIDDLEWARE
2005
Springer
15 years 12 months ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper