Stateless RD network services

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Rate-Delay (RD) Network Services constitute a promising differentiated-services architecture for multi-provider networks, by offering users a choice between high throughput or low queuing delay at bottleneck links. An RD router provides service differentiation via transmission scheduling and by managing two FIFO queues. To ensure strict delay bounds, an RD router tracks arrival times of packets in the D service queue, and discards late packets at the queue head. However, maintaining the per-packet state is undesirable for complexity and cost reasons. In this paper, we present a Stateless RD (S-RD) router design that provides low queuing delay to the D service exclusively via buffer dimensioning, without requiring any per-packet state. After proving analytically that the S-RD design meets the delay guarantees, we use simulation to evaluate the performance of the stateless design, confirming that S-RD routers preserve the delay bounds of RD network services. As case studies, we consider Voice-over-IP (VoIP) and Web browsing as particular examples of Internet applications. The extensive simulation results demonstrate that S-RD Network Services significantly improve VoIP quality and increase the goodput of short-lived Web flows, without degrading the throughput of long-lived flows. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Podlesny, M., & Gorinsky, S. (2010). Stateless RD network services. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6091 LNCS, pp. 135–147). https://doi.org/10.1007/978-3-642-12963-6_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free