Download Free Advanced Routing Protocols For Satellite And Space Networks Book in PDF and EPUB Free Download. You can read online Advanced Routing Protocols For Satellite And Space Networks and write the review.

Satellite systems have the advantage of global coverage and offer a solution for providing broadband access to end users. Local terrestrial networks and terminals can be connected to the rest of the world over Low Earth Orbit (LEO) satellite networks simply by installing small satellite interfaces. With these properties, satellite systems play a crucial role in the global Internet to support real-time and non-real-time applications. Routing in satellite networks, and the integration of satellite networks and the terrestrial Internet are the key issues to support these services. Furthermore, the developments in space technologies enable the realization of deep-space missions such as Mars exploration. The Interplanetary Internet is envisioned to provide communication services for scientific data delivery and navigation services for the explorer spacecrafts and orbiters of future deep-space missions. The unique characteristics posed by deep-space communications call for different research approaches from those in terrestrial networks. The objective of this research is to develop advanced architectures and efficient routing protocols for satellite and space networks to support applications with different traffic types and heterogeneous quality-of-service (QoS) requirements. Specifically, a new QoS-based routing algorithm (QRA) is proposed as a connection-oriented routing scheme to support real-time multimedia applications in satellite networks. Next, the satellite grouping and routing protocol (SGRP) is presented as a unicast routing protocol in a two-layer satellite IP network architecture. The border gateway protocol - satellite version (BGP-S) is then proposed as a unified routing protocol to accomplish the integration of the terrestrial and satellite IP networks at the network layer. Finally, a new routing framework, called the space backbone routing (SBR), is introduced for routing through different autonomous regions in the Interplanetary Internet. SBR provides a self-contained and scalable solution to support different traffic types through the Interplanetary Internet.
Satellite Network Robust QoS-aware Routing presents a novel routing strategy for satellite networks. This strategy is useful for the design of multi-layered satellite networks as it can greatly reduce the number of time slots in one system cycle. The traffic prediction and engineering approaches make the system robust so that the traffic spikes can be handled effectively. The multi-QoS optimization routing algorithm can satisfy various potential user requirements. Clear and sufficient illustrations are also presented in the book. As the chapters cover the above topics independently, readers from different research backgrounds in constellation design, multi-QoS routing, and traffic engineering can benefit from the book. Fei Long is a senior engineer at Beijing R&D Center of 54th Research Institute of China Electronics Technology Group Corporation.
This text introduces the principles of routing protocols and metrics as they affect wireless networking environments, specifically in urban areas. Timely because of the recent rise in small city life, this topic includes the consideration of ad hoc, mesh, vehicular, sensor, and delay tolerant networks. These approaches are each unique, and author Miguel Mitre Campista provides a thorough, but accessible, explanation of their individual characteristics for engineers, computer scientists, IT professionals, and curious Internet users.
Satellite networking is an exciting and expanding field that hasevolved significantly since the launch of the firsttelecommunications satellite, from telephone and broadcast tobroadband ATM and Internet. With increasing bandwidth and mobilitydemands on the horizon, satellites have become an integral part ofthe Global Network Infrastructure (GNI). Satellite Networking:Principles and Protocols provides a balanced coverage ofsatellite topics from a network point of view, focusing on networkaspects, services and applications, quality of service (QoS) andprinciples and protocols. Introduces the basics of ATM and internet protocols, andcharacteristics of satellite networks and internetworking betweensatellite and terrestrial networks Discusses the real-time protocols including RTP, RTCP and SIPfor real-time applications such as VoIP and MMC Coverage of new services and applications, internet trafficengineering and MPLS Examines IPv6 over satellite using tunnelling and translationtechniques, evolution of earth stations, user terminals and networkprotocols, and development of satellite networking Includes a Companion Website featuring: Solutions manual, and electronic versions of the figures This text is essential reading for senior undergraduates,postgraduates, and researchers in the fields of satellites,communications and networks. It will also have instant appeal toengineers, managers and operators in these fields.
Modern warfare is placing an increasing reliance on global communications. Currently under development are several Low Earth Orbit (LEO) satellite systems that propose to deliver voice and data traffic to subscribers anywhere on the globe. However, very little is known about the performance of conventional routing protocols under orbital conditions where the topology changes on a scale of minutes rather than days. This thesis compares two routing protocols in a LEO environment. One (Extended Bellman-Ford) is a conventional terrestrial routing protocol, while the other (Darting) is a new protocol which has been proposed as suitable for use in LEO networks. These protocols are compared via computer simulation in two of the proposed LEO systems (Globalstar and Iridium), under various traffic intensities. Comparative measures of packet delay, convergence speed, and protocol overhead are made It was found both protocols were roughly equivalent in end-to-end delay characteristics, though the Darting protocol had a much higher overhead load and demonstrated higher instability at network update periods. For example, while steady state end-to- end delays were within a few milliseconds, in one case Darting showed an increase of 764% in convergence time over Extended Bellman-Ford with an increase of 149% in overhead. Over all cases, Darting required an average of 72.1% more overhead than Extended Bellman-Ford to perform the same work. Darting was handicapped by its strong correlation between data traffic and protocol overhead. Modifications to reduce this overhead would result in much closer performance.
Routing and Quality-of-Service in Broadband LEO Satellite Networks describes mechanisms for supporting Quality-of-Service (QoS) strategies that consider properties of low earth orbit satellite networks and their effects on link handover. A graph model representing the dynamic topology of a satellite constellation is introduced based on a new parameter, lifetime. Novel routing and resource reservation algorithms as well as connection admission control strategies are proposed to minimize the handover blocking probability while maintaining QoS requirements. The author also discusses the roles of satellites in an all-IP mobile network architecture and the problems of mobility, QoS provisioning, and routing. This work will be of particular interest to researchers and professionals working on mobility networking in next generation networks.
This book constitutes the refereed proceedings of the Second IFIP TC 5/8 International Conference on Information and Communication Technology, ICT-Eur Asia 2014, with the collocation of Asia ARES 2014 as a special track on Availability, Reliability and Security, held in Bali, Indonesia, in April 2014. The 70 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers have been organized in the following topical sections: applied modeling and simulation; mobile computing; advanced urban-scale ICT applications; semantic web and knowledge management; cloud computing; image processing; software engineering; collaboration technologies and systems; e-learning; data warehousing and data mining; e-government and e-health; biometric and bioinformatics systems; network security; dependable systems and applications; privacy and trust management; cryptography; multimedia security and dependable systems and applications.
Satellite networks and transmissions find their application in fields of computer communications, telephone communications, television broadcasting, transportation, space situational awareness systems and so on. This thesis mainly focuses on two networking issues affecting satellite networking: network congestion control and network routing optimization. Congestion, which leads to long queueing delays, packet losses or both, is a networking problem that has drawn the attention of many researchers. The goal of congestion control mechanisms is to ensure high bandwidth utilization while avoiding network congestion by regulating the rate at which traffic sources inject packets into a network. In this thesis, we propose a stable congestion controller using data-driven, safe switching control theory to improve the dynamic performance of satellite Transmission Control Protocol/Active Queue Management (TCP/AQM) networks. First, the stable region of the Proportional-Integral (PI) parameters for a nominal model is explored. Then, a PI controller, whose parameters are adaptively tuned by switching among members of a given candidate set, using observed plant data, is presented and compared with some classical AQM policy examples, such as Random Early Detection (RED) and fixed PI control. A new cost detectable switching law with an interval cost function switching algorithm, which improves the performance and also saves the computational cost, is developed and compared with a law commonly used in the switching control literature. Finite-gain stability of the system is proved. A fuzzy logic PI controller is incorporated as a special candidate to achieve good performance at all nominal points with the available set of candidate controllers. Simulations are presented to validate the theory. An effocient routing algorithm plays a key role in optimizing network resources. In this thesis, we briefly analyze Low Earth Orbit (LEO) satellite networks, review the Cross Entropy (CE) method and then develop a novel on-demand routing system named Cross Entropy Accelerated Ant Routing System (CEAARS) for regular constellation LEO satellite networks. By implementing simulations on an Iridium-like satellite network, we compare the proposed CEAARS algorithm with the two approaches to adaptive routing protocols on the Internet: distance-vector (DV) and link-state (LS), as well as with the original Cross Entropy Ant Routing System (CEARS). DV algorithms are based on distributed Bellman Ford algorithm, and LS algorithms are implementation of Dijkstras single source shortest path. The results show that CEAARS not only remarkably improves the convergence speed of achieving optimal or suboptimal paths, but also reduces the number of overhead ants (management packets).
In the rapidly changing environment of mobile communications, the importance of the mobile satellite (e,g,, low earth orbit satellites (LEOsats)) networks will increase due to their global visibility and connection. Multicasting is an effective communication method in terms of frequency spectrum usage for a LEO network. It is devised to provide lower network traffic (i,e,, one-to-many transmissions). This research examines the system performance of two dissimilar terrestrially-based multicasting protocols: the Distance Vector Multicast Routing Protocol (DVMRP) and the On Demand Multicast Routing Protocol (ODMRP). These two protocols are simulated in large group membership density and in the presence of satellite failures. Two different algorithms are developed and used to select critical satellites for degrading a LEO network constellation. The simulation results show that the ODMRP protocol successfully reconfigured routes in large group membership density areas and in satellite failure conditions. Results also show that the ODMRP provided reliable packet delivery. However, ODMRP showed an enormous end-to-end delay in severe satellite failure conditions. This result is attributable to the delayed route refreshing procedure of ODMRP. In contrast, the DVMRP suffered from broken routes and complexity in the large group membership density and in satellite failure conditions. It had a smaller packet delivery ratio than the ODMRP (approximately 85,5% versus 98,9% for the 80 user case). The DVMRP showed scalable and stable end-to-end delay under multiple failed satellite conditions. The large group membership density and the multiple satellite failure conditions provide a more complete assessment for these two protocols.
The proposed research is a development a routing protocol for space that creates an infrastructure which enables routers on board spacecrafts to calculate near optimum routing tables ahead of time and on-demand when network changes occur. Our routing protocol for space communication, Space Open Shortest Path First (SOSPF), divides the routing domain (e.g., our solar system) into areas within areas which provides an orderly fashion of transmitting routing information throughout the routing domain. The concept of areas within SOSPF allows routing information of one area to be hidden within that area. In addition, since the trajectory of space crafts are either predictable (e.g., satellite constellation around Earth), preset (e.g., the International Space Station), or set on demand (e.g., a space shuttle), a router on board those spacecrafts calculates the time intervals where spacecrafts are in direct view with the calculating router and the propagation delays to those spacecrafts using the location of those spacecrafts and the local transmission capabilities. Then, those calculated values are dispersed throughout the routing domain. Also, this dissertation presents a routing algorithm which allows routers on board spacecrafts to use the received routing information (i.e., the time intervals and the propagation delay) to compute the routing table. This routing algorithm can compute shortest delay paths over conventional concurrent-link as well as intermittent-links using a store-and-forward communication scheme. Furthermore, this dissertation presents routing performance of this routing protocol in real space scenarios and shows how the SOSPF routing domain stays stable after link failures as the routing domain diameter grows to the end of our solar system.