Sciweavers

445 search results - page 63 / 89
» Maximizable Routing Metrics
Sort
View
INFOCOM
2003
IEEE
15 years 3 months ago
Big-Bang Simulation for embedding network distances in Euclidean space
— Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selectio...
Yuval Shavitt, Tomer Tankel
103
Voted
INFOCOM
2003
IEEE
15 years 3 months ago
Random Waypoint Considered Harmful
— This study examines the random waypoint model widely used in the simulation studies of mobile ad hoc networks. Our findings show that this model fails to provide a steady stat...
Jungkeun Yoon, Mingyan Liu, Brian Noble
EMO
2001
Springer
100views Optimization» more  EMO 2001»
15 years 2 months ago
Fuzzy Evolutionary Hybrid Metaheuristic for Network Topology Design
Abstract. Topology design of enterprise networks is a hard combinatorial optimization problem. It has numerous constraints, several objectives, and a very noisy solution space. Bes...
Habib Youssef, Sadiq M. Sait, Salman A. Khan
127
Voted
GLOBECOM
2010
IEEE
14 years 7 months ago
Multicasting vs. Broadcasting: What Are the Trade-Offs?
Network-wide broadcasting and multicasting are two important routing schemes used in group communications. In network-wide broadcasting, generated packets at the source node are di...
Bora Karaoglu, Wendi Rabiner Heinzelman
94
Voted
IPPS
2008
IEEE
15 years 4 months ago
The design of a versatile, secure P2PSIP communications architecture for the public internet
Communications systems, encompassing VoIP, IM, and other personal media, present different challenges for P2P environments than other P2P applications. In particular, reliable com...
David A. Bryan, Bruce Lowekamp, Marcia Zangrilli