Congestion-Free Transient Plane (CFTP) Using Bandwidth Sharing During Link Failures in SDN

2019 ◽  
Vol 63 (6) ◽  
pp. 832-843
Author(s):  
Muthumanikandan Vanamoorthy ◽  
Valliyammai Chinnaiah
Keyword(s):  
Packet Loss ◽  
Effective Bandwidth ◽  
Bandwidth Utilization ◽  
Bandwidth Sharing ◽  
Link Failures ◽  
Data Packets ◽  
Multiple Flows ◽  
Flow Table ◽  
Speed Up ◽  
Plane Technique

Abstract Software-defined networking (SDN) is an emerging trend where the control plane and the data plane are separated from each other, culminating in effective bandwidth utilization. This separation also allows multi-vendor interoperability. Link failure is a major problem in networking and must be detected as soon as possible because when a link fails the path becomes congested and packet loss occurs, delaying the delivery of packets to the destination. Backup paths must be configured immediately when a failure is detected in the network to speed up packet delivery, avoid congestion and packet loss and provide faster convergence. Various SDN segment protection algorithms that efficiently reduce CPU cycles and flow table entries exist, but each has drawbacks. An independent transient plane technique can be used to reduce packet loss but is not as efficient when multiple flows try to share the same link. The proposed work focuses on reducing congestion, providing faster convergence with minimal packet loss and effectively utilizing link bandwidth using bandwidth-sharing techniques. An analysis and related studies show that this method performs better and offers a more reliable network without loss, while simultaneously ensuring the swift delivery of data packets toward the destination without congestion, compared to the other existing schemes.

scholarly journals Redundancy Gateway Menggunakan Metode Failover dan Load Sharing Gateway

2020 ◽  
Vol 9 (1) ◽  
pp. 22-31
Author(s):  
Rachmat Adi Purnama ◽  
Firmansyah Firmansyah
Keyword(s):  
Packet Loss ◽  
Heavy Traffic ◽  
Load Sharing ◽  
Link Failures ◽  
Transfer Data ◽  
Data Packets ◽  
Traffic Loads

Failure to transfer data packets on a network becomes a big threat, both caused by link failures and heavy traffic loads. To maintain stability in the network, the VRRP gateway redundancy protocol is applied. From the results of the research conducted, it takes an average time to failover for 3.75ms from the master router to the backup router and an average packet loss that occurs as many as 3 packets and the average time needed to failover from the backup router back to master router for 1.37ms and 1.5 packet loss occurred. The results of load sharing research are able to make 1 router device as a master router in 2 VRID at once. Implementing both Failover and Load Sharing methods can improve connectivity in the network by ensuring connectivity can run stably and equally. Failover is used as a backup gateway redundancy and load sharing is used to divide the gateway load equally.

ICMA: AN EFFICIENT INTEGRATED CONGESTION CONTROL APPROACH

2019 ◽  
Vol 14 ◽  
Author(s):  
Tayyab Khan ◽  
Karan Singh ◽  
Kamlesh C. Purohit
Keyword(s):  
Congestion Control ◽  
Packet Loss ◽  
Control Method ◽  
Multicast Communication ◽  
Bandwidth Utilization ◽  
File Transfer ◽  
Control Approach ◽  
Communication Technique ◽  
Control Scheme ◽  
Multiparty Video Conferencing

Background: With the growing popularity of various group communication applications such as file transfer, multimedia events, distance learning, email distribution, multiparty video conferencing and teleconferencing, multicasting seems to be a useful tool for efficient multipoint data distribution. An efficient communication technique depends on the various parameters like processing speed, buffer storage, and amount of data flow between the nodes. If data exceeds beyond the capacity of a link or node, then it introduces congestion in the network. A series of multicast congestion control algorithms have been developed, but due to the heterogeneous network environment, these approaches do not respond nor reduce congestion quickly whenever network behavior changes. Objective: Multicasting is a robust and efficient one-to-many (1: M) group transmission (communication) technique to reduced communication cost, bandwidth consumption, processing time and delays with similar reliability (dependability) as of regular unicast. This patent presents a novel and comprehensive congestion control method known as integrated multicast congestion control approach (ICMA) to reduce packet loss. Methods: The proposed mechanism is based on leave-join and flow control mechanism along with proportional integrated and derivate (PID) controller to reduce packet loss, depending on the congestion status. In the proposed approach, Proportional integrated and derivate controller computes expected incoming rate at each router and feedback this rate to upstream routers of the multicast network to stabilize their local buffer occupancy. Results: Simulation results on NS-2 exhibit the immense performance of the proposed approach in terms of delay, throughput, bandwidth utilization, and packet loss than other existing methods. Conclusion: The proposed congestion control scheme provides better bandwidth utilization and throughput than other existing approaches. Moreover, we have discussed existing congestion control schemes with their research gaps. In the future, we are planning to explore the fairness and quality of service issue in multicast communication.

