DocumentCode
2215423
Title
Toward scaling network emulation using topology partitioning
Author
Yocum, Ken ; Eade, Ethan ; Degesys, Julius ; Becker, David ; Chase, Jeff ; Vahdat, Amin
Author_Institution
Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
fYear
2003
fDate
12-15 Oct. 2003
Firstpage
242
Lastpage
245
Abstract
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the network topology across processors, as a technique to increase emulation capacity with increasing hardware resources. We develop methods to create partitions based on expected communication across the topology. Our evaluation methodology quantifies the communication overhead or efficiency of the resulting partitions. We implement and contrast three partitioning strategies in ModelNet, a large-scale network emulator, using different topologies and uniform communication patterns. Results show that standard graph partitioning algorithms can double the efficiency of the emulation for Internet-like topologies relative to random partitioning.
Keywords
Internet; graph theory; network topology; telecommunication traffic; Internet-like topology; ModelNet; graph partitioning algorithm; large complex network system; large-scale network emulator; network topology partitioning; random partitioning; scaling network emulation; topology partitioning; uniform communication pattern; Computational modeling; Emulation; Hardware; Large-scale systems; Network servers; Network topology; Partitioning algorithms; Peer to peer computing; Traffic control; Web server;
fLanguage
English
Publisher
ieee
Conference_Titel
Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003. 11th IEEE/ACM International Symposium on
ISSN
1526-7539
Print_ISBN
0-7695-2039-1
Type
conf
DOI
10.1109/MASCOT.2003.1240666
Filename
1240666
Link To Document