867 search results - page 98 / 174 » Network Robustness and Graph Topology |
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
TC
2010
13 years 6 months ago
2010
—There are increasing interest and big challenge in designing a scalable and robust multicast routing protocol in a mobile ad hoc network (MANET) due to the difficulty in group ...
INCDM
2010
Springer
13 years 6 months ago
2010
Springer
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
A multi-agent system can be analyzed and specified as an organization consisting of roles and their relations. The performance of an organization depends on many factors among whi...