scholarly journals ANALYSIS OF USER MOBILITY PERFORMANCE ON SOFTWARE DEFINED WIRELESS NETWORK USING DIJKSTRA ALGORITHM

2021 ◽  
Vol 2 (2) ◽  
pp. 127-133
Author(s):  
Icha Nurlaela Khoerotunisa ◽  
Sofia Naning Hertiana ◽  
Ridha Muldina Negara
Keyword(s):  
Wireless Network ◽  
Packet Loss ◽  
Network Performance ◽  
User Mobility ◽  
Dijkstra Algorithm ◽  
High Complexity ◽  
Quality Of Data ◽  
Data Packets ◽  
Mobility Performance

  Over the last decade, wireless devices have developed rapidly until predictions will develop with high complexity and dynamic. So that new capabilities are needed for wireless problems in this problem. Software Defined Network (SDN) is generally a wire-based network, but to meet the needs of users in terms of its implementation, it has begun to introduce a Wireless-based SDN called Software Defined Wireless Network (SDWN) which provides good service quality and reach and higher tools, so as to be able to provide new capabilities to wireless in a high complexity and very dynamic. When SDN is implemented in a wireless network it will require a routing solution that chooses paths due to network complexity. In this paper, SDWN is tested by being applied to mesh topologies of 4,6 and 8 access points (AP) because this topology is very often used in wireless-based networks. To improve network performance, Dijkstra's algorithm is added with the user mobility scheme used is RandomDirection. The Dijkstra algorithm was chosen because it is very effective compared to other algorithms. The performance measured in this study is Quality of Service (QoS), which is a parameter that indicates the quality of data packets in a network. The measurement results obtained show that the QoS value in this study meets the parameters considered by the ITU-T G1010 with a delay value of 1.3 ms for data services and packet loss below 0.1%. When compared with the ITU-T standard, the delay and packet loss fall into the very good category.

Parallel Data Transfer Protocol

2013 ◽  
pp. 238-255 ◽  
Author(s):  
Yushi Shen ◽  
Yale Li ◽  
Ling Wu ◽  
Shaofeng Liu ◽  
Qian Wen
Keyword(s):  
Optical Networks ◽  
Packet Loss ◽  
Large Scale ◽  
Data Transfer ◽  
Current Data ◽  
Packet Losses ◽  
Multiple Flows ◽  
Data Transfer Protocol ◽  
Display Walls ◽  
Synchronization Mechanisms

Transferring very high quality digital objects over the optical network is critical in many scientific applications, including video streaming/conferencing, remote rendering on tiled display walls, 3D virtual reality, and so on. Current data transfer protocols rely on the User Datagram Protocol (UDP) as well as a variety of compression techniques. However, none of the protocols scale well to the parallel model of transferring large scale graphical data. The existing parallel streaming protocols have limited synchronization mechanisms to synchronize the streams efficiently, and therefore, are prone to slowdowns caused by significant packet loss of just one stream. In this chapter, the authors propose a new parallel streaming protocol that can stream synchronized multiple flows of media content over optical networks through Cross-Stream packet coding, which not only can tolerate random UDP packet losses but can also aim to tolerate unevenly distributed packet loss patterns across multiple streams to achieve a synchronized throughput with reasonable coding overhead. They have simulated the approach, and the results show that the approach can generate steady throughput with fluctuating data streams of different data loss patterns and can transfer data in parallel at a higher speed than multiple independent UDP streams.

Optimizing User Quality of Experience through Overlay Routing, Bandwidth Management and Dynamic Trans-Coding

2012 ◽  
pp. 160-180
Author(s):  
Maarten Wijnants ◽  
Wim Lamotte ◽  
Bart De Vleeschauwer ◽  
Filip De Turck ◽  
Bart Dhoedt ◽  
...  
Keyword(s):  
Packet Loss ◽  
Quality Of Experience ◽  
Multimedia Data ◽  
Effective Bandwidth ◽  
Bandwidth Management ◽  
Multimedia Services ◽  
Overlay Routing ◽  
Last Mile ◽  
Time Critical

