Performance evaluation in terms of congestion and flow control of interconnected token ring local area networks

In an interconnected network, if user demands are allowed to exceed the system capacity, unpleasant congestion effects occur which rapidly neutralize the delay and efficiency advantages. Congestion can be eliminated by using an appropriate set of traffic monitoring and control procedures called flow control procedures. This thesis first investigates the major technical concepts underlying the token-ring technology; performance and flow control issues and then gives an approximate analytical solution in terms of mean end-toned delay in a system of token-ring local area network interconnected through bridges. The analytical solution is based on an approximation of the mean end-to-end delay in a stand alone LAN and then extended by approximating the arrival rates at the bridges as a function of the throughput of each sub network. Besides throughput and delay, a more compact form of performance measure called power has also been in the study

An IPsec Compatible Implementation of DBRA and IP-ABR

Satellites are some of the most difficult links to exploit in a Quality of Service (QoS) sensitive network, largely due to their high latency, variable-bandwidth and low-bandwidth nature. Central management of shared links has been shown to provide efficiency gains and enhanced QoS by effectively allocating resources according to reservations and dynamic resource availability. In a modern network, segregated by secure gateways and tunnels such as provided by IPsec, central management appears impossible to implement due to the barriers created between a global Dynamic Bandwidth Resource Allocation (DBRA) system and the mediators controlling the individual flows. This thesis explores and evaluates various through-IPsec communications techniques aimed at providing a satellite-to-network control channel, while maintaining data security for all communications involved

Best effort measurement based congestion control

Abstract available: p.

Practical Bloom filter based epidemic forwarding and congestion control in DTNs: A comparative analysis

International audienceEpidemic forwarding has been proposed as a forwarding technique to achieve opportunistic communication in delay tolerant networks (DTNs). Even if this technique is well known and widely referred, one has to address several practical problems before using it. Unfortunately, while the literature on DTNs is full of new techniques, very little has been done in comparing them. In particular, while Bloom filters have been proposed to exchange information about the buffer content prior to sending information in order to avoid redundant retransmissions, up to our knowledge no real evaluation has been provided to study the tradeoffs that exist for using Bloom filters in practice. A second practical issue in DTNs is buffer management (resulting from finite buffers) and congestion control (resulting from greedy sources). This has also been the topic of several papers that had already uncovered the difficulty to acquire accurate information mandatory to regulate the data transmission rates and buffer space. In this paper, we fill this gap. We have been implementing a simulation of different proposed congestion control schemes for epidemic forwarding in ns-3 environment. We use this simulation to compare different proposed schemes and to uncover issues that remain in each one of them. Based on this analysis, we proposed some strategies for Bloom filter management based on windowing and describe implementation tradeoffs. Afterwards, we propose a back-pressure rate control as a well as an aging based buffer managing solution to deal with congestion control. By simulating our proposed mechanisms in ns-3 both with random-waypoint mobility and realistic mobility traces coming from San-Francisco taxicabs, we show that the proposed mechanisms alleviate the challenges of using epidemic forwarding in DTN

Congestion control protocols in wireless sensor networks: A survey

The performance of wireless sensor networks (WSN) is affected by the lossy communication medium, application diversity, dense deployment, limited processing power and storage capacity, frequent topology change. All these limitations provide significant and unique design challenges to data transport control in wireless sensor networks. An effective transport protocol should consider reliable message delivery, energy-efficiency, quality of service and congestion control. The latter is vital for achieving a high throughput and a long network lifetime. Despite the huge number of protocols proposed in the literature, congestion control in WSN remains challenging. A review and taxonomy of the state-of-the-art protocols from the literature up to 2013 is provided in this paper. First, depending on the control policy, the protocols are divided into resource control vs. traffic control. Traffic control protocols are either reactive or preventive (avoiding). Reactive solutions are classified following the reaction scale, while preventive solutions are split up into buffer limitation vs. interference control. Resource control protocols are classified according to the type of resource to be tuned. © 2014 IEEE

Quality of Service in Vehicular Ad Hoc Networks: Methodical Evaluation and Enhancements for ITS-G5

