Modified least loaded routing in virtual path based ATM networks

We consider a Virtual Path (VP) based ATM network supporting multiple traffic classes with heterogeneous traffic characteristics. Using simple FIFO scheduling policy at the ATM multiplexer, we assume that all traffic require identical end‐to‐end quality of service (QoS) requirement. The concept of effective bandwidth is used to determine the required bandwidth to guarantee the specified QoS requirement. We study the problem of using dynamic routing to VP‐based ATM networks by transforming it into an equivalent multi‐rate circuit‐switched network problem. To further simplify the analysis, we restrict the choice of path to single‐link and two‐link routes. We propose a dynamic routing algorithm based on the Least Loaded Routing (LLR) with packing. Simulation results are used to compare the performance of this algorithm with other dynamic routing schemes. This revised version was published online in June 2006 with corrections to the Cover Date.     

A call admission and control scheme for quality‐of‐service (QoS) provisioning in next generation wireless networks

We propose a framework for quality‐of‐service (QoS) provisioning for multimedia services in next generation wireless access networks. This framework aims at providing a differentiated treatment to multimedia traffic flows at the link layer, which can be broadly classified as real‐time (or delay‐sensitive) and non‐real‐time (or delay‐tolerant). Various novel schemes are proposed to support the differential treatment and guarantee QoS. These schemes include bandwidth compaction, channel reservation and degradation, with the help of which a call admission and control algorithm is developed. The performance of the proposed framework is captured through analytical modeling and simulation experiments. Analytically, the average carried traffic and the worst case buffer requirements for real‐time and non‐real‐time calls are estimated. Simulation results show up to 21% improvement in the admission probability of real‐time calls and up to 17% improvement in the admission probability of non‐real‐time calls, when various call control techniques like bandwidth compaction are employed. Using our channel reservation technique, we observe a 12% improvement in the call admission probability compared to another scheme proposed in the literature. This revised version was published online in August 2006 with corrections to the Cover Date.     

Fluid analysis of a TCP connection over ABR

This paper reports on an analytical study of the performances of the ATM‐ABR service category in transporting TCP/IP flows over an ATM network. We explore the behavior of a TCP connection over an ATM‐ABR VC, in presence of exogenous non‐controlled traffic. This fluid analysis of the system allows the study of the interaction between the window‐based end‐to‐end flow control TCP protocol and the rate‐based flow control ABR mechanism, which is restricted to the ATM part of the network. The main aim of this study is to give performance evaluation formulae to model the behavior of such a TCP over ABR connection. This revised version was published online in June 2006 with corrections to the Cover Date.     

Architecture and experimental results for quality of service in mobile networks using RSVP and CBQ

Efforts are underway to enhance the Internet with Quality of Service (QoS) capabilities for transporting real‐time data. The issue of wireless networks and mobile hosts being able to support applications that require QoS has become very significant. The ReSerVation Protocol (RSVP) provides a signaling mechanism for end‐to‐end QoS negotiation. RSVP has been designed to work with wired networks. To make RSVP suitable for wireless networks, changes need to be made by: (i) changing the way control messages are sent, and (ii) introducing wireless/mobile specific QoS parameters that take into account the major features of wireless networks, namely, high losses, low bandwidth, power constraints and mobility. In this paper, an architecture with a modified RSVP protocol that helps to provide QoS support for mobile hosts is presented. The modified RSVP protocol has been implemented in an experimental wireless and mobile testbed to study the feasibility and performance of our approach. Class Based Queueing (CBQ) which is used as the underlying bandwidth enforcing mechanism is also modified to fit our approach. The experimental results show that the modified RSVP and CBQ help in satisfying resource requests for mobile hosts, after handoff occurs. The experiments also show how different power and loss profile mechanisms can be used with our framework. The system performance using the modified RSVP control mechanism is also studied. This revised version was published online in July 2006 with corrections to the Cover Date.     

Dynamic bandwidth allocation scheme for multiple real‐time VBR videos over ATM networks

This paper considers VBR transmission of multiple real‐time videos over ATM networks. Multiple real‐time VBR video sources are multiplexed into an ATM switch to transmit cells into the network. Given the ATM switch capacity, the problem is to dynamically allocate the required channel bandwidth for each video source such that the encoder buffer occupancy is maintained at a target level. To solve the problem, we present a mathematical formulation and propose an algorithm for the bandwidth allocation. To allocate a suitable bandwidth at a given control period, QoS demand levels and traffic characteristics of the video sources are considered. The performance of the proposed scheme is examined in terms of the number of encoder rate controls required and the gap between the target and the current buffer occupancy at each control period. Numerical results are analyzed for different QoS environments as well as different levels of target buffer, ATM switch capacity, buffer size and leaky bucket token rate. This revised version was published online in June 2006 with corrections to the Cover Date.     

A measurement‐based performance evaluation method for IP networks and its implementation

In recent years, IP networks have become increasingly complex and the range of network applications has widened. As a result, the need for experimental evaluation of application performance has increased. We introduce a measurement‐based performance evaluation method that combines a function to generate various patterns of application traffic with one to measure end‐to‐end network performance at the application level. For our method, we also propose traffic models of various applications that can represent the characteristics of these applications, for example, the burstiness of traffic. This method has already been implemented as a benchmarking tool on UNIX operating systems. This revised version was published online in June 2006 with corrections to the Cover Date.     

Network architecture and traffic transport for integrated wireless communications over enterprise networks

A novel network architecture based on the IEEE 802.6 metropolitan area networks (MAN) is proposed to integrate the wireless and wired segments of a regional enterprise network (REN) within a city. This architecture functions like a distributed switch for all types of services, reducing traffic congestion by sharing the high capacity link dynamically and facilitating signaling, mobility management, call processing and network management through its distributed functions, transport facilities and broadcasting capability. It also serves as a peripheral gathering network of REN traffic for transport over a wide area ATM/BISDN, enabling integration of an enterprise's regional networks into a global EN. Two major wireless applications, i.e., wireless PABX (WPABX) and wireless LAN (WLAN) are discussed to illustrate the advantages of this MAN‐based architecture. Although a REN is likely to support a wide range of different services, voice and data will continue to be the predominant traffic generated by WPABXs and WLANs, respectively, and are also representative of isochronous and asynchronous multimedia traffic carried by future wireless networks. We compare the traffic capacity of several voice transport alternatives under integrated (voice/data) network traffic with various data traffic loads, and study voice and data integration under three different integration schemes by simulations. Results indicate that the MAN‐based architecture is most effective employing queue arbitrated (QA) access for asynchronous traffic, pre‐arbitrated access for constant bit‐rate isochronous traffic, and the new reservation arbitrated (RA) access for variable bit‐rate isochronous traffic, under a scheme that permits full sharing between QA and RA traffic. This revised version was published online in July 2006 with corrections to the Cover Date.     

Simulation of deep space network traffic under various loading conditions

This is a follow‐up report on the end‐to‐end data link performance of the NASA deep space network. The focus of this report is the effect of traffic loading on data delivery. Architecture of the existing network is modeled via COMNET. The contribution of the data latency to the overall acquisition time is simulated as a function of network traffic conditions. The results show steady‐state latencies in the range of tenths of milli‐seconds under a mild loading condition. During heavy traffic, a delay rate of over a hundred seconds of increased delay per hour of network operation time is observed. This is primarily due to the queueing delays associated with large volume of data stored in the buffers throughout the link. This revised version was published online in June 2006 with corrections to the Cover Date.     

Design and analysis of an algorithm for fair service in error‐prone wireless channels

In order to support diverse communication‐intensive real‐time and non‐real‐time data flows over a scarce, varying and shared wireless channel with location‐dependent and bursty errors, we define a service model that has the following characteristics: short‐term fairness among flows which perceive a clean channel, long‐term fairness for flows with bounded channel error, worst‐case delay bounds for packets, short‐term throughput bounds for flows with clean channels and long‐term throughput bounds for all flows with bounded channel error, expanded schedulable region, and support for both delay sensitive and error sensitive data flows. We present the wireless fair service algorithm, and show through both analysis and simulation that it achieves the requirements of the service model in typical wireless network environments. The key aspects of the algorithm are the following: (a) an enhanced fair queueing based service scheme that supports decoupling of delay and bandwidth, (b) graceful service compensation for lagging flows and graceful service degradation for leading flows, (c) support for real‐time delay sensitive flows as well as non‐real‐time error sensitive flows, and (d) an implementation within the framework of the simple and robust CSMA/CA wireless medium access protocol. This revised version was published online in July 2006 with corrections to the Cover Date.     

Design and analysis of low‐power access protocols for wireless and mobile ATM networks

This paper describes the design and analysis of a low‐power medium access control (MAC) protocol for wireless/mobile ATM networks. The protocol – denoted EC‐MAC (energy conserving medium access control) – is designed to support different traffic types with quality‐of‐service (QoS) provisions. The network is based on the infrastructure model where a base station (BS) serves all the mobiles currently in its cell. A reservation‐based approach is proposed, with appropriate scheduling of the requests from the mobiles. This strategy is utilized to accomplish the dual goals of reduced energy consumption and quality of service provision over wireless links. A priority round robin with dynamic reservation update and error compensation scheduling algorithm is used to schedule the transmission requests of the mobiles. Discrete‐event simulation has been used to study the performance of the protocol. A comparison of energy consumption of the EC‐MAC to a number of other protocols is provided. This comparison indicates the EC‐MAC has, in general, better energy consumption characteristics. Performance analysis of the proposed protocol with respect to different quality‐of‐service parameters using video, audio and data traffic models is provided. This revised version was published online in August 2006 with corrections to the Cover Date.     

A new ATM adaptation layer for TCP/IP over wireless ATM networks

This paper describes the design and performance of a new ATM adaptation layer protocol (AAL‐T) for improving TCP performance over wireless ATM networks. The wireless links are characterized by higher error rates and burstier error patterns in comparison with the fiber links for which ATM was introduced in the beginning. Since the low performance of TCP over wireless ATM networks is mainly due to the fact that TCP always responds to all packet losses by congestion control, the key idea in the design is to push the error control portion of TCP to the AAL layer so that TCP is only responsible for congestion control. The AAL‐T is based on a novel and reliable ARQ mechanism to support quality‐critical TCP traffic over wireless ATM networks. The proposed AAL protocol has been validated using the OPNET tool with the simulated wireless ATM network. The simulation results show that the AAL‐T provides higher throughput for TCP over wireless ATM networks compared to the existing approach of TCP with AAL 5. This revised version was published online in July 2006 with corrections to the Cover Date.     

Design and evaluation of multicast GFR for supporting TCP/IP over hybrid wired/wireless ATM

The major challenges of designing multicast traffic control protocols for a combined wired/wireless network are the varying transmission characteristics (bandwidth, error, and propagation delay) of the wireless and wired media, and the different, possibly conflicting frame rate requests from multiple sources. To address these issues, in this paper we design and evaluate new unicast and multicast guaranteed frame rate (GFR) schemes for supporting TCP/IP traffic over a combined wired/wireless ATM network. We first propose a new, flexible weighted buffer management, and a frame‐based virtual spacing (VS) mechanism implementing weighted fair queueing. The unicast GFR scheme is based on the integration of the new weighted buffer management, and either cell‐based or frame‐based VS. It is then extended to support multicast GFR flows. The multicast scheme presented in this paper is the first multicast GFR scheme appeared in the literature. These schemes are carefully evaluated over several network configuration, supporting heterogeneous TCP/IP traffic with various frame rates. Simulation results show that the new schemes guarantee the minimum rates requested, provide excellent fairness, and achieve reasonably high efficiency. The new schemes may be extended to provide differentiated service in both IP and mobile IP frame work. This revised version was published online in July 2006 with corrections to the Cover Date.     

ATM traffic management in an LMDS wireless access network

We investigate the capacity of LMDS to support ATM services in the local loop. In particular, we evaluate the performance of a MAC protocol for this system when transporting voice and IP traffic using the VBR and GFR service categories of ATM, respectively. Our results show that the MAC protocol is well suited for voice traffic but in general lacks efficient bandwidth management mechanisms to support the more dynamic bandwidth requirements of IP traffic     

Design of a fair bandwidth allocation policy for VBR traffic in ATMnetworks

Since real-time variable bit rate (VBR) traffic is inherently bursty, dynamic bandwidth allocation is necessary for ATM streams that carry VBR traffic. In order to provide quality-of-services (QoS) guarantees and to reduce the computational complexity, an hybrid of guaranteed and dynamic adaptive allocation scheme requires to be implemented. Typical dynamic allocations to competing streams are done in the form of linear proportions to the bandwidth requirements. We show that during temporary link congestion such proportional arrangements can give rise to unequal queue growth and, subsequently, degraded QoS. This is found to be true even for streams that belong to the same VBR class and share identical long term traffic characteristics and QoS requirements. In this paper, four allocation algorithms are presented and analyzed in terms of their fairness and QoS potential for real-time VBR traffic. We propose and show that a novel allocation strategy, termed Minmax, solves the mentioned problem of unfairness within a class. By maintaining a fair distribution of buffer length across the streams of a class, the proposed policy can achieve better and fairer QoS performance compared to the traditional methods. We present analytical results, proofs and a simulation study of the described algorithms. Four allocation policies for handling MPEG VBR video streams are simulated in the context of a wireless ATM (WATM) medium access control. The results show that in certain scenarios, the Minmax strategy can reduce losses by an order of magnitude, while decreasing delays substantially     

A novel scheme for mobility management in heterogeneous wireless networks

In this paper, we present a mobility management scheme for real-time multimedia sessions over heterogeneous wireless networks. Most approaches in the current literature use Mobile IP (MIP) or Session Initiation Protocol (SIP) to maintain real-time sessions during mobility. In this paper, we analyze MIP and SIP in terms of the mobility rate, packet loss and packet overheads in the user plane and propose a mechanism by which the network can choose the optimum protocol for mobility management. We perform the analysis for constant bit rate (CBR) as well as for variable bit rate (VBR) traffic. We show that for CBR traffic, the proposed mechanism leads to 12–35% improvement in the system capacity, while for VBR traffic, capacity improvements ranging from about 35–50% can be obtained. Our proposed approach and the analysis are applicable to handovers between different IP domains both in homogeneous as well as in heterogeneous wireless networks.     

A signaling architecture for wireless ATM access networks

A multiservice wireless Asynchronous Transfer Mode (ATM) access system is considered from a signaling protocol viewpoint. In an attempt to generalize and extend results and experiences obtained from the specification, design, and implementation of fixed ATM‐based access networks, we extend the concept of the broadband V interface (referred to as VB) for application to wireless ATM access networks. The proposed architecture follows the signaling structure of Broadband ISDN (B‐ISDN) User–Network Interface (UNI), thus offering the possibility for integration of the wireless ATM access system into fixed B‐ISDN. It is shown that the use of the proposed access signaling architecture provides cost effective implementations without degrading the agreed Quality of Service (QoS), and simplifies call/connection and handover control. The evaluation of the proposed access signaling protocol structure yields results that fall within acceptable ATM signaling performance measures. A performance comparison of our approach with an alternative access signaling configuration is also carried out to quantify the relative gains. This revised version was published online in August 2006 with corrections to the Cover Date.     

Low‐loss TCP/IP header compression for wireless networks

Wireless is becoming a popular way to connect mobile computers to the Internet and other networks. The bandwidth of wireless links will probably always be limited due to properties of the physical medium and regulatory limits on the use of frequencies for radio communication. Therefore, it is necessary for network protocols to utilize the available bandwidth efficiently. Headers of IP packets are growing and the bandwidth required for transmitting headers is increasing. With the coming of IPv6 the address size increases from 4 to 16 bytes and the basic IP header increases from 20 to 40 bytes. Moreover, most mobility schemes tunnel packets addressed to mobile hosts by adding an extra IP header or extra routing information, typically increasing the size of TCP/IPv4 headers to 60 bytes and TCP/IPv6 headers to 100 bytes. In this paper, we provide new header compression schemes for UDP/IP and TCP/IP protocols. We show how to reduce the size of UDP/IP headers by an order of magnitude, down to four to five bytes. Our method works over simplex links, lossy links, multi‐access links, and supports multicast communication. We also show how to generalize the most commonly used method for header compression for TCP/IPv4, developed by Jacobson, to IPv6 and multiple IP headers. The resulting scheme unfortunately reduces TCP throughput over lossy links due to unfavorable interaction with TCP's congestion control mechanisms. However, by adding two simple mechanisms the potential gain from header compression can be realized over lossy wireless networks as well as point‐to‐point modem links. This revised version was published online in June 2006 with corrections to the Cover Date.     

Mobile multicasting in wireless ATM networks

Multicasting is a desired function in both wired and wireless networks. Currently, multicasting‐based applications have pervasive presence and influence in our Internet. Wireless ATM aims to support different traffic types over a high speed wireless network. In particular, traditional approaches towards multicasting in wired networks cannot be directly applied to mobile ATM networks. This includes the mechanism proposed to handle mobility in wired networks. In this paper, we address the issues behind multicasting in wireless ATM networks and the underlying mechanisms to support handoffs of both unicast and multicast connections. Through simulation, we evaluated the performance of optimal core‐based tree (CBT), late‐joined CBT, optimal source‐based tree (SBT), and late‐joined SBT during changing multicast host membership conditions. In addition, we evaluated the impact of multicast receivers' migration on the total link cost of the resultant multicast tree. Simulation results revealed that source‐based trees incur more total link costs under both dynamic host membership and receivers' migration scenarios. However, it generates less control messages than the distributed CBT and SBT approaches. This revised version was published online in June 2006 with corrections to the Cover Date.     

Scheduling of real‐time traffic in IEEE 802.11 wireless LANs

The desire to provide universal connectivity for mobile computers and communication devices is fueling a growing interest in wireless packet networks. To satisfy the needs of wireless data networking, study group 802.11 was formed under IEEE project 802 to recommend an international standard for Wireless Local Area Networks (WLANs). A key part of the standard are the Medium Access Control (MAC) protocols. Given the growing popularity of real‐time services and multimedia based applications it is critical that the 802.11 MAC protocols be tailored to meet their requirements. The 802.11 MAC layer protocol provides asynchronous, time‐bounded, and contention free access control on a variety of physical layers. In this paper we examine the ability of the point coordination function to support time bounded services. We present our proposal to support real‐time services within the framework of the point coordination function and discuss the specifics of the connection establishment procedure. We conduct performance evaluation and present numerical results to help understand the issues involved. This revised version was published online in July 2006 with corrections to the Cover Date.     

An architecture of scalable ATM switching system and its performance

In this paper, we present the basic idea and some concepts for the architecture of the ATM switching system being developed in ETRI of KOREA, and also describe its performance. RSE (Reference Service Entity) concept is introduced to define the characteristics of user’s traffic. This concept is useful to represent the demand of CPE (Customer Premise Equipment) user sets and one of point‐to‐multipoint connections. We also propose RUCA (Reference Units for Connection Attempts) concept with which we can illustrate the call/connection level performance of the ATM switching system. This concept can be applied for measuring the call processing capability in both point‐to‐multipoint connections and multipoint‐to‐multipoint connections when call set‐up between users is performed by a sequence of point‐to‐point connections basis. From the basic concepts and the recommendations of ITU‐T, the design objective of the system performance is specified. We represent the methodologies for dimensioning the system to achieve the design objectives, and estimate the system performances. Then we show that our developing system has suitable performance to accommodate the future B‐ISDN. This revised version was published online in August 2006 with corrections to the Cover Date.