Sciweavers

209 search results - page 15 / 42
» Algorithms for Network Topology Discovery using End-to-End M...
Sort
View
DBISP2P
2003
Springer
113views Database» more  DBISP2P 2003»
14 years 26 days ago
Structuring Peer-to-Peer Networks Using Interest-Based Communities
Abstract. Interest-based communities are a natural arrangement of distributed systems that prune the search space and allow for better dissemination of information to participating...
Mujtaba Khambatti, Kyung Dong Ryu, Partha Dasgupta
ASC
2011
13 years 2 months ago
Quality of Service constrained routing optimization using Evolutionary Computation
In this work, a novel optimization framework is proposed that allows the improvement of Quality of Service levels in TCP/IP based networks, by configuring the routing weights of ...
Miguel Rocha, Pedro Sousa, Paulo Cortez, Miguel Ri...
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
13 years 11 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...
INFOCOM
1999
IEEE
13 years 12 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
HUMAN
2003
Springer
14 years 26 days ago
A Graph-Based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks
Multipath on-demand routing protocols for mobile ad hoc networks try to reduce control overhead and end-to-end delay by computing multiple paths with a single route discovery proce...
Gunyoung Koh, Duyoung Oh, Heekyoung Woo