Sciweavers

3809 search results - page 312 / 762
» Randomized Broadcast in Networks
Sort
View
TON
2008
106views more  TON 2008»
15 years 6 months ago
On static and dynamic partitioning behavior of large-scale P2P networks
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
16 years 1 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
ACMSE
2004
ACM
16 years 15 hour ago
Recent advances in mobility modeling for mobile ad hoc network research
In this paper, we survey recent advances in mobility modeling for mobile ad hoc network research. The advances include some new mobility models and analysis of older mobility mode...
Qunwei Zheng, Xiaoyan Hong, Sibabrata Ray
CAAN
2004
Springer
15 years 12 months ago
Bipartite Graphs as Models of Complex Networks
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
Jean-Loup Guillaume, Matthieu Latapy
NOMS
2010
IEEE
147views Communications» more  NOMS 2010»
15 years 5 months ago
Distributed approaches to S-CSCF selection in an IMS network
—The IP Multimedia Subsystem (IMS) is a generic open-systems architecture offering converged multimedia services over IP. A function in the signaling plane of an IMS network is t...
Plarent Tirana, Deep Medhi