Accessing multimedia services via fixed and wireless networks has become common practice. These services are typically much more sensitive to packet loss, delay and/or congestion than traditional services. In particular, multimedia data is often time critical and, as a result, network issues are not well tolerated and significantly deteriorate the user’s Quality of Experience (QoE). Therefore, the authors propose a QoE optimization platform that is able to mitigate problems that might occur at any location in the delivery path from service provider to customer. More specifically, the distributed architecture supports overlay routing to circumvent erratic parts of the network core. In addition, it comprises proxy components that realize last mile optimization through automatic bandwidth management and the application of processing on multimedia flows. This paper introduces a trans-coding service for this proxy component which enables the transformation of H.264/AVC video flows to an arbitrary bitrate. Through representative experimental results, the authors illustrate how this addition enhances the QoE optimization capabilities of the proposed platform by allowing the proxy component to compute more flexible and effective bandwidth distributions.

QoS-Aware Scheme for Mobility Management and Adaptive Resource Reservation in 4G Wireless Networks

2012 ◽  
pp. 65-94
Author(s):  
Sihem Trabelsi ◽  
Noureddine Boudriga
Keyword(s):  
Wireless Networks ◽  
Mobility Management ◽  
Packet Loss ◽  
Resource Reservation ◽  
Bandwidth Utilization ◽  
Handoff Latency ◽  
4G Wireless ◽  
Adaptive Resource

Simulations show that the proposed scheme achieves better results than those of other resource reservation schemes for metrics like bandwidth utilization, handoff latency, and packet loss.

scholarly journals PARD: Hybrid Proactive and Reactive Method Eliminating Flow Setup Latency in SDN

2020 ◽  
Vol 28 (4) ◽  
pp. 1547-1574
Author(s):  
Michal Rzepka ◽  
Piotr Borylo ◽  
Artur Lason ◽  
Andrzej Szymanski
Keyword(s):  
Packet Loss ◽  
Traffic Engineering ◽  
Hardware Design ◽  
Software Defined Networking ◽  
Fine Grained ◽  
Flow Table ◽  
Scientific Papers ◽  
Reactive Method ◽  
Full Maturity

Abstract Advantages of Software Defined Networking are unquestionable and are widely described in numerous scientific papers, business white papers and press articles. However, to achieve full maturity, crucial impediments to this concept and its shortcomings must be overcame. One of the most important issues regards significant setup latency of a new flow. To address this issue we propose PARD: a hybrid proactive and reactive method to manage flow table entries. Additional advantages of the proposed solution are, among the others, its ability to preserve all capabilities of Software Defined Networking, utilization of multiple flow tables, a possibility to employ fine-grained traffic engineering and, finally, compatibility with existing protocol and hardware design. It is shown that the proposed solution is able to significantly reduce latency of first packets of a new flow, which directly impacts packet loss and perceived throughput. Thus, our solution is expected to enable a wide deployment of Software Defined Networking concept without any need for protocol changes or, what is extremely important, hardware modifications.

Node Disjoint Random and Optimal Path Selection (NDROPS) Algorithm for Security in MANETS

2017 ◽  
Vol 7 (3) ◽  
pp. 1197
Author(s):  
P. Suma ◽  
O. Nagaraju ◽  
Md. Ali Hussain
Keyword(s):  
Optimal Path ◽  
Dynamic Routing ◽  
Routing Algorithms ◽  
Path Selection ◽  
Malicious Node ◽  
Link Failures ◽  
Data Packets ◽  
Dynamic Topology ◽  
Adhoc Networks ◽  
Packet Drop

<p class="ABSTRACT">Mobile Adhoc Networks are shortly called MANETs. In these types of networks, fixed infrastructures are absent and are dynamic in nature. Nodes are movable, and they are not connected with any wires. For monitoring or supervising the transmissions in MANETS, no central supervision is present. Moving nodes, dynamic topology, and absence of infrastructure are the features of MANETs. These features are advantageous where wires cannot be used and where nodes are supposed to move. But there is a problem of security. Networks are highly prone to attacks where finding the root of the cause is very hard. Many nodes disjoint routing algorithms are proposed to balance the load, to cope up with link failures, etc. This paper proposes an algorithm called Node Disjoint Random and Optimal Path Selection (NDROPS) algorithm which uses the concept of dynamic routing and node disjoint routing to provide all the above-stated advantages along with security. Routing of data packets is done through few paths which are node disjoint. The main essence of this algorithm is to distribute the data among different routes. So, a malicious node in a path can retrieve only a few packets in random.  The simulation of the proposed NDROPS algorithm is performed and the performance is compared using throughout and packet drop probability.</p>

Sign in / Sign up

Export Citation Format

Share Document