基于ATM的无源光网络媒质接入控制协议的设计

针对基于ＡＴＭ的无源光网络（ＡＴＭ－ＰＯＮ）设计了一种媒质接入控制（ＭＡＣ）协议。该协议的设计遵照ＩＴＵ－Ｔ有关ＡＴＭ－ＰＯＮ的建议Ｇ．９８３．１（１９９８年１０月）中所定义的帧结构。该协议能够支持ＣＢＲ／ＶＢＲ、ＡＢＲ和ＵＢＲ等多种业务,并能够保证用户公平地接入和充分地利用网络的资源。其中ＣＢＲ／ＶＢＲ业务的优先级最高,同时也确保ＡＢＲ业务至少能以最小信元通信。系统的剩余带宽资源被分配给ＵＢＲ业     

Link Capacity Sharing between Guaranteed- and Best Effort Services on an ATM Transmission Link under GoS Constraints

While link allocation policies in multi-rate circuit switched loss models have drawn much attention in recent years, it is still an open question how to share the link capacity between service classes in a fair manner. In particular, when an ATM link is offered calls from service classes with/without strict QoS guarantees one is interested in link capacity sharing policies that maximize throughput and keep the per-class blocking probabilities under some GoS constraints. In this paper we propose a model and associated computational technique for an ATM transmission link to which CBR/VBR and ABR classes offer calls. We also propose a simple link allocation rule which takes into account blocking probability constraints for the CBR/VBR calls and a throughput constraint for the ABR calls and attempts to minimize the blocking probability of ABR calls. Numerical examples demonstrate the effectiveness of the policy and of the applied computational technique.     

Modelling and analysis of routing and resource allocation techniques in multi‐service networks

In this paper a novel call level model based on the extension of the classical Erlang multi‐rate model for broadband integrated services networks is proposed. We use the model to study routing strategies in multi‐service networks where service classes with/without QoS guarantees coexist. Examples for such networks include ATM and IP‐based integrated networks. In ATM, the CBR and VBR service classes provide QoS guarantees, while the ABR and UBR service classes are of the best effort type. In IP, traditional TCP/IP traffic is of the best effort type, while new protocols like the RSVP or the differentiated services with central resource handling attempt to support QoS parameters. The coexistence of guaranteed and best effort traffic gives rise to new challenging problems since for a given elastic (best effort) connection the bottleneck link determines the available bandwidth and thereby puts constraints on the bandwidth at the other links along the connection's path. Since the available bandwidth fluctuates in time following the load on the links, routing and link allocation in this environment together with blocking probability calculations and fairness issues need to be studied. By means of our proposed model we are able to conduct a survey of various routing and link allocation techniques as well as to develop a modified shortest path routing algorithm which, according to the numerical examples, performs well in this environment. Copyright © 1999 John Wiley & Sons, Ltd.     

A dynamic call admission scheme for VBR traffic in ATM networks

The role of call admission control (CAC) in high-speed networks is to maintain the network utilization at a high level, while ensuring that the quality of service (QoS) requirements of the individual calls are met. We use the term static CAC to describe schemes that always allocate the same bandwidth to a specific group of multiplexed calls, independent of the other traffic sharing the link. Dynamic CAC, on the other hand, denotes a scheme in which the bandwidth allocation to a group of calls sharing a queue is influenced by the traffic in other queues destined for the same outgoing link. We propose a generic dynamic call admission scheme for VBR and ABR traffic whose aim is to reduce the blocking rate for VBR calls at the expense of a higher blocking rate for ABR calls. Our scheme is generic because it builds up on a pre-existing static scheme, e.g., one based on a simple notion of effective bandwidth. Our simple approach results in a significant reduction of the blocking rate for VBR traffic (several orders of magnitude), if the bandwidth requirements of a single call are a reasonably small fraction of the link capacity. At the same time, the deterioration of service for ABR traffic can be contained. This revised version was published online in August 2006 with corrections to the Cover Date.     

ATM通信量管理技术及其在视频点播中的应用

