Traffic class dependent routing in ISL networks

Abstract

This work addresses traffic class dependent (TCD) routing, using different link-cost functions, in the intersatellite link (ISL) network of a nongeostationary packet-switched satellite communication system. Three different traffic classes are introduced, each with its particular optimisation criteria. Performance analysis of TCD routing, in terms of average packet delay and average data throughput of a particular traffic class, is evaluated for homogeneous and nonhomogeneous traffic scenarios using a specifically developed simulation model of the ISL network.Manuscript

Multiservice on-demand routing in LEO satellite networks

“…MOR was compared to the sole proposal as yet for multiservice LEO networks, i.e., the Traffic Class Dependent Routing (TCDR) protocol [12], [13]. In order to ameliorate the performance of TCDR, the period for path calculation T p was set to 10sec.…”

“…In this graph each satellite is uniquely defined by the pair of virtual coordinates (x, y), where x and y denote the orbital plane and the position of the satellite in this plane respectively. In addition, the network is considered to support three different service classes [12], [13]:…”

“…Only the study in [12], [13] dealt with the issue of traffic class dependent routing. In particular, periodic path calculation based on the Dijkstra algorithm is employed along with a link-cost metric that consisted of the sum of the propagation and queuing delays for both delay-sensitive and best-effort traffic, whereas for throughput-sensitive traffic the normalized available bandwidth of the link was considered as the link-cost metric and the Bellman-Ford shortest path algorithm was adopted to compute paths that offer the maximum available bandwidth within a minimum hop count.…”

Routing and Traffic Engineering in Dynamic Packet-Oriented Networks

“…They have a significant effect on the routing performance and are scalable with the network load and link capacity, thus being well suited for link-cost metric. (Mohorcic et al, 2004;Svigelj et al, 2004a).…”

“…An example of such approach is adaptive forwarding policy based on local information about the link load (Svigelj et al, 2003(Svigelj et al, , 2004bMohorcic et al 2004). This policy selects the most suitable outgoing link taking into account routing tables with alternative routes, calculated using link costs obtained during the previous routing update interval, and current local information on the link status.…”