Routing Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP Network

Distributed link-state routing protocols, including Open Shortest Path First (OSPF) and Intermediate System–Intermediate System (IS-IS), have successfully provided robust shortest path routing for IP networks. However, shortest path routing is inflexible and sometimes results in congestion on some critical links. By separating the control plane and the data plane, the centralized control of Software Defined Networking (SDN)-based approach possesses flexible routing capabilities. Fibbing is an approach that can achieve centralized control over a network running distributed routing protocols. In a Fibbing-controlled IP network, the controller cleverly generates fake protocol messages to manipulate routers to steer the flow of the desired paths. However, introducing fake nodes destroys the structure of the loop-free property of Loop-Free Alternate (LFA) that is used to achieve fast failure recovery in IP networks. This paper addresses this issue and presents a solution to provision routing paths so a Fibbing network can still apply LFA in the network. The proposed network jointly considers load-balanced and fast failure recovery. We formulate the problem as an integer linear programming problem. The numerical results reveal that the proposed method can provide 100% survivability against any single node or single link failure.

Using the Packet Header Redundant Fields to Improve VoIP Bandwidth Utilization

Timeworn telecommunication are progressively being substituted by a new one that run over IP networks, which is recognized as voice over internet protocol (VoIP). VoIP has a number of qualities (e.g., inexpensive call rate), which make it progressively widespread in the telecommunication domain. However, VoIP faces plentiful obstacles that slow its growth. One of the major obstacles is poorly utilizing the network bandwidth. A number of techniques have been offered to handle this obstacle, including packet multiplexing techniques. This paper designs an original multiplexing techniques, called packet multiplexing and carrier header (PM-CH), to decrease the quantity of the bandwidth consumed by VoIP. PM-CH protect the bandwidth by multiplexing the packets in a header and using the Timestamp field in the RTP header. The achievement of the PM-CH technique was examined depends on connection capacity and payload shortening. Simulation outcomes show that the PM-CH technique outperforms the contrast technique in the two factors. For instance, the PM-CH technique’s connection capacity outperforms the comparable technique by 58.9% when the connection bandwidth is 1000 kbps. Consequently, the PM-CH technique attains its objective of reducing the unexploited bandwidth caused by VoIP.

Performance comparison between virtual MPLS IP network and real IP network without MPLS

In this paper an IP based network consisting of two separate IP networks - a virtual one, running MPLS and an experimental IP network, connected to the virtual one, have been studied. VoIP traffic is exchanged between the two networks. Both networks are connected to the Internet and exchange traffic with it. The virtual network is created by using GNS3. The purpose of this paper is to show a comparison in the performance between the two IP networks. In addition, mathematical distributions and approximations have been made to be used to further evaluate the performance of the two networks. The used methodology in the present work can be applied in the study of different IP networks through which different types of real-time traffic passes.