Priority management in ATM switching nodes

Kröner, Hans; Hebuterne, Gérard; Boyer, P.; Gravey, Annie

doi:10.1109/49.76641

Cited by 207 publications

(48 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In general, policies which can accept an arriving packet by dropping another packet from the buffer are known as push-out policies. There has been a number of prior works which have proposed various push-out policies such as 1) random [12], 2) first in first out (FIFO) [13], 3) drop tail (LIFO) [14], and so on. In [15], a buffer management scheme called most redundant drop (MRD) was proposed that makes use of spatial information in sensor data to improve the network coverage.…”

Section: Introductionmentioning

confidence: 99%

Multi-Layer WSN With Power Efficient Buffer Management Policy

Shwe¹,

Peng²,

Gacanin

et al. 2012

PIER Letters

View full text Add to dashboard Cite

Abstract-Power efficiency is a key issue in wireless sensor networks due to limited power supply. Buffer management is also crucially important in the scenario where the incoming traffic is higher than the output link capacity of the network since a buffer overflow causes power waste and information loss if a packet is dropped. There are many available buffer management schemes for traditional wireless networks. However, due to limited memory and power supply of sensor nodes, the existing schemes cannot be directly applied in wireless sensor networks (WSNs). In this work, we propose a multi-layer WSN with power efficient buffer management policy which simultaneously reduces the loss of relevant packets. Unlike the conventional WSNs which consider the whole network as single layer, we divide sensor network topology logically into multiple layers and give a three layer model as an example. In our proposed scheme, the layers are differentiated by the sensors' information. The buffer can then judge the packets from different layers and then make a decision on which packet to be dropped in case of overflow. We show that our proposed multi-layer WSN can reduce the relevant packet loss and power waste for retransmission of lost packets.

show abstract

Section: Introductionmentioning

confidence: 99%

Multi-Layer WSN With Power Efficient Buffer Management Policy

Shwe¹,

Peng²,

Gacanin

et al. 2012

PIER Letters

View full text Add to dashboard Cite

show abstract

“…In order to maintain the QoS of ach traffic type, some types of priority schemes are required to use in scheduling process at switching node in an ATM network. These priority schemes treat each traffic class according to its QoS requirements and support -integrated services [3,10,15,16] In this paper two types of priority schemes namely -arrival Rate Based State Dependent (ARBSD) priority scheme and the Relative State Dependent (RSD) Priority schemes have been analyzed for the scheduling of an output buffered ATM switch [3,4] . In the ARBSD priority scheme the number of cells of each traffic class in the buffer and its corresponding arrival rate to decide, which class is selected for service in the next time slot?…”

Section: Introduction Broadband Integrated Services Digital Network (mentioning

confidence: 99%

Performance Analysis of Priority Scheme in ATM Network

Bali¹,

Rathore²,

Sirohi³

2010

IJCA

View full text Add to dashboard Cite

The asynchronous Transfer Mode (ATM) is the widely used packet switching and connection oriented technology that meets diverse services and performance requirements of real time applications using the broadcast . An ATM network is suitable for multimedia services with different traffic flow characteristics and quality of services (QoS ) requirements. In order to meet the required QoS of each traffic type, some types of priority disciplines are needed in packet switching to increase the utilization of switches in ATM networks. This paper describes a buffer management scheme using two different prioritized service disciplines in order to improve the QoS in terms of cell delay time for each traffic class and to reduce the cell loss rate of loss sensitive class in an ATM network. The performance analysis and comparative study of these priority schemes have been presented.

show abstract

“…By doing this, higher priority packets have less loss probability and shorter queueing delay at the expense of loss of lower priority packets. It has been shown that the partial buffer sharing policy not only performs well to meet the various QoS requirements for multiple priority classes, but also can be implemented easily, so it has been proposed as a good candidate for an overload control mechanism and analyzed intensively [5,7,8,16,17]. Lucantoni et al [8] analyzed the partial buffer sharing policy when the arrival process is a Poisson process.…”

Section: Introductionmentioning

confidence: 99%

“…Lucantoni et al [8] analyzed the partial buffer sharing policy when the arrival process is a Poisson process. Kröner et al [7] examined the performance of the partial buffer sharing policy based on the M/G/1/N queueing system. They also considered an ON and OFF source as input traffic and provided an approximation for the loss probability of each class.…”

Section: Introductionmentioning

confidence: 99%

Performance analysis of the DAR(1)/D/c priority queue under partial buffer sharing policy

Hwang

Choi

2004

Computers & Operations Research

View full text Add to dashboard Cite

We analyze a multi-server priority queueing system with partial buffer sharing, where the input is a discrete autoregressive process of order 1 (DAR(1)) which is known as a good mathematical model for a VBR-coded teleconference video traffic. We assume that arriving packets are classified into two priority classes, say, high priority class and low priority class based on their importance. A threshold T is set to limit the accessibility of low priority packets to the buffer. When the partial buffer sharing is applied to the real time traffic such as teleconference video traffic, it is known that it can decrease the queueing delay at the expense of the loss of low priority packets which is less important. Since the queueing delay is more important than the loss probability for real time traffic, it is important to analyze the queueing delay of DAR(1) arrivals under the partial buffer sharing policy. Based on the Wiener-Hopf factorization of the GI/GI/1 queue, we obtain the waiting time distribution of a packet which is not discarded at its arrival in the steady state. Numerical examples are provided to show the feasibility of our analysis. We also show that the partial buffer sharing policy significantly decreases the waiting time as the value of threshold increases.

show abstract

Priority management in ATM switching nodes

Cited by 207 publications

References 15 publications

Multi-Layer WSN With Power Efficient Buffer Management Policy

Multi-Layer WSN With Power Efficient Buffer Management Policy

Performance Analysis of Priority Scheme in ATM Network

Performance analysis of the DAR(1)/D/c priority queue under partial buffer sharing policy

Contact Info

Product

Resources

About