WAN TECHNOLOGIES

A mass of organizations constructed own corporate organizations. WAN interfaces these corporate organizations among workplaces and server farms. The corporate organization comprises of a spine organization, PC organization, Internet association and communication frameworks. Organization traffic examples of these organizations have various qualities (distinctive top/off-top occasions), which have excess transmission capacities continually some place in the corporate organization. The corporate heads who hope to improve the cost proficiency of organizations, particularly diminishing the association charge of correspondence lines, and improving adaptability for the WAN uses. In addition adaptable WAN utilization, for example, utilization of datacenter administrations, guaranteeing BC/DR (business congruity/catastrophe recuperation) and utilization of public cloud administrations are needed to help. This paper examines our answers for advance WANs among workplaces and datacenters that permit our clients to settle the issues

Design, implementation and evaluation of a QoS-aware transport protocol

In the context of a reconfigurable transport protocol framework, we propose a QoS-aware Transport Protocol (QSTP), specifically designed to operate over QoS-enabled networks with bandwidth guarantee. QSTP combines QoS-aware TFRC congestion control mechanism, which takes into account the network-level bandwidth reservations, with a Selective ACKnowledgment (SACK) mechanism in order to provide a QoS-aware transport service that fill the gap between QoS enabled network services and QoS constraint applications. We have developed a prototype of this protocol in the user-space and conducted a large range of measurements to evaluate this proposal under various network conditions. Our results show that QSTP allows applications to reach their negotiated QoS over bandwidth guaranteed networks, such as DiffServ/AF network, where TCP fails. This protocol appears to be the first reliable protocol especially designed for QoS network architectures with bandwidth guarantee

Agile-SD: A Linux-based TCP Congestion Control Algorithm for Supporting High-speed and Short-distance Networks

Recently, high-speed and short-distance networks are widely deployed and their necessity is rapidly increasing everyday. This type of networks is used in several network applications; such as Local Area Networks (LAN) and Data Center Networks (DCN). In LANs and DCNs, high-speed and short-distance networks are commonly deployed to connect between computing and storage elements in order to provide rapid services. Indeed, the overall performance of such networks is significantly influenced by the Congestion Control Algorithm (CCA) which suffers from the problem of bandwidth under-utilization, especially if the applied buffer regime is very small. In this paper, a novel loss-based CCA tailored for high-speed and Short-Distance (SD) networks, namely Agile-SD, has been proposed. The main contribution of the proposed CCA is to implement the mechanism of agility factor. Further, intensive simulation experiments have been carried out to evaluate the performance of Agile-SD compared to Compound and Cubic which are the default CCAs of the most commonly used operating systems. The results of the simulation experiments show that the proposed CCA outperforms the compared CCAs in terms of average throughput, loss ratio and fairness, especially when a small buffer is applied. Moreover, Agile-SD shows lower sensitivity to the buffer size change and packet error rate variation which increases its efficiency.Comment: 12 Page

The Xpress Transfer Protocol (XTP): A tutorial (short version)

The Xpress Transfer Protocol (XTP) is a reliable, light weight transfer layer protocol. Current transport layer protocols such as DoD's Transmission Control Protocol (TCP) and ISO's Transport Protocol (TP) were not designed for the next generation of high speed, interconnected reliable networks such as fiber distributed data interface (FDDI) and the gigabit/second wide area networks. Unlike all previous transport layer protocols, XTP is being designed to be implemented in hardware as a VLSI chip set. By streamlining the protocol, combining the transport and network layers, and utilizing the increased speed and parallelization possible with a VLSI implementation, XTP will be able to provide the end-to-end data transmission rates demanded in the high speed networks without compromising reliability and functionality. This tutorial briefly describes the operation of the XTP protocol and in particular, its error, flow and rate control; inter-networking addressing mechanisms; and multicast support features, as defined in the XTP Protocol Definition Revision 3.4

Congestion Control in Mobile Ad Hoc Network using modified acknowledgement with secure channel

The mobile ad hoc network is self-configuring and dynamic in nature. Due to its dynamic topology node can join or leave any time and each node behaves as router or host which can deliver the packets from source to destination. Due to the heavy traffic load over network congestion occur. To avoid the congestion on network various congestion control mechanism has been developed but in this we use modified-ACK based scheme for node authentication in AODV protocol. The simulation of our proposed work is done on network simulator NS-2.34 and comparative analysis of our proposed methodology is done using performance metrics such as packet delivery ratio, throughput, end-end delay average jitter and routing load.   Keywords MANET, Congestion Control, AODV, ACK, PDR, Network Simulato

Active queue management with discrete sliding modes in TCP networks

In this paper, a new active queue management (AQM) algorithm for data traffic control in TCP/IP networks is developed. The algorithm design is based on the principles of discrete sliding-mode control. Unlike majority of earlier studies, the design procedure considers the effects of both non-negligible delay in transferring data and feedback information and unpredictable capacity variations. The switching function is selected to incorporate a delay compensation mechanism, which ensures efficient network operation even for large bandwidthdelay product connections. The proposed algorithm, implemented as a packet marking scheme, is tested in discrete event ns-2 simulator. The results show that the algorithm provides fast convergence to steady state after sudden, unanticipated capacity changes. By generating smaller overshoots, the proposed algorithm also allows for reducing buffer space requirements to avoid packet loss as compared to the benchmark AQM solutions