A Bernoulli process approximation with buffer size adjustment forthe analysis of an ATM multiplexer

The heterogeneity and the burstiness of input source traffic together with large size of the shared buffer make it difficult to analyze the performance of an asynchronous transfer mode (ATM) multiplexer. Based on the asymptotic decay rate of queue length distribution at the shared buffer, we propose a Bernoulli process approximation for the individual on-off input source with buffer size adjustment, which gives a good upper bound of the cell loss probability     

Edge node buffer usage in optical burst switching networks

Optical Burst Switching (OBS) combines the benefits of Optical Packet Switching and Optical Circuit Switching technologies to provide an efficient, yet cost effective, method for data transmission in an all-optical, bufferless, core network. While most studies on OBS has concentrated on the core OBS network, we contribute new studies for the buffer requirement of an OBS edge node. The buffer usage for OBS systems only arises in the edge nodes since they contain an array of assemblers which combines electronic data with a common destination into an OBS burst stream for transmission in an all-optical bufferless core network. Specifically, we present two analytical results for buffer usage in an OBS edge node: one for Poisson traffic and the other for self-similar traffic input. The results show that the aggregated traffic from many assemblers inherits the characteristics of the source input traffic. This means that the output traffic approaches Poisson if the input traffic is Poisson, and the output traffic remains self-similar if the input is self-similar. These results lead to the following important design issues when dimensioning buffer requirements in an OBS edge node: if the traffic input is Poisson, the M/G/m model is the model to use for obtaining the upper bound on buffer usage in an OBS edge node; and for the case of self-similar traffic, Brichet’s method can be used to provide the upper and lower bound.     

Accurate approximation of cell loss probability for self-similartraffic in ATM networks

Recently, self-similar (or fractal) stochastic processes have been regarded as more accurate models of certain categories of traffic (e.g. LAN traffic) which will be transported in ATM networks. The authors propose a method for estimating the cell loss probability in an ATM multiplexer fed by a self-similar arrival process. The packet arrivals are generated by a fractional Brownian motion process and the service process is deterministic. The approach is based on theory for large deviations, and simulation tests show that it is more accurate than the existing approximation result     

自相似业务:基于多分辨率采样和小波分析的Hurst系数估计方法

新近对局域网和广域网上大量突发业务流量的监测结果表明，采用自相似建模表征业务到达过程的长时间相关特性具有较高精度，其中Ｈｕｒｓｔ系数是表征业务突发特性的重要参数，因此在一定的观察时间内对突发业务的Ｈｕｒｓｔ系数进行快速、准确的估计是高速宽带网络（如ＡＴＭ）实施流量控制和缓冲资源分配的前提。本文提出一种基于多分辨率采样和小波分析的Ｈｕｒｓｔ系数快速估计方法，对严格二阶自相似模型下Ｈｕｒｓｔ系数的估计     

Worst-case performance of a buffer with independent shaped arrivalprocesses

In both asynchronous transfer mode (ATM) standards and evolving Internet guidelines, deterministic shaping has two principle objectives: (1) to facilitate the allocation of a suitable amount of resources (buffer memory, bandwidth) to a connection to achieve its required quality of service and (2) to easily police traffic and assure “fair” access to a shared resource. We take an ATM context and use fluid modeling, which is appropriate because ATM uses small fixed-length (53-byte) packets called cells. A buffer in a network access node with independent and identically distributed shaped arrival processes is considered. A worst-case performance bound is derived that relies only on the traffic shaping parameters     

Cell loss analysis and design trade-offs of nonblocking ATMswitches with nonuniform traffic

In practical ATM switch design, a proper dimensioning of buffer sizes and a cost effective selection of speed-up factor should be considered to guarantee a specified cell loss requirement for a given traffic. Although a larger speed-up factor provides better throughput for the switch, increasing the speed-up factor involves greater complexity and cost. Hence, it may not be cost effective to increase the speed-up factor for 100% throughput. Moreover, with a given buffer budget, an increase in the speed-up factor beyond a certain value only adds to the cell loss. The paper addresses design trade-offs existing between finite input/output buffer sizes and speed-up factor in a nonblocking ATM switch. Another important issue is the adverse effect on cell loss performance caused by nonuniform traffic (different traffic intensity and unevenly distributed routing). The paper analyzes cell loss performance of ATM switches with nonuniform traffic, and examines the effect of each nonuniform traffic parameter. The authors also provide an algorithm for effective buffer sharing that alleviates the performance degradation caused by traffic nonuniformity     

ATM交换机EPD性能分析

