Dynamic Source Routing Strategy for Two-Level Flows on Scale-Free Networks

Zhong-Yuan Jiang,Man-Gui Liang,Jia-Jing Wu,Timothy Ravasi

doi:10.1371/journal.pone.0082162

Abstract

Packets transmitting in real communication networks such as the Internet can be classified as time-sensitive or time-insensitive. To better support the real-time and time-insensitive applications, we propose a two-level flow traffic model in which packets are labeled as level-1 or level-2, and those with level-1 have higher priority to be transmitted. In order to enhance the traffic capacity of the two-level flow traffic model, we expand the global dynamic routing strategy and propose a new dynamic source routing which supports no routing-flaps, high traffic capacity, and diverse traffic flows. As shown in this paper, the proposed dynamic source routing can significantly enhance the traffic capacity and quality of time-sensitive applications compared with the global shortest path routing strategy.

Highlights

In the past two decades, a variety of real-world networks are demonstrated to have small-world phenomenon [1] and scale-free properties [2,3], such as the Internet, World Wide Web (WWW), highway networks, social networks, etc
Because global dynamic routing strategy considers the realtime queue length of nodes as routing costs to dramatically redistribute the overall traffic on all nodes, the traffic capacity of network achieves the highest value among recently proposed routing strategies so far [22]
We investigate the evolution of traffic capacity Rc with different fr under the shortest path routing and dynamic source routing strategy

Summary

Introduction

In the past two decades, a variety of real-world networks are demonstrated to have small-world phenomenon [1] and scale-free properties [2,3], such as the Internet, World Wide Web (WWW), highway networks, social networks, etc. The global dynamic routing enhances traffic capacity of network at the cost of longer packet traveling time from source to destination, and might cause routing flaps in real communication networks. In order to optimize the packet transportation process in this two-level flow traffic model, we propose one dynamic source routing(DS), in which each data packet carries the complete path information from its source to destination.

Results

Conclusion