ATM现有的5种通信量业务类型,即：恒定比特率（CBR）、可变比特率（VBR）、可用比特率（ABR）、不定比特率（UBR）和可保证帧速率（GFR）业务,在应用中各有所长。阐述了将ATM ABR业务运用于视频点播系统时,客户端和服务器端的缓存尺寸设置方法,为ABR业务在视频点播系统中的实际应用提供了有力的理论基础。     

Design and evaluation of an efficient traffic control scheme for integrated voice,video, and data over asynchronous transfer mode networks: Explicit allowed rate algorithm

Asychronous transfer mode (ATM) networks are high‐speed networks with guaranteed quality of service. The main cause of congestion in ATM networks is over utilization of physical bandwidth. Unlike constant bit‐rate (CBR) traffic, the bandwidth reserved by variable bit‐rate (VBR) traffic is not fully utilized at all instances. Hence, this unused bandwidth is allocated to available bit‐rate (ABR) traffic. As the bandwidth used by VBR traffic changes, available bandwidth for ABR traffic varies; i.e., available bandwidth for ABR traffic is inversely proportional to the bandwidth used by the VBR traffic. Based on this fact, a rate‐based congestion control algorithm, Explicit Allowed Rate Algorithm (EARA), is presented in this paper. EARA is compared with Proportional Rate Control Algorithm (PRCA) and Explicit Rate Indication Congestion Avoidance Algorithm (ERICA), in both LAN and WAN environments. Simulations of all three algorithms are conducted under both congestion and fairness configurations with simultaneous generation of CBR, rt‐VBR, nrt‐VBR and ABR traffic. The results show that, with very small over‐head on the switch, EARA significantly decreases the required buffer space and improves the network throughput. Copyright © 1999 John Wiley & Sons, Ltd.     

Buffer losses vs. deadline violations for ABR traffic in an ATM switch: A computational approach

The B‐ISDN will carry a variety of traffic types: the Variable Bit Rate traffic (VBR), of which compressed video is an example, Continuous Bit Rate traffic (CBR), of which telemetry is an example, Data traffic, and Available Bit Rate traffic (ABR) that represents aggregate data traffic with very limited guarantees on quality. Of these, VBR and CBR have timing constraints and need synchronous bandwidth; data traffic is relatively delay insensitive. In this paper, we consider the VBR, Data and ABR traffic types and obtain the cumulative distribution function (cdf) of the queueing delay experienced by a burst of ABR traffic in the output buffer of an ATM switch. The cdf is used to trade off buffer loss probabilities against deadline violation probabilities through adjusting the buffer size and (delay) deadline values. Large buffers result in low losses but queueing delays can become excessive and cause a high level of deadline violations. Both losses and violations are detrimental and an operating point must be chosen to achieve a balance. In this paper we study the nature of the trade off. We develop a stochastic Petri net model assuming periodic burst arrivals for VBR and Poisson arrival processes for the Data and ABR traffic types at the burst level, and solve the model analytically (numerically) using a decomposition approach. This decomposition, along with the inherent decomposability of the tagged customer approach for obtaining the cdf opens up a possibility of carrying out fast computations using a parallel machine for selecting the operating point each time that a call is admitted. This revised version was published online in June 2006 with corrections to the Cover Date.     

TCP/IPoverATM的性能研究

 本文讨论将传统的TCP拥塞控制机制和CIPOA用于采用ER(FB)算法和EFCI(CCR)算法的ATM网络时可用比特率业务(ABR)和未确定比特率业务(UBR)的性能.仿真结果表明,无论在缓冲区的需求、带宽分配的公平性、吞吐量和链路利用率方面ABR业务的TCP性能均明显优于UBR业务.对于较简单的网络模型ER(FB)算法的TCP性能优于EFCI(CCR)算法,更优于传统的EFCI算法.     

Picture quality optimization in ABR video services

In transmission of bursty traffic such as video and data, a network with a fixed capacity may have some unused bandwidth. The available bit-rate (ABR) scheme in ATM networks can make use of this spare channel capacity as a lower priority service. ABR has been developed initially for delay-tolerant services such as data. In this paper we demonstrate how with the help of a video transcoder delay-sensitive services such as video may be transmitted over ABR networks. The transcoder further compresses the video bit stream according to the rates dictated by the network with minimum degradation to the picture quality. We have optimised the video quality by combining the classical minimum cell rate (MCR) with the subjectively acceptable minimum quality (SAMQ). The performance of two different coding formats for ABR sources, namely the constant bit-rate (CBR) and variable bit-rate (VBR) video input to the transcoder are compared. We also present techniques for further reduction of congestion at the multiplexing switches to improve video quality and report on the impact of the forward and backward link delays on the ABR performance with a video transcoder.     

