An Efficient Routing Mechanism In Network Simulation  

Oleh:

Hao, Zhiyu ; Yun, Xiaochun ; Zhang, Hongli

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: Simulation vol. 84 no. 12 (Dec. 2008), page 511-520.
Topik: network simulation; routing mechanism; MTree_Nix
Fulltext: 511.pdf (790.76KB)

Isi artikel

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 MTree_Nix routing. It maintains a variable number of spanning trees as the base routing table, and uses 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 a storage space of only about 1% more than Nix-Vector, MTree_Nix can reduce the simulation time to about 85% of that using Nix-Vector.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali