Comparison of buffer allocation schemes in ATM switches: complete sharing, partial sharing, and dedicated allocation

Causey, Jeffrey W.; Kim, H.S.

doi:10.1109/icc.1994.368919

Cited by 31 publications

(10 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Buffer management schemes can be categorized into three classes from resource management viewpoint, namely: Complete Buffer Partitioning (CBP), Complete Buffer Sharing (CBS) and Partial Buffer Sharing (PBS) [5]. From a queuing strategy viewpoint, buffer management can be categorized into time priority and space priority.…”

Section: Related Workmentioning

confidence: 99%

“…Complete Buffer Partitioning (CBP) [5] is a buffer resource management policy that segments a given buffer space into multiple queues, according to the differentiated classes of traffic, each of which corresponds to a single class. Traffic belonging to one class cannot occupy the buffer space assigned to another class, resulting in discarded arriving packets even when the overall allocated buffer is not yet full.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Novel Radio Link Buffer Management Schemes for End-User Multi-class Traffic in High Speed Packet Access Networks

Yerima

Al‐Begain

2010

Wireless Pers Commun

View full text Add to dashboard Cite

The requirement to provide multimedia services with QoS support in mobile networks has led to standardization and deployment of high speed data access technologies such as the High Speed Downlink Packet Access (HSDPA) system. HSDPA improves downlink packet data and multimedia services support in WCDMA-based cellular networks. As is the trend in emerging wireless access technologies, HSDPA supports end-user multi-class sessions comprising parallel flows with diverse Quality of Service (QoS) requirements, such as real-time (RT) voice or video streaming concurrent with non real-time (NRT) data service being transmitted to the same user, with differentiated queuing at the radio link interface. Hence, in this paper we present and evaluate novel radio link buffer management schemes for QoS control of multimedia traffic comprising concurrent RT and NRT flows in the same HSDPA end-user session. The new buffer management schemes-Enhanced Time Space Priority (E-TSP) and Dynamic Time Space Priority (D-TSP)-are designed to improve radio link and network resource utilization as well as optimize end-to-end QoS performance of both RT and NRT flows in the end-user session. Both schemes are based on a Time-Space Priority (TSP) queuing system, which provides joint delay and loss differentiation between the flows by queuing (partially) loss tolerant RT flow packets for higher transmission priority but with restricted access to the buffer space, whilst allowing unlimited access to the buffer space for delay-tolerant NRT flow but with queuing for lower transmission priority. Experiments by means of extensive system-level HSDPA simulations demonstrates that with the proposed TSP-based radio link buffer management schemes, significant end-to-end QoS performance gains accrue to end-user traffic with simultaneous RT and NRT flows, in addition to improved resource utilization in the radio access network.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Novel Radio Link Buffer Management Schemes for End-User Multi-class Traffic in High Speed Packet Access Networks

Yerima

Al‐Begain

2010

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…Tassiulas et al [6] present a study to determine an optimal method to reduce cell loss rate in an ATM network, especially for loss sensitive cells. Causey and Kim [7] compare the performance of three space priority schemes and report that while complete buffer sharing delivers the highest throughput and lowest loss rate for nonbursty traffic, it suffers from congestion and unfairness corresponding to bursty input traffic. While complete partitioning attempts to be fair, it is inefficient in utilizing the available buffer space.…”

Section: Introductionmentioning

confidence: 99%

Performance analysis of fuzzy thresholding-based buffer management for a large-scale cell-switching network

Razouqi

Joo²,

Ghosh³

2000

IEEE Trans. Fuzzy Syst.

View full text Add to dashboard Cite

This paper addresses three key issues in buffer management in cell switching networks including asynchronous transfer mode (ATM) networks. First, it develops a model of fuzzy thresholding-based buffer management for a 50-switch representative cell-switching network, to study its performance under realistic conditions. Previous studies have been confined to a single switch and, consequently, the results are not necessarily applicable to a real-world cell-switching network consisting of multiple switches. Second, it presents an approach to reroute to their final destinations, the fraction of the selectively blocked cells that correspond to the difference of cell loss due to buffer overflow between the fixed and fuzzy schemes. While the fixed threshold, through its abrupt nature, causes a relatively higher cell drop through buffer overflow, intuitively, the fuzzy threshold may trade off cell loss through buffer overflow for increased selective blocking at the sending switch. While the goal of the second issue is to improve throughput and thereby achieve higher reliability, the delays incurred by the cells in the network are likely to increase. Third, this is the first paper to report on the influence of the buffer management scheme on the end-to-end delay performance of a representative cell switching network. The model is simulated on a testbed consisting of a network of 25+ Pentium workstations under linux, configured as a loosely coupled parallel processor. Simulation results reveal that, even for a large-scale representative cell-switching network, the fuzzy approach adapts superbly to different bursty input traffic distributions, yielding lower cell loss rates. A total of 10 000 user calls, generating between 1.0 and 1.5 million ATM cells, is stochastically distributed among the nodes. Performance analysis reveals that for different input traffic distributions ranging from light to moderate to heavy traffic, the fuzzy threshold scheme consistently succeeds in lowering the cell loss due to buffer overflow relative to fixed thresholding by blocking them at the sending switch. The re-routing approach, in turn, successfully routes these blocked cells, although it causes the average end-to-end cell delay in the network to increase compared to the fixed scheme by a factor ranging from 1.65 for relatively light traffic to 6.7 for heavy traffic.Index Terms-asynchronous transfer mode (ATM) networks, buffer management, cell-switching network, fuzzy thresholds, large-scale switching network.

show abstract

“…Threshold-based Push-out and Probabilistic Push-out schemes [7] have been found to provide more flexibility in tuning the cell loss probability but their implementation seems to be complex while still having the restriction that the class with strict cell loss requirement is the one with the low cell delay requirement. Comparisons between various space-priority schemes are presented in [8][9][10]. It turns out that such schemes are fairly effective in inducing fairly different cell loss rates for the differentiated applications (differences of several orders of magnitude are achievable).…”

Section: Introductionmentioning

confidence: 99%

Study of a scheduling policy for diverse deadline-based quality of service

Stavrakakis

Chen²

2000

Performance Evaluation

View full text Add to dashboard Cite

One of the most challenging problems in ATM network design is providing diversified Quality of Service (QoS) to applications with distinct characteristics. Buffer management schemes can play a significant role in providing the necessary diversification through the employed cell admission and service policy. A flexible priority service policy for two applications (classes) with strict -and in general distinct -deadlines and different deadline violation rates is studied in this paper. The proposed policy is a generalization of the shortest time to extinction (STE) policy (or the Earliest Due Date policy which discards expired cells), which is more flexible in providing diversified QoS. The relationship of this policy to other standard ones is also discussed. A flexible numerical analysis is presented for the derivation of performance measures such as cell loss, mean cell-delay and the tail of the cell-delay probability distribution for each class. Numerical results illustrate the effectiveness of the studied priority scheme. Finally, a low-complexity implementation scheme is proposed, which does not require time-stamp-based sorting.

show abstract

Comparison of buffer allocation schemes in ATM switches: complete sharing, partial sharing, and dedicated allocation

Cited by 31 publications

References 5 publications

Novel Radio Link Buffer Management Schemes for End-User Multi-class Traffic in High Speed Packet Access Networks

Novel Radio Link Buffer Management Schemes for End-User Multi-class Traffic in High Speed Packet Access Networks

Performance analysis of fuzzy thresholding-based buffer management for a large-scale cell-switching network

Study of a scheduling policy for diverse deadline-based quality of service

Contact Info

Product

Resources

About