A Hybrid Adaptive Wireless Channel Access Protocol for Multimedia Personal Communication Systems

This paper proposes a new medium access protocol (MAC) protocol for futurewireless multimedia personal communication systems, denoted hybrid andadaptive multiple access control (HAMAC) protocol. The HAMAC protocolintegrates fixed assignment TDMA protocol, reservation-based protocols, andcontention-based protocols into a single wireless network so as tosimultaneously and efficiently support various classes of traffic such asconstant-bit-rate (CBR), variable-bit-rate (VBR), and available-bit-rate (ABR)traffic. In particular, the HAMAC protocol uses a novel preservationslot technique to overcome the packet contention overhead in packetreservation multiple access (PRMA) like protocols, while keeping mostisochronous service features of TDMA protocols to serve voice and CBR trafficstreams. A preservation slot is a very short slot which is used torepresent a CBR connection when the traffic in the CBR connection is in asilent period in which there is no meaningful data to transmit. Due to thevery short length of the preservation slot, it only takes minimalportion of the bandwidth pre-allocated to the CBR connection, so that theremaining bandwidth can be freed for other connections to use. When the CBRsource becomes active again, the preservation slot is replaced bynormal data slots without any reservation operation, extra delay, orsignificant bandwidth loss. Consequently, the guaranteed service andsimplified signaling features of TDMA protocols, together with the adaptivebandwidth allocation features of PRMA-like protocols, are both realized in theHAMAC protocol. We have analyzed the performance of the HAMAC protocol usingextensive simulations. The results show that the HAMAC protocol can achievevery low loss rates for various multimedia traffic with stringent quality ofservice (QoS) requirements and outperforms state-of-the-art PRMA-likeprotocols. As a result, the HAMAC protocol appears to be a good candidate forfuture generation multimedia personal communication systems.     

A multiple access scheme for multimedia traffic in wireless ATM

This paper proposes a multiple access scheme for the forthcoming wireless ATM (Asynchronous Transfer Mode) system. Such ATM compatible wireless systems are motivated by the rapidly increasing demand for wireless extensions to broadband networks, which are expected to support mixed broadband services including Constant Bit Rate (CBR), Variable Bit Rate (VBR), and Available Bit Rate (ABR) traffic. Since these different traffics have very different performance requirements, the multiple access scheme design is very challenging. In this paper, we propose a multiple access scheme called Dynamic Time Division Multiple Access with Piggybacked Reservation (DTDMA/PR), attempting to achieve higher statistical multiplexing efficiency in the mixed VBR/CBR/ABR traffic scenario. The basic idea is to exploit two levels of reservation. The first level deals with the isochronous nature of CBR and VBR traffic and the bursty nature of ABR traffic by using the ALOHA reservation procedure. The second level exploits the piggybacked reservation approach to cope with the dynamic feature of VBR traffic in order to increase the multiplexing efficiency. An analytical model is also developed in this paper and verified by simulation. Numerical examples are given to gain some insight into the protocol itself.     

Guaranteed quality-of-service wireless access to ATM networks

We study the problem of wireless access to asynchronous transfer modes (ATMs). We consider three classes of ATM sources: constant bit rate (CBR), variable bit rate (VBR), and available bit rate (ABR). We propose a polling scheme with nonpreemptive priority. Under such a scheme, we derive sufficient conditions such that all the CBR sources satisfy their jitter constraints and all the VBR sources satisfy their delay constraints. The remaining bandwidth is used by the ABR sources, for which we adapt a random access scheme proposed by Chen and Lee (1994). For this random access scheme, we derive the throughput-offer load characteristic, and thus the capacity. Based on this, we propose adaptive random access schemes that track the offer load to its optimal value. Our simulations show that our adaptive schemes maintain a high throughput with respect to the whole range of system load     

