Optimized routing protocol for broadband hybrid satellite constellation communication IP network system
- 1.2k Downloads
Long delays and varying delays in triple-play services on a hybrid satellite network are constraints lead for quality of service in end-to-end delay; it is an origin of jitter to make obstacle such as motion freezes and block artifacts in the video. In this paper, the Optimized Routing Protocol for Hybrid Satellite Network (ORPHSN) algorithm is proposed in order to reduce end-to-end delay and determine the best path. The proposed algorithm applies to COMMStellation™ system where hybrid satellite network topology with triple-play services of traffic load applied. The algorithm consists of five metrics which are (1) propagation link delay, (2) queuing delay, (3) link hop count, (4) link utilization, and (5) link length. The simulation results show that the proposed routing algorithm can determine the best routing paths. As a result, link performance is improved due to lower transmission delay and shorter end-to-end delay.
KeywordsEnd-to-end delay Hybrid satellite ORPHSN Routing metrics Triple-play services
A broadband satellite on a low Earth orbit (LEO) satellite network system provides connectivity to cover global users far beyond time and space limitations. To provide and respond to globalize customers, the broadband data satellite networks integrate terrestrial network, satellite network topology, link capacity, and routing which have major impacts on the cost of a network.
A satellite network does not only able to provide high bandwidth with global coverage but also able to support flexible network configuration expansion . The network combines dynamic interconnected backbones of transport network in order to exchange transmitting information. In the telecommunication industry, triple-play encompasses the provisioning of three services: (1) Voice over Internet Protocol (VoIP) through the use of a broadband connection, (2) video on demand (VoD) to broadcasting television, and (3) high-speed Internet with high-performance data transfers. The triple-play service architecture are based on the most popular technology of each standard codec to evaluate performance over broadband hybrid satellite networks.
In order to improve the performance of a satellite network that combines dynamic interconnected backbone transport networks, a new routing protocol is designed . This paper aims to evaluate the Quality of Service (QoS) parameters for triple-play service applications over Broadband Hybrid Satellite Constellation Communication System (BHSCCS)  using the non-geosynchronous Earth orbit satellite network system-based COMMStellation™ satellite system. The proposed technique based on metric costs to optimize the routing path. In order to a make more realistic simulation, a loss links on both wired and wireless connections are set in satellite links . The triple-play service application is chosen as traffic load in the simulations. The Optimized Routing Protocol for Hybrid Satellite Network (ORPHSN) algorithm is implemented and compared with conventional routing techniques.
The remainder of this paper is organized as follows: Section 2 briefly presents the backgrounds and progresses on related research area. Section 3 presents the details of hybrid satellite over LEO constellation architecture and its simulation’s parameters. Section 4 discusses the triple-play services application over a satellite network. Section 5 explains the details of the proposed routing technique with its metric cost. Section 6 discusses the simulation results and analysis. Finally, Section 7 presents the conclusion of this research.
Hybrid networks have both wireless and wired components. A wide variety of networks can be treated according to this framework, including multisatellite constellation network with optical fiber crosslinks . The interconnection to the global communication grid is needed to install a backhaul cable, fiber optics. Most infrastructure-based hybrid networks require significant effort, time, and capital to build and deploy. However, the tremendous adoption of some of these networks is a great testament to their usefulness and commercial viability. There are numerous other communication capabilities to serve such as temporary events, battlefield communications, remote sensing, and robotic networks .
A LEO satellite constellation consists of a set of satellites orbiting the Earth with a high constant speed at a relatively low altitude, using orbits much lower than the geostationary orbit, in order to give global coverage, more frequency reuse, and higher system capacity as a result of this frequency reuse. With the LEO satellite system, each satellite is equipped with a fixed number of antennas that allow it to communicate with terrestrial networks and with other satellites. Routing algorithms are needed to determine the best way to traverse the mesh; a flexible packet-based, rather than static circuit-based, routing approach can take advantage of the redundancy inherent in this mesh [6, 7].
The most straightforward hybrid architecture envisaged is based upon a high-speed forward link using a broadcast lower satellite, whereas the return link takes benefit of the already existing, high bandwidth network architectures such as the synchronous transport module connections. This also enables the seamless migration of broadband satellite constellation systems providing triple-play services into hybrid systems. Such hybrid systems already exist. One can quote, for instance, that the AstraNet system providing IP telecommunication services uses an ASTRA satellite in the forward link and a terrestrial telephone line in the return link. Satellite/terrestrial LTE networks are integrated for IP services delivery, for instance, in the SkyTerra/LightSquared with LTE/satellite network system .
3 Hybrid satellite constellation architecture
The COMMStellation™ satellite network [9, 10] is an orbit with an altitude range around 1000 km. It consists of six orbital planes with 12 satellites in each plane. Those planes have an additional two redundant satellites in every orbit. The spacing between the orbital planes is 30° apart. The Earth station is 10° in the minimum elevation angle to maximize the coverage area of satellites. This will improve the link quality by decreasing multipath fading and having positive impact on link quality when compared with lower elevation of the Earth station. Both the uplink and downlink of the satellite link bandwidth is 1.1 Gbps, and the capacity of the satellite node is 8.8 Gbps. There are two types of stations; they are (1) trunk station that always connects to the Internet backbone and (2) user station for individual client to connect to the satellite link. The available bandwidth of the Internet backbone of the trunk station has a setup link which is the STM-4 transmission and cross link communication which is the STM-1 transmission.
Satellite constellation parameters
Number of orbital plane
Number of satellite per orbital plane
The cutoff elevation angle
Spacing between orbital plane
4 Triple-play service application for traffic loads
There has been an exponential growth in multimedia applications over Internet due to the increasing demand of combining voice, video, and data services known as ‘triple-play bundling’ . In order to support ‘triple-play’, a satellite system needs to be integrated with the Internet to provide appropriate performance across a range of applications that required capacity, minimum jitter, minimum delay, etc. It is a challenge to maintain the QoS for an IP-based satellite network that share communication channel’s capacity among transmitting media. The voice is VoIP [12, 15] with codec G.711 over IPv6, the video is Internet Protocol television (IPTV) [12, 16, 17, 18] with codec H.264 part 10 (1920×1080 @24 fps) over Ipv6, and file transfer using the File Transfer Protocol (FTP) that uses TCP Westwood  over Ipv6 (512 B payload). These are chosen as the traffic loads in the simulations.
5 Proposed routing technique
The routing algorithm for hybrid satellite networks is proposed based on a weighted graph model to solve the QoS routing problem in BHSCCS. The metric selection of the proposed technique based on optimization with the relationship ratio of QoS metric for triple-play services which have strict requirements on bandwidth, delay variations, and availability. Hence, five significant dynamic parameter functions are considered. The first metric is the propagation link delay, which is determined by an advanced propagation delay model from the source to the destination. The second metric is the queuing delay. It is affected by the traffic load on a particular satellite and its outgoing links, as the packet traverses varying traffic gateways. The third metric is link hop count. The fourth metric is link utilization in which the throughput part of all the next neighborhood nodes confirms the best path. The fifth metric is link length that chooses the shortest link between user/trunk stations to both satellites. The five matrices are used to reduce the end-to-end link delays, deteriorate the rerouting frequency, and chose the best route path in the routing table.
5.1 End-to-end delay metric
5.2 Queuing delay metric
5.3 Hop count metric
where E h is the total amount of link hop count on the reachable path.
5.4 Link utilization metric
The link utilization metric denotes the number of bytes transported from the source to the destination per unit of time. It depends on the throughput offered by the least capable link . Suppose the source node is m 1, the destination node is m k ,(m 1,m k ) represents the reachable path from m 1 to m k . Between the two nodes, they are n reachable paths existing, such as (m 1,m 11,m 12,…,m 1j ,…,m k ),(m 1,m 21,m 22,…,m 2j ,…,m k ),…,(m 1,m n1,m n2,…,m nj ,…,m k ).
m nj means the no. j hop node of the no. n reachable path. Among the n path, the optimal path must exist and can be achieved from (15). It represents the minimum availability link utilization among hops from the source to the destination including the total amount of hops on the no. n, hop n , reachable path .
Also, the link utilization has related with realistic traffic density. Hence, the statistics regarding user’s traffic density levels per zone [13, 25] on the above metric will come back to use in this metric again. All the Internet backbone nodes have a traffic load on each node to simulate the traffic generated.
The performance of link utilization is measured as defined in . The goal of this metric is to maximize the efficiency link utilization from m 1 to m k .
where uz is the utilization of hop n computed as the billing efficiency of data that can be sent between nodes.
5.5 Link length metric
A COMMStellation™ model is used in this research. The orbit parameters of every satellite in the COMMStellation™ system at a time point are obtained in a snapshot of the COMMStellation™ satellite constellation at one time point via NS-2 [2, 28]. The differences of a snapshot of the satellite constellation are chosen at different time points. In the snapshot, we notice the satellite orbital parameters, which will be used to calculate the link parameters [28, 29, 30].
where R is assumed to be the distance between the core of the earth and the satellite.
5.6 Apply the proposed routing technique to a hybrid satellite
In this paper, the performance of the proposed algorithm is evaluated based on the weight graph model. The routes are optimized against end-to-end delay or any other linear costs in the deterministic case. Some of these techniques come from the transport optimization field. For non-deterministic networks, most of the early routing algorithms target delivery ratio as the premier objective, metrics such as delay, message size, or network load are secondary. Hence, the best performance indicator is delivery ratio instead of end-to-end delay . In this paper, the best routing path from the source to the destination is chosen using the proposed five metrics which are complicated due to the number of metrics that have been taken into account.
The ORPHSN algorithm is implemented on BHSCCS [2, 26]. The ORPHSN algorithm incorporates both inherent dynamics of hybrid satellite network topology and triple-play services of traffic load in a COMMStellation™ system. Moreover, it applies perfectly to the contribution of the defined five metrics for characterizing routes in a hybrid network in order to reduce end-to-end delay and determine the best path, while at the same time satisfying the QoS requirements.
where P d denotes the propagation end-to-end delay, P q denotes a predicted value of the queuing delay, P h denotes the hop count in a path, P u denotes the link utilization value for each link delay, and P l denotes the link length between satellite and ground.
5.7 Weighted graphs methodology with QoS routing metric
where M is the number of the route for packet pass throughout plane that the system is comprised of and N is the number of nodes per route plane.
By numbering the route planes and the nodes within a system, we can define a pair of numbers (v x ,v y ), called virtual coordinates that uniquely identified a node. Clearly, v x ∈(0,N) identifies the position of a node within a route plane, while v y ∈(0,M) identifies the route plane.
Use the initial link assignment in a routing table. In topological estimation stage, all nodes and links in the network will be traversed; it has to gain cumulative cost values from nodes.
Process L i n k cost following (21) with all the paths in a routing table. Then, compare the cost of the link in the routing table value to the nearest one to set a path list for traveler information.
After the source node had all paths listed from the source to the destination, the process of five metrics is calculated into the mapping table for each metric. For instance, in link utilization, the metric is considered the maximum utilization based on end-to-end nodes which process by (15) and take the P u into a mapping table of P u according link utilization. After that, the process will have mapping tables of each metric. To complete, Eq. (21) makes a calculation for all path lists in the routing table. Then, each path has Linkcost of itself.
The ORPHSN algorithm follows up the calculation into a routing table. In every call request from the source to the destination, the G(V,E) will be constructed in order to find the feasible path. The ORPHSN algorithm considers a feasible path as the path that satisfies bounded requirements for each cost metric. Here, the optimized weight path from the source to the destination in the graph made by GTR corresponds to the optimized cost path in the network graph.
6 Results and discussion
In this research, in order to investigate the performance of the routing algorithm in a broadband hybrid satellite constellation communication system, the proposed ORPHSN algorithm was built on a NS-2 version 2.34 simulation platform.
We implemented five metrics which are (1) end-to-end delay, (2) queuing delay, (3) hop count, (4) link utilization, and (5) link length. These metrics consist routing techniques based on the described network topology and the traffic model given above. The network performance of study routing algorithms is evaluated based on the end-to-end delay between the source and the destination. The source and destination nodes in this experiment are respectively assumed to be located at Bangkok, Thailand, and Boston, MA, with an independent user type.
The simulation results are compared with the conventional algorithms. We managed to simulate the proposed ORPHSN, fixed adaptive routing (FAR) [13, 35], and random adaptive routing (RAR) [13, 35] algorithms with triple-play services load in BHSCCS model network topology.
The measurement of end-to-end delay of triple-play services traffic between two user terminals in Bangkok and Boston is also calculated. The most important metric of the satellite network is propagation delay. Figure 5 illustrates the simulation results of the proposed ORPHSN, FAR, and RAR algorithms. It plots end-to-end delay versus the route length from the source to the destination. The end-to-end propagation delay for the proposed ORPHSN is 81.66 ms for 10 hops, whereas it is 86.66 and 91.66 for FAR and RAR, respectively. This is because the proposed ORPHSN in BHSCCS is compared during route intervals in a routing table with a hybrid network system. The results show that the proposed technique chose the optimized route by having the least number of hops when compared with the conventional techniques.
The satellite routing algorithm based on the optimized path always considers many factors, such as the minimum propagation end-to-end delay, the minimum queuing delay, and the optimal link utilization. This article puts forward an ORPHSN routing technique which optimizes metric cost.
This paper proposed the ORPHSN algorithm over the BHSCCS network. The simulation results show that the performance of the proposed algorithm is better than other conventional algorithms. The ORPHSN algorithm proved contribution has investigated different routing metrics that impact route computation in a hybrid satellite network. Especially, this paper has presented simulation research to compare routing protocols between the hybrid satellite systems within triple-play service application for the end-to-end QoS performance evaluation. The ORPHSN algorithm has a lower transmission delay between end-to-end delays that is the most important for satellite links. Moreover, the research has found out that ORPHSN algorithm has the most optimization end-to-end QoS performance for triple-play service application compared to previous algorithms. Finally, the ORPHSN algorithm can influence the performance of the whole communication network and the quality of communication for BHSCCS network.
- 1.D Zhang, S Liu, M Yin, in Paper Presented at the 7th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). A satellite routing algorithm based on optimization of both delay and bandwidth (IEEEWuhan, China, 2011).Google Scholar
- 3.L Audah, Z Sun, H Cruickshank, in Paper Presented at the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT). QoS evaluation of multiservice applications over integrated satellite-terrestrial networks (IEEEBudapest, Hungary, 2011).Google Scholar
- 4.MJ Neely, Dynamic power allocation and routing for satellite and wireless networks with time varying channels (2003). PhD thesis, Massachusetts Institute of Technology, United States.Google Scholar
- 5.LL Dai, Proactive mobile wireless networks: an infrastructureless wireless network architecture for delay-sensitive applications (2008). PhD thesis, Massachusetts Institute of Technology, United States.Google Scholar
- 7.J Lloret, JR Diaz, F Boronat, M Esteve, in Paper Present at the 3rd International Symposium on Wireless Communication Systems (ISWCS). A satellite connections approach based on spatial footprints (IEEEValencia, Spain, 2006).Google Scholar
- 8.N Courville, H Bischl, E Lutz, A Svigelj, PM Chan, E Papapetrou, RA Cacheda, in Paper Present at the 4th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness 2007 Workshop: Satellite/Terrestrial Internetworking (IWSTI). Hybrid satellite/terrestrial networks: state of the art and future perspectives (ACMVancouver, Canada, 2007).Google Scholar
- 9.GJ Wells, D Cooper, in Paper Presented at the 30th AIAA International Communications Satellites System Conference (ICSSC). COMMStellation™ implementations for northern broadband communications (AIAAOttawa, Canada, 2012).Google Scholar
- 10.GJ Wells, D Cooper, P Sekhavat, S Eagleson, in Paper Presented at the 30th AIAA International Communications Satellites System Conference (ICSSC). COMMStellation™—a low latency satellite constellation for broadband communications (AIAAOttawa, Canada, 2012).Google Scholar
- 11.TR Henderson, L Wood, Ns-2 Satellite Plot Scripts (2000). http://personal.ee.surrey.ac.uk/Personal/L.Wood/ns/satplot-scripts/. Accessed 23 June 2014.
- 12.GP Sotiropoulos, DK Styliaras, EA Kosmatos, CA Papagianni, ND Tselikas, IS Venieris, in Paper Presented at the 6th International Conference on Digital Telecommunications (ICDT’06). Triple play service simulation and packet scheduling performance evaluation (IEEECote d’Azur, French, 2006).Google Scholar
- 13.O Korcak, Routing and network mobility management in next generation satellite networks (2009). PhD thesis, Bogazici University, Turkey.Google Scholar
- 15.C Hoene, H Karl, A Wolisz, in Paper Present at the International Symposium on Performance Evaluation of Computer and Telecommunication System (SPECTS’04). A perceptual quality model for adaptive VoIP applications (SCSCalifornia, USA, 2004).Google Scholar
- 16.I Papapanagiotou, M Devetsikiotis, in Paper Present at the 7th Consumer Communications and Networking Conference (CCNC). Aggregation network design methodologies for triple play services (IEEELas Vegas, USA, 2010).Google Scholar
- 18.PJ Sims, in Paper Present at the IEEE Globecom Workshops. A study on video over IP and the effects on FFTx architectures (IEEEWashington, USA, 2007).Google Scholar
- 19.S Mascolo, C Casetti, M Gerla, MY Sanadidi, R Wang, TCP Westwood, in Paper Present at the 7th Annual International Conference on Mobile Computing and Networking (MobiCom ’01). Bandwdith estimation for enhanced transport over wireless links (ACMRome, Italy, 2001).Google Scholar
- 21.SAM Makki, N Pissinou, P Daroux, in Paper Present at the 10th International Conference on Computer Communications and Networks (ICCCN). A new routing algorithm for low earth orbit satellite networks (IEEEScottsdale, Arizona, USA, 2001).Google Scholar
- 24.KS Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Application, 2nd edn. (John Wiley and Sons, Chichester, UK, 2001).Google Scholar
- 26.A Boriboon, S Pongpadpinit, Performance evaluation of various TCP protocol over broadband hybrid satellite constellation communication system. Int. J. Comput. Sci. Telecommun.5(12), 1–6 (2014).Google Scholar
- 27.R Yuan, W Ruchuan, Multi-path QoS routing using genetic algorithm for LEO satellite networks. Chin. J. Electron.20(1), 17–20 (2011).Google Scholar
- 28.TR Henderson, RH Katz, in Paper Present at the 18th AIAA International Communications Satellites System Conference (ICSSC). Network simulation for LEO satellite networks (AIAAOakland, California, 2000).Google Scholar
- 29.Z Luo, Routing and end-to-end quality of service in satellite IP networks (2008). PhD thesis, University of Surrey, United Kingdom.Google Scholar
- 30.L Wood, Internetworking with satellite constellations (2001). PhD thesis, University of Surrey, United Kingdom.Google Scholar
- 31.R Sedgewick, Algorithms in C, Part 5 Graph Algorithms, 3rd edn. (Addison-Wesley, Canada, 2002).Google Scholar
- 32.A Jukan, HN Nguyen, HRV As, in Paper Present at the International Conference on Communication Technology Proceedings (WCC - ICCT 2000). An approach to QoS-based routing for LEO satellite networks (IEEEBeijing, China, 2000).Google Scholar
- 33.HN Nguyen, A Jukan, in Paper Present at the IEEE Global Telecommunication Conference (GLOBECOM ’00). An approach to QoS-based routing for low Earth orbit satellite networks (IEEESan Francisco, USA, 2000).Google Scholar
- 34.E Papapetrou, FN Pavlidou, in Paper Present at the Global Telecommunications Conference (IEEE GLOBECOM 2008). Distributed load-aware routing in LEO satellite networks (IEEENew Orleans, Louisiana, 2008).Google Scholar
- 35.O Korcak, F Alagoz, in Paper Present at the 23rd AIAA International Communications Satellite Systems Conference (ICSSC). Priority-based adaptive shortest path routing for IP over LEO satellite networks (AIAARome, Italy, 2005).Google Scholar
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.