Survey of traffic control schemes and error control schemes for ATM networks

Among the techniques proposed for B-ISDN transfer mode, ATM concept is considered to be the most promising transfer technique because of its flexibility and efficiency. This paper surveys and reviews a number of topics related to ATM networks. Those topics cover congestion control, provision of multiple classes of traffic, and error control. Due to the nature of ATM networks, those issues are far more challenging than in conventional networks. Sorne of the more promising solutions to those issues are surveyed, and the corresponding results on performance are summarized. Future research problems in ATM protocol aspect are also presented

Survey of congestion control techniques for an ATM network

The emerging broadband integrated services digital network is expected to adopt ATM (Asynchronous Transfer Mode) as the transport network. This new network must support several classes of service with varying delay and loss requirements. It must also operate with link speeds in the hundreds of megabits per second and be scalable up to potential link speeds on the order of gigabits per second. The requirements to support multiple services and high speed make the congestion control in an ATM network difficult. This paper reviews sorne of the techniques for prevention and control of congestion in an ATM network

Integration Protocols for Voice and Data Traffic

Increasing demands for multimedia services offer integration of multimedia traffic as a hot issue in the future research areas. As a result, in the literature, many multiplexing schemes have been proposed. However, most of them have been implemented with a high complexity, others may be non-effective to satisfy the multiplexing performance criteria, while the rest are still not subjected to a wide range of analysis. Therefore, there is a critical need for comparing some of the recommended multiplexing schemes as well as developing a simple and effective integration protocol while still achieving reasonable bandwidth utilization. This thesis is intended to examine integration protocols for multimedia traffic, with primary focusing on voice-data integration. Firstly, a survey of the existing multiplexing schemes and related issues are presented. Next, an Adaptive Round Robin (ARR) protocol is proposed, as an alternative for voice-data integration, and extensively simulated. Finally, further comparisons, based on computer simulations, are carried out for various multiplexing schemes including Strictly Priority Servicing (SPS), Fixed Round Robin (FRR), Dynamic Bandwidth Allocation/(T1, T2) and Queue Length Threshold (QLT).As a contribution of the thesis, the proposed protocol tries to avoid the drawbacks of the previous multiplexing schemes besides satisfying the multiplexing performance criteria. The protocol differs from the others in that, it gives a limited priority for voice over data, it organizes the incoming packets to the single First-in First-out (FIFO) output buffer rather than the only outgoing scheduling, i.e., all data sources are polled in order according to the adaptation policy; however, before a data source can send a packet, all active voice sources are polled in order. Thus it provides an improvement in voice delay performance without significant effect on data delay performance over previous protocols. In addition, simulation comparisons between various multiplexing schemes have been discussed. In these simulations voice packets are assumed to be generated from on-off sources (talkspurt-silence calls), which is closer to reality and which is not considered in most of the performance analyses of previous schemes

Dynamic bandwidth allocation in ATM networks

Includes bibliographical references.This thesis investigates bandwidth allocation methodologies to transport new emerging bursty traffic types in ATM networks. However, existing ATM traffic management solutions are not readily able to handle the inevitable problem of congestion as result of the bursty traffic from the new emerging services. This research basically addresses bandwidth allocation issues for bursty traffic by proposing and exploring the concept of dynamic bandwidth allocation and comparing it to the traditional static bandwidth allocation schemes

Dynamic Bandwidth Allocation in ATM Networks

Today's new applications such as World Wide Web, video conferencing and multimedia have introduced a large amount of traffic into the network. Additionally new applications are also heading towards real time process. Instant access to the network, greater level of performances and higher degree of satisfaction has become the main concerns of users using these new applications. Although current transmission mediums have advanced in capacity through means such as optical fiber and Gigabit Ethernet, future and unknown new services tend to consume up the available bandwidth. ATM network is the new technology used to support a wide variety of services including data, voice, video and most possibly other future applications. Its flexibility, efficiency and high throughput have gained popularity but with greater complexity due to different approaches in handling different type of services.A high-speed network such as ATM networks must have an effective traffic management scheme in order to gain high data throughput with the least cost of operation. Thus, simulation and modeling are the effective methods used to design the trade-off between network parameters and their performances. Effective sharing of network resources such as bandwidth and buffer are studied through the dynamic allocation method. Static allocation scheme has been proven inefficient to provide high resources utilization as can be seen in STM networks compared to A TM networks. However, ATM networks should provide different dynamic allocation methods according to its different services and traffic characteristics. Four dynamic allocation strategies have been designed, evaluated and compared for their performances. They are called Static Bandwidth Allocation, Bandwidth Allocated Proportional to Expected Queue Length, Bandwidth Allocated Proportional to Expected Queue Length with Threshold Value and Bandwidth Allocated with Threshold Interrupt. Bandwidth Allocated with Threshold Interrupt is proven to be the most effective strategy as it could response to congestion immediately