Sciweavers

1432 search results - page 164 / 287
» Hardness of robust network design
Sort
View
MOBIHOC
2002
ACM
16 years 6 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
SIGCOMM
2009
ACM
16 years 26 days ago
CrossTalk: scalably interconnecting instant messaging networks
We consider the problem of interconnecting a simple type of social network: Instant Messaging services. Today, users are members of various IM communities such as AOL, Yahoo, and ...
Marti A. Motoyama, George Varghese
IMC
2006
ACM
16 years 9 days ago
Understanding churn in peer-to-peer networks
The dynamics of peer participation, or churn, are an inherent property of Peer-to-Peer (P2P) systems and critical for design and evaluation. Accurately characterizing churn requir...
Daniel Stutzbach, Reza Rejaie
WOSP
2005
ACM
15 years 12 months ago
Performance evaluation of UML software architectures with multiclass Queueing Network models
Software performance based on performance models can be applied at early phases of the software development cycle to characterize the quantitative behavior of software systems. We...
Simonetta Balsamo, Moreno Marzolla
MIDDLEWARE
2005
Springer
15 years 12 months ago
Distributed collaboration for event detection in wireless sensor networks
With the advancement of technology in micro-electronics and wireless communication, small miniature devices called sensor nodes can be used to perform various tasks by forming the...
A. V. U. Phani Kumar, Adi Mallikarjuna Reddy V, D....