After many formative years, the ad hoc wireless communication between vehicles has become a vehicular technology available in mass production cars in 2020. Vehicles form spontaneous Vehicular Ad Hoc Networks (VANETs), which enable communication whenever vehicles are nearby without need for supportive infrastructure. In Europe, this communication is standardised comprehensively as Intelligent Transport Systems in the 5.9 GHz band (ITS-G5). This thesis centres around Quality of Service (QoS) in these VANETs based on ITS-G5 technology. Whilst only a few vehicles communicate, radio resources are plenty, and channel congestion is a minor issue. With progressing deployment, congestion control becomes crucial to preserve QoS by preventing high latencies or foiled information dissemination. The developed VANET simulation model, featuring an elaborated ITS-G5 protocol stack, allows investigation of QoS methodically. It also considers the characteristics of ITS-G5 radios such as the signal attenuation in vehicular environments and the capture effect by receivers. Backed by this simulation model, several enhancements for ITS-G5 are proposed to control congestion reliably and thus ensure QoS for its applications. Modifications at the GeoNetworking (GN) protocol prevent massive packet occurrences in a short time and hence congestion. Glow Forwarding is introduced as GN extension to distribute delay-tolerant information. The revised Decentralized Congestion Control (DCC) cross-layer supports low-latency transmission of event-triggered, periodic and relayed packets. DCC triggers periodic services and manages a shared duty cycle budget dedicated to packet forwarding for this purpose. Evaluation in large-scale networks reveals that this enhanced ITS-G5 system can reliably reduce the information age of periodically sent messages. The forwarding budget virtually eliminates the starvation of multi-hop packets and still avoids congestion caused by excessive forwarding. The presented enhancements thus pave the way to scale up VANETs for wide-spread deployment and future applications

Performance analysis of an ATM network with multimedia traffic: a simulation study

Traffic and congestion control are important in enabling ATM networks to maintain the Quality of Service (QoS) required by end users. A Call Admission Control (CAC) strategy ensures that the network has sufficient resources available at the start of each call, but this does not prevent a traffic source from violating the negotiated contract. A policing strategy (User Parameter Control (UPC)) is also required to enforce the negotiated rates for a particular connection and to protect conforming users from network overload. The aim of this work is to investigate traffic policing and bandwidth management at the User to Network Interface (UNI). A policing function is proposed which is based on the leaky bucket (LB) which offers improved performance for both real time (RT) traffic such as speech and video and non-real time (non-RT) traffic, mainly data by taking into account the QoS requirements. A video cell in violation of the negotiated bit rate causes the remainder of the slice to be discarded. This 'tail clipping' provides protection for the decoder from damaged video slices. Speech cells are coded using a frequency domain coder, which places the most significant bits of a double speech sample into a high priority cell and the least significant bits into a high priority cell. In the case of congestion, the low priority cell can be discarded with little impact on the intelligibility of the received speech. However, data cells require loss-free delivery and are buffered rather than being discarded or tagged for subsequent deletion. This triple strategy is termed the super leaky bucket (SLB). Separate queues for RT and non-RT traffic, are also proposed at the multiplexer, with non pre-emptive priority service for RT traffic if the queue exceeds a predetermined threshold. If the RT queue continues to grow beyond a second threshold, then all low priority cells (mainly speech) are discarded. This scheme protects non-RT traffic from being tagged and subsequently discarded, by queueing the cells and also by throttling back non-RT sources during periods of congestion. It also prevents the RT cells from being delayed excessively in the multiplexer queue. A simulation model has been designed and implemented to test the proposal. Realistic sources have been incorporated into the model to simulate the types of traffic which could be expected on an ATM network. The results show that the S-LB outperforms the standard LB for video cells. The number of cells discarded and the resulting number of damaged video slices are significantly reduced. Dual queues with cyclic service at the multiplexer also reduce the delays experienced by RT cells. The QoS for all categories of traffic is preserved

The Scalability of Multicast Communication

Multicast is a communication method which operates on groups of applications. Having multiple instances of an application which are addressed collectively using a unique, multicast address, allows elegant solutions to some of the more intractable problems in distributed programming, such as providing fault tolerance. However, as multicast techniques are applied in areas such as distributed operating systems, where the operating system may span a large number of hosts, or on faster network architectures, where the problems of congestion reduce the effectiveness of the technique, then the scalability of multicast must be addressed if multicast is to gain a wider application. The main scalability issue was considered to be packet loss due to buffer overrun, the most common cause of this buffer overrun being the mismatch in packet arrival rate and packet consumption at the multicast originator, the so-called implosion problem. This issue affects positively acknowledged and transactional protocols. As these two techniques are the most common protocol designs, it was felt that an investigation into the problems of these types of protocol would be most effective. A model for implosion was developed which was simulated in order to investigate the parameters of implosion. A measure of this implosion was derived from the data, this index of implosion allowing the severity of implosion to be described as well as the location of the implosion in the model. This implosion index was derived by dividing the rate at which buffers were occupied by the rate at which packets were generated by the model. The value may then be used to predict the number of buffers required given the number of packets expected. A number of techniques were developed which may be used to offset implosion, either by artificially increasing the inter-packet gap, or by distributing replies so that no one host receives enough packets to cause an implosion. Of these alternatives, the latter offers the most promise, although requiring a large effort to maintain the resulting hierarchical structure in the presence of multiple failures