An Experimental Study of New and Known Online Packet Buffering Algorithms

Albers, Susanne; Jacobs, Tobias

doi:10.1007/978-3-540-75520-3_66

Cited by 11 publications

(9 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Azar and Litichevskey [5] derived a 1.58-competitive algorithm for this special case with large buffers. Albers and Jacobs [2] gave an experimental study of new and known online packet buffering algorithms.…”

Section: Our Resultsmentioning

confidence: 99%

Improved Competitive Performance Bounds for CIOQ Switches

2011

View full text Add to dashboard Cite

Combined Input and Output Queued (CIOQ) architectures with a moderate fabric speedup S > 1 have come to play a major role in the design of high performance switches. In this paper we study CIOQ switches with First-In-First-Out (FIFO) buffers providing Quality of Service (QoS) guarantees. The goal of the switch policy is to maximize the total value of packets sent out of the switch. We analyze the performance of a switch policy by means of competitive analysis, where a uniform worst-case performance guarantee is provided for all traffic patterns. Azar and Richter (ACM Trans. Algorithms 2(2): [282][283][284][285][286][287][288][289][290][291][292][293][294][295] 2006) proposed the β-P G algorithm (Preemptive Greedy with a preemption factor of β) that is 8-competitive for an arbitrary speedup value when β = 3. We improve upon their result by showing that this algorithm achieves a competitive ratio of 7.5 and 7.47 for β = 3 and β = 2.8, respectively. Basically, we demonstrate that β-P G is at most β 2 +2β β−1 and at least β 2 β−1 -competitive.

show abstract

Section: Our Resultsmentioning

confidence: 99%

Improved Competitive Performance Bounds for CIOQ Switches

2011

View full text Add to dashboard Cite

show abstract

“…Case 1: If αx ≥ 1 − x: B arrival events occur during time (2,3), and B packets arrive at Q (1) . Then, the total value of packets which ON accepts by time 3 is (α + 1 + 1 − x)B.…”

Section: Lower Bound For Deterministic Algorithmsmentioning

confidence: 99%

“…Furthermore, 2B scheduling events occur during time (5,6). (3,4). For σ(4), ON transmits B(1 − z) packets and Bz ones from Q (1) and Q (m) , respectively during time (3,4).…”

Section: Lower Bound For Deterministic Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

Tight analysis of priority queuing for egress traffic

2015

View full text Add to dashboard Cite

“…In a recent paper, Azar and Litichevskey [5] derived a 1.58-competitive algorithm for switches with large buffers. Albers and Jacobs [2] gave an experimental study of new and known online packet buffering algorithms.…”

Section: Related Workmentioning

confidence: 99%

Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing

2010

View full text Add to dashboard Cite

The buffered crossbar switch architecture has recently gained considerable research attention. In such a switch, besides normal input and output queues, a small buffer is associated with each crosspoint. Due to the introduction of crossbar buffers, output and input dependency is eliminated, and the scheduling process is greatly simplified. We analyze the performance of switch policies by means of competitive analysis, where a uniform guarantee is provided for all traffic patterns. We assume that each packet has an intrinsic value designating its priority and the goal of the switch policy is to maximize the weighted throughput of the switch. We consider FIFO queueing buffering policies, which are deployed by the majority of today's Internet routers. In packet-mode scheduling, a packet is divided into a number of unit length cells and the scheduling policy is constrained to schedule all the cells contiguously, which removes reassembly overhead and improves Quality-of-Service. For the case of variable length packets with uniform value density (Best Effort model), where the packet value is proportional to its size, we present a packet-mode greedy switch policy that is 7-competitive. For the case of unit size packets with variable values (Differentiated Services model), we propose a A preliminary version of this paper appeared in [23].β-preemptive (β is a preemption factor) greedy switch policy that achieves a competitive ratio of 6 + 4β + β 2 + 3/(β − 1). In particular, its competitive ratio is at most 19.95 for the preemption factor of β = 1.67. As far as we know, this is the first constant-competitive FIFO policy for this architecture in the case of variable value packets. In addition, we evaluate performance of β-preemptive greedy switch policy by simulations and show that it outperforms other natural switch policies. The presented policies are simple and thus can be efficiently implemented at high speeds. Moreover, our results hold for any value of the internal switch fabric speedup.

show abstract

An Experimental Study of New and Known Online Packet Buffering Algorithms

Cited by 11 publications

References 9 publications

Improved Competitive Performance Bounds for CIOQ Switches

Improved Competitive Performance Bounds for CIOQ Switches

Tight analysis of priority queuing for egress traffic

Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing

Contact Info

Product

Resources

About