Multiple access control with intelligent bandwidth allocation forwireless ATM networks

Two major challenges pertaining to wireless asynchronous transfer mode (ATM) networks are the design of multiple access control (MAC), and dynamic bandwidth allocation. While the former draws more attention, the latter has been considered nontrivial and remains mostly unresolved. We propose a new intelligent multiple access control system (IMACS) which includes a versatile MAC scheme augmented with dynamic bandwidth allocation, for wireless ATM networks. IMACS supports four types of traffic-CBR, VBR, ABR, and signaling control (SCR). It aims to efficiently satisfy their diverse quality-of-service (QoS) requirements while retaining maximal network throughput. IMACS is composed of three components: multiple access controller (MACER), traffic estimator/predictor (TEP), and intelligent bandwidth allocator (IBA). MACER employs a hybrid-mode TDMA scheme, in which its contention access is based on a new dynamic-tree-splitting (DTS) collision resolution algorithm parameterized by an optimal splitting depth (SD). TEP performs periodic estimation and on-line prediction of ABR self-similar traffic characteristics based on wavelet analysis and a neural-fuzzy technique. IBA is responsible for static bandwidth allocation for CBR/VBR traffic following a closed-form formula. In cooperation with TEP, IBA governs dynamic bandwidth allocation for ABR/SCR traffic through determining the optimal SD. The optimal SDs under various traffic conditions are postulated via experimental results, and then off-line constructed using a back propagation neural network (BPNN), being used on-line by IBA. Consequently, with dynamic bandwidth allocation, IMACS offers various QoS guarantees and maximizes network throughput irrelevant to traffic variation     

Performance Analysis of an ATM Multiplexer with Multiple QoS VBR Traffic

In this paper, we propose a new queuing model, MMDP/MMDP/1/K, for an asynchronous transfer mode (ATM) multiplexer with multiple quality of service (QoS) variable bit rate (VBR) traffic in broad band-integrated services digital network (B-ISDN). We use the Markov Modulated Deterministic Process (MMDP) to approximate the actual arrival process and another MMDP for service process. Using queuing analysis, we derive a formula for the cell loss probability of the ATM multiplexer in terms of the limiting probabilities of a Markov chain. The cell loss probability can be used for connection admission control in ATM multiplexer and the calculation of equivalent bandwidth for arrival traffic. The major advantages of this approach are simplicity in analysis, accuracy of analysis by comparison of simulation, and numerical stability.     

Modeling and Simulation of Mixed Queueing and Loss Systems

In this paper, we investigate a multi-rate network in which wide-band calls are allowed to wait if insufficient resources are available at the time of the call arrival. On the link level, an analytical model is presented and simulations have been carried out on the network level. The results indicate that allowing a few wide-band calls to queue can give a significant improvement in performance in terms of network revenue , as well as a means to level out the blocking probabilities of the different traffic classes. This improvement becomes significant when the service discipline of the waiting calls (of different bandwidth requirements) is adaptive in the sense that longer queues get served first. This observation motivates the investigation of the impact of various buffer space assignment and queueing disciplines on network revenue and call blocking probabilities. The study of such mixed delay and queueing networks is motivated by its possible applications to traffic problems in future Broadband Integrated Services Digital Networks as well as in multi-rate cellular radio networks.     

Dynamic reservation TDMA protocol for wireless ATM networks

A dynamic reservation time division multiple access (DR-TDMA) control protocol that extends the capabilities of asynchronous transfer mode (ATM) networks over the wireless channel is proposed in this paper. DR-TDMA combines the advantages of distributed access and centralized control for transporting constant bit rate (CBR), variable bit rate (VBR), and available bit rate (ABR) traffic efficiently over a wireless channel. The contention slots access for reservation requests is governed by the framed pseudo-Bayesian priority (FPBP) Aloha protocol that provides different access priorities to the control packets in order to improve the quality-of-service (QoS) offered to time sensitive connections. DR-TDMA also features a novel integrated resource allocation algorithm that efficiently schedules terminals' reserved access to the wireless ATM channel by considering their requested bandwidth and QoS. Integration of CBR, voice, VBR, data, and control traffic over the wireless ATM channel using the proposed DR-TDMA protocol is considered in this paper. Simulation results are presented to show that the protocol respects the required QoS of each traffic category while providing a highly efficient utilization of approximately 96% for the wireless ATM channel     

WATMnet: a prototype wireless ATM system for multimedia personalcommunication

A prototype microcellular wireless asynchronous transfer mode network (WATMnet) capable of providing integrated multimedia communication services to mobile terminals is described in this paper. The experimental system's hardware consists of laptop computers (NEC Versa-M) with WATMnet interface cards, multiple VME/i960 processor-based WATMnet base stations, and a mobility-enhanced local-area ATM switch. The prototype wireless network interface cards operate at peak bit-rates up to 8 Mb/s, using low-power 2.4 GHz industrial, scientific, and medical (ISM)-band modems. Wireless network protocols at the portable terminal and base station interfaces support available bit rate (ABR), variable bit rate (VBR), and constant bit rate (CBR) transport services compatible with ATM using a dynamic time-division multiple-access/time-division duplex (TDMA/TDD) MAC protocol for channel sharing and data link control (DLC) protocol for error recovery. A custom wireless control protocol is also implemented between the portable and base units for support of radio link related functions such as user registration and handoff. All network entities including the portable, base and switch use a mobility-enhanced version of ATM (“Q.2931+”) signaling for switched virtual circuit (SVC) connection control functions, including handoff. In the first stage of the prototype, the application-level API is TCP/UP over ATM ABR service class using AAL5. Early experiments with the WATMnet prototype have been conducted to validate major protocol and software aspects, including DLC, wireless control, and mobility signaling for handoff, Selected network-based multimedia/video applications requiring moderate bit-rates (~0.5-1 Mb/s) in the ABR mode have been successfully demonstrated on the laptop PC     

Resource allocation using adaptive linear prediction in WDM/TDM EPONs

This letter discusses dynamic-wavelength and bandwidth-allocation (DWBA) algorithm for differentiated services in hybrid WDM/TDM EPONs (Ethernet passive optical networks). We integrate the traffic estimation for variable-bit-rate (VBR) video traffic with the resource allocation to satisfy the increasing demand of video streaming services. A new DWBA algorithm using an adaptive linear prediction model is proposed to estimate the bandwidth required by VBR video traffic arriving during the next waiting period, so that the DWBA algorithm can assign wavelength and bandwidth more effectively. Simulation results show that the proposed DWBA-ALP algorithm can significantly improve the delay jitter performance for both CBR and VBR services.     

A bandwidth allocation/sharing/extension protocol for multimediaover IEEE 802.11 ad hoc wireless LANs

We propose a novel bandwidth allocation/sharing/extension (DBASE) protocol to support both asynchronous traffic and multimedia traffic with the characteristics of variable bit rate (VBR) and constant bit rate (CBR) over IEEE 802.11 ad hoc wireless local area networks. The overall quality of service (QoS) will be guaranteed by DBASE. The designed DBASE protocol will reserve bandwidth for real-time stations based on a fair and efficient allocation. Besides, the proposed DBASE is still compliant with the IEEE 802.11 standard. The performance of DBASE is evaluated by analysis and simulations. Simulations show that the DBASE is able to provide almost 90% channel utilization and low packet loss due to delay expiry for real-time multimedia services     

Transporting compressed video over ATM networks with explicit-ratefeedback control

We propose a scheme for transmission of variable bit rate (VBR) compressed video for interactive applications using the explicit-rate congestion-control mechanisms proposed for the available bit rate (ABR) service in asynchronous transfer mode networks. Compressed video is inherently bursty, with rate fluctuations over both short and long time scales. This source behavior can be accommodated by the ABR service, since the explicit-rate scheme allows sources to request varying amounts of bandwidth over time. Moreover, when the bandwidth demand cannot be met, the network provides feedback indicating the bandwidth currently available to a connection. In our scheme, the video source rate is matched to the available bandwidth by modifying the quantization level used during compression. We use trace-driven simulations to examine how effective the enhanced explicit-rate scheme is in “rate matching” between the network and the source and the effect on end-to-end delay. We also look at the sensitivity of the proposed scheme to the estimates of the network round-trip times and to inaccuracies in the rate requests made by sources