Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions

Kamoun, Farouk; Kleinrock, Leonard

doi:10.1109/tcom.1980.1094756

Cited by 198 publications

(68 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We have selected the complete sharing buffering scheme [18] for our approach because it is efficient and simple. In our network scenario, each node consists of a total buffer size, B, shared by T different types of queues.…”

Section: Buffer Partitioningmentioning

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: Buffer Partitioningmentioning

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

“…One commonly used control scheme to provide multiple grades of service in the context of shared resources is the partial sharing policy [8], [9]. This policy was originally proposed to protect each customer from the overloads caused by other customers sharing the same resource.…”

Section: Related Workmentioning

confidence: 99%

Introducing a Relative Priority for the Shared-Protection Schemes

Bouabdallah¹,

Séricola²

2007

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

Abstract-One of the major challenges of optical network operators is ensuring the stringent levels of availability required by their highest class clients. To achieve this, we introduce relative priorities among the different primary connections contending for access to the shared-protection paths. In this paper, we provide an analytical model for the proposed priority-enabled scheme. As a key distinguishing feature from existing literature, we derive explicit analytic expressions for the average availability and service disruption rate for the different priority classes.

show abstract

“…One type of buffer-management scheme places limits on the maximum or minimum amount of buffer space that should be available to any individual output queue. In the static threshold (ST) scheme [2] [3], also called sharing with maximum queue lengths (SMXQ) [4] [5], an arriving packet is admitted only if the queue length at its destination output port is smaller than a given threshold. In the sharing with a minimum allocation (SMA) scheme [4] [5], a minimum amount of buffer space is always reserved for each output port.…”

Section: Introductionmentioning

confidence: 99%

“…In the static threshold (ST) scheme [2] [3], also called sharing with maximum queue lengths (SMXQ) [4] [5], an arriving packet is admitted only if the queue length at its destination output port is smaller than a given threshold. In the sharing with a minimum allocation (SMA) scheme [4] [5], a minimum amount of buffer space is always reserved for each output port. The sharing with a maximum queue and minimum allocation (SMQMA) scheme [4] [5] is the combination of SMXQ and SMA schemes, each output port always has access to a minimum allocated buffer space and the remaining space can be used by any output queue up to the threshold value.…”

Section: Introductionmentioning

confidence: 99%

“…In the sharing with a minimum allocation (SMA) scheme [4] [5], a minimum amount of buffer space is always reserved for each output port. The sharing with a maximum queue and minimum allocation (SMQMA) scheme [4] [5] is the combination of SMXQ and SMA schemes, each output port always has access to a minimum allocated buffer space and the remaining space can be used by any output queue up to the threshold value. In the second approach of buffer management, a dynamic threshold regulates the sharing of the buffer space among output ports.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Buffer Management in the Sliding-Window (SW) Packet Switch for Priority Switching

Muñoz¹,

Kumar²

2014

IJCNS

View full text Add to dashboard Cite

Switch and router architectures employing a shared buffer are known to provide high throughput, low delay, and high memory utilization. Superior performance of a shared-memory switch compared to switches employing other buffer strategies can be achieved by carefully implementing a buffer-management scheme. A buffer-sharing policy should allow all of the output interfaces to have fair and robust access to buffer resources. The sliding-window (SW) packet switch is a novel architecture that uses an array of parallel memory modules that are logically shared by all input and output lines to store and process data packets. The innovative aspects of the SW architecture are the approach to accomplishing parallel operation and the simplicity of the control functions. The implementation of a buffer-management scheme in a SW packet switch is dependent on how the buffer space is organized into output queues. This paper presents an efficient SW buffermanagement scheme that regulates the sharing of the buffer space. We compare the proposed scheme with previous work under bursty traffic conditions. Also, we explain how the proposed buffer-management scheme can provide quality-of-service (QoS) to different traffic classes.

show abstract

Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions

Cited by 198 publications

References 10 publications

Multi-Layer WSN With Power Efficient Buffer Management Policy

Multi-Layer WSN With Power Efficient Buffer Management Policy

Introducing a Relative Priority for the Shared-Protection Schemes

Buffer Management in the Sliding-Window (SW) Packet Switch for Priority Switching

Contact Info

Product

Resources

About