Article

An Efficient Routing Mechanism in Network Simulation

Authors:

Zhiyu Hao,

Xiaochun Yun,

Hongli ZhangAuthors Info & Claims

PADS '06: Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation

Pages 150 - 157

https://doi.org/10.1109/PADS.2006.9

Published: 24 May 2006 Publication History

Get Access

Abstract

Simulation is widely recognized as an essential tool to analyze large-scale networks. Routing is a key factor which impacts the scale and efficiency of simulation. This paper presents a new approach to routing calculation, storage and lookup, named MTree_Nix. It maintains variable number of spanning trees as the base routing table and uses well-known Nix-Vector routing to compute on demand the routing states that cannot be covered by any of the spanning trees. Theoretically, we obtain the constraint condition on the optimized trade-off between space and time in MTree_Nix routing. Integrated with the advantages of the current routing mechanisms, MTree_Nix comes to a better trade-off between the storage space for the routing tables and the CPU time for routing lookup. Experimental results show that, with an increasing storage space of only about 1% more than Nix-Vector, MTree_Nix can reduce the simulation time for about 85% compared with Nix-Vector.

References

[1]

{1} P. Huang, D. Estrin, and J. Heidemann, "Enabling Large-scale simulations: selective abstraction approach to the study of multicast protocols," in Proceedings of the International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, Montreal, Canada, July 1998, pp. 241-248.

Digital Library

Google Scholar

[2]

{2} P. Huang and J. Heidemann, "Minimizing routing state for light-weight network simulation," in Proceedings of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, August 2001.

Digital Library

Google Scholar

[3]

{3} A. Hiromori, H. Yamaguchi, K. Yasumoto, T. Higashino and K. Taniguchi, "Reducing the Size of Routing Tables for Large-scale Network Simulation," in Proceedings of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, October 2003.

Digital Library

Google Scholar

[4]

{4} J. Chen, D. Gupta, K. V. Vishwanath, A. C. Snoeren and A. Vahdat, "Routing in an Internet-Scale Network Emulator," in Proceedings of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, October 2004.

Digital Library

Google Scholar

[5]

{5} G. F. Riley, M. H. Ammar, and E. W. Zegura, "Efficient routing with Nix-Vectors," in Proceedings of IEEE Workshop on High Performance Switching and Routing HPSR 2001, 2001.

Google Scholar

[6]

{6} G. F. Riley, R. Fujimoto, and M. H. Ammar, "Stateless routing in network simulations," in Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, May 2000.

Digital Library

Google Scholar

[7]

{7} The VINT Project, http://www.isi.edu/nsnam/vint/, network simulator.

Google Scholar

[8]

{8} S. McCanne and S. Floyd, "The LBNL network simulator," Lawrence Berkeley Laboratory, 1997.

Google Scholar

[9]

{9} D. Magoni and J. Pansiot, "Internet Topology Modeler Based on Map Sampling," in Proceedings of the 7th IEEE Symposium on Computers and Communications, July 2002, pp. 1021-1027.

Digital Library

Google Scholar

Cited By

View all

Stone ADiBenedetto SMills Strout MMassey DAmato NFranke HKelly P(2010)Scalable simulation of complex network routing policiesProceedings of the 7th ACM international conference on Computing frontiers10.1145/1787275.1787345(347-356)Online publication date: 17-May-2010
https://dl.acm.org/doi/10.1145/1787275.1787345

Index Terms

An Efficient Routing Mechanism in Network Simulation

Recommendations

An Efficient Routing Mechanism in Network Simulation

Simulation is widely recognized as an essential tool for analyzing large-scale networks. Routing is a key factor which impacts the simulation scale and efficiency. This paper presents a new approach to routing calculation, storage and lookup, named ...
PRoPHET routing based on distance mechanism in disruption-tolerant network
ICUIMC '14: Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication

In a Disruption-Tolerant Network (DTN), the Probabilistic Routing Protocol using the History of Encounters and Transitivity (PRoPHET) routing protocol mainly uses the delivery predictability of node encounters and transitivity to select and forward ...
Network Structure Aware Dynamical Routing Mechanism in Social Intermittently Connected Wireless Networks
MobiMedia '16: Proceedings of the 9th EAI International Conference on Mobile Multimedia Communications

The nodes in intermittently connected wireless network have social attributes, and their movement has special rules. According to the analysis on the transition regularity of each node in its movement epochs, the nodes in the network are classified into ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PADS '06: Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation

May 2006

199 pages

ISBN:0769525873

Publisher

IEEE Computer Society

United States

Publication History

Published: 24 May 2006

Check for updates

Qualifiers

Article

Conference

PADS06

Sponsor:

SIGSIM

PADS06: PADS '06 - Principles of Advanced and Distributed Simulation

May 24 - 26, 2006

Acceptance Rates

PADS '06 Paper Acceptance Rate 21 of 43 submissions, 49%;

Overall Acceptance Rate 398 of 779 submissions, 51%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
211
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Stone ADiBenedetto SMills Strout MMassey DAmato NFranke HKelly P(2010)Scalable simulation of complex network routing policiesProceedings of the 7th ACM international conference on Computing frontiers10.1145/1787275.1787345(347-356)Online publication date: 17-May-2010
https://dl.acm.org/doi/10.1145/1787275.1787345

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

An Efficient Routing Mechanism in Network Simulation

PRoPHET routing based on distance mechanism in disruption-tolerant network

Network Structure Aware Dynamical Routing Mechanism in Social Intermittently Connected Wireless Networks