利用ＡＴＭ网络传送ＴＣＰ分组时的一个重要问题是分组中任何一个信元丢失都半导致分组的重传,为解决这一问题,一个方法是发生拥塞时交换机有选择丢弃信元,在有限的存储器容量下,交换机智能化的信元集合源状态与缓存器占用的联合分布,基于这一结果,本文推导出的ＥＰＤ系统的分组丢失率的上界和下界,通过分析比较发现,使用ＥＰＤ的系统,当门限设为缓存器大小时其性能将优于无控制系统。     

Self-similar processes in communications networks

This paper reviews and discusses the known definitions and properties of second-order self-similar discrete-time processes and supplements them with some more general conditions of self-similarity. A model for ATM cell traffic is presented and self-similarity conditions of this model are found. This study is motivated by observations that traffic in many real communication networks is self-similar in nature     

Multihop Virtual Topology Design in WDM Optical Networks for Self-Similar Traffic

In this paper, we consider the problem of designing virtual topologies for multihop optical WDM networks when the traffic is self-similar in nature. Studies over the last few years suggest that the network traffic is bursty and can be much better modeled using self similar process instead of Poisson process. We examine buffer sizes of a network and observe that, even with reasonably low buffer overflow probability, the maximum buffer size requirement for self-similar traffic can be very large. Therefore, a self-similar traffic model has an impact on the queuing delay which is usually much higher than that obtained with the Poisson model. We investigate the problem of constructing the virtual topology with these two types of traffic and solve it with two algorithmic approaches: Greedy (Heuristic) algorithm and Evolutionary algorithm. While the greedy algorithm performs a least-cost search on the total delay along paths for routing traffic in a multihop fashion, the evolutionary algorithm uses genetic methods to optimize the average delay in a network. We analyze and compare our proposed algorithms with an existing algorithm via different performance parameters. Interestingly, with both the proposed algorithms the difference in the queuing delays, caused by self-similar and Poisson traffic, results in different multihop virtual topologies.     

A buffer allocation scheme for ATM networks: complete sharing basedon virtual partition

Buffer allocation to provide an efficient and fair use of the available buffer spaces is critically important for ATM networks. A complete sharing with virtual partition (CSVP) strategy for buffer management at a multiplexer or an output port of an output buffered switch is proposed and analyzed. The total buffer space is partitioned based on the relative traffic loads (measured or estimated). Virtual partition allows a newly arriving cell belonging to an oversubscribed type to occupy the spare space of an undersubscribed type, and to be overwritten when necessary. Using a fluid flow approach, a set of partial differential equations with a triangular stability region is established to characterize the dynamics of a system supporting two traffic flows. Under a buffer full condition, the system behavior is described by a set of non-homogeneous ordinary differential equations. The cell loss probability for each traffic type is obtained by solving the ordinary differential equations. Numerical examples indicate that by appropriately selecting the partitions, the CSVP method may be used to provide differential cell loss rate requirements by the different traffic types     

Design of a non-blocking shared-memory copy network for ATM

The design of a copy network is presented for use in an ATM (asynchronous transfer mode) switch supporting BISDN (broadband integrated services digital network) traffic. Inherent traffic characteristics of BISDN services require ATM switches to handle bursty traffic with multicast connections. In typical ATM switch designs a copy network is used to replicate multicast cells before being forwarded to a point-to-point routeing network. In such designs, a single multicast cell enters the switch and is replicated once for each multicast connection. Each copy is forwarded to the routeing network with a unique destination address and is routed to the appropriate output port. Non-blocking copy networks permit multiple cells to be multicasted at once, up to the number of outputs of the copy network. Another critical feature of ATM switch design is the location of buffers for the temporary storage of transmitted cells. Buffering is required when multiple cells require a common switch resource for transmission. Typically, one cell is granted the resource and is transmitted while the remaining cells are buffered. Current switch designs associate discrete buffers with individual switch resources. Discrete buffering is not efficient for bursty traffic as traffic bursts can overflow individual switch buffers and result in dropped cells, while other buffers are under-used. A new non-blocking copy network is presented in this paper with a shared-memory input buffer. Blocked cells from any switch input are stored in a single shared input buffer. The copy network consists of three banyan networks and shared-memory queues. The design is scalable for large numbers of inputs due to low hardware complexity, O (N log₂ N), and distributed operation and control. It is shown in a simulation study that a switch incorporating the shared-memory copy network has increased throughput and lower buffer requirements to maintain low packet loss probability when compared to a switch with a discrete buffer copy network.     

Measurement-based performance evaluation of an ATM switch withexternal multicasting engine and multiple-priority classes

This paper uses measurement-based traffic models to evaluate a shared-memory ATM switch with 32×32 155 Mbit/s ports and an external multicasting engine; this is the design of Cisco System's next-generation ATM switch, the LightStream-1010 (LS-1010). Assuming that the multicast traffic can take approximately 30% of the total switch load, we find that an external multicasting engine requires a 32 (8) cell buffer at a replication rate of 16 (64) cells per cell service time. We discover that in a multimedia environment, the shared-memory architecture requires 10-30 times less total memory than the bus architecture; a 64 K cell buffer is sufficient to handle 90% utilization with the nonuniform traffic that we investigated. Multiple-priority classes are considered     

A new priority control of ATM output buffer

A new ATM output buffer management strategy with priority control function is proposed, based on four types of cell classes. This strategy can use system resource more effectively, meet the quality of service (QOS) requirements (i.e. cell loss probabilities and delay characteristics) of different services, and also can reduce the complexity of buffer. Furthermore, overload from lower priority traffic doesn't degrade the performance of higher priority traffic (i.e. cell loss rate and cell delay characteristics).     

ATM网络中CBR业务排队性能分析

分析了ATM网络中CBR业务排队性能,给出了一种简单的计算信元丢失率和信元平均时延的表达式.分析结果表明,一方面在较小的缓冲区容量下,即使CBR业务被分配的带宽大于等于其峰值速率,也还存在着较大的信元丢失;另一方面,当复用的CBR业务源数目很大时,只需要分配相对较小的缓冲区容量就可以满足十分低的信元丢失率要求.该结果对于ATM设备中相应的缓冲区设计、带宽分配以及连接允许控制机制的研究具有重要的意义.     

Quasi-pushout cell discarding

In asynchronous transfer mode (ATM) switching networks, buffers are required to accommodate traffic fluctuations due to statistical multiplexing. However, cell discarding takes place when the buffer space of a network node is used up during a traffic surge. Though pushout cell discarding was found to achieve fair buffer utilization and good cell loss performance, it is difficult to implement because of the large number of queue length comparisons. We propose quasi-pushout cell discarding which reduces the number of queue length comparisons by employing the concept of quasi-longest queue. Simulation results under bursty and imbalanced traffic conditions show that quasi-pushout can achieve comparable cell loss performance as pushout at a much lower complexity     

THE ANALYSIS OF CELL LOSS RATES IN AN ATM MUX WITH LOSS PRIORITIES

The analysis of cell loss rates in an ATM Mux with loss priorities is an important problem in the-study of traffic control in ATM networks. In this paper, the loss rates of the cells with different priorities in an ATM Mux are analyzed by approximating the actual input process with two-state MMDP and fluid flow technique, and the analytical expressions of the relation between the loss rates and the buffer size are obtained. Simulation shows that the approach is sulliciently accurate for applications.     

具有自相似特性的业务及其对ATM网络性能的影响

本文对自相似业务的定义，性质和生成方法进行了综述了讨论了自相似业务对ＡＴＭ网络 影响。最后，指出了待进一步深入伯课题。     

Cell multiplexing in ATM networks

Formulates, analyzes, and compares several connection multiplexing algorithms for a multiplexer residing in the equivalent terminal of the asynchronous transfer mode (ATM) layer at the user premise. The primary goal is to find an algorithm that efficiently combats the cell delay variation (CDV) introduced by the multiplexer. Several performance criteria are examined, one of which is unique to ATM networks. This one is the proportion of arriving cells that do not conform to the traffic contract of the connection. The conformance is being tracked by a generic cell rate algorithm (GCRA) recommended (but not mandatory) by CCITT. Other criteria are the classical buffer requirements and the cell delay. Service fairness among connections is also evaluated with respect to each performance criterion. The impact of the following five multiplexing policies on the performance criteria are evaluated for constant bit rate (CBR) traffic sources. The policies are first in, first out (FIFO), round robin (RR), least time to reach bound (LTRB), most behind expected arrival (MBEA), and golden ratio (GR). Extensive numerical examples reveal that there is no single policy that is best across all criteria. With respect to cell conformance, most behind expected arrival (MBEA) emerges as the preferred one. FIFO is best with respect to cell delay, except for high utilizations where RR dominates. The LTRB is marginally better than all other policies with respect to buffer requirements     

含优先级机制的ATM Mux中的信元丢失率分析

含丢失优先级机制的ATM Mux中的信元丢失率分析是ATM网络流量控制研究中的一个重要问题.本文用两状态的MMDP近似实际输入过程,并采用流体流技术对不同优先级信元在ATM Mux中的丢失率进行了分析,得到了各类信元的丢失率与缓冲容量之间关系的解析式.模拟文验表明该方法足够精确,完全可以满足实际应用的需要.