Admission Control for DiffServ Based Quality of Service in Cut-Through Networks

Reinemo, Sven-Arne; Sem-Jacobsen, Frank Olaf; Skeie, Tor; Lysne, Olav

doi:10.1007/978-3-540-24596-4_14

Cited by 9 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many AC schemes have been proposed. In [30], an implementation and comparison of a probe, a statistical, and a bandwidth broker approach is presented.…”

Section: Admission Controlmentioning

confidence: 99%

“…The first possibility is to configure the schedulers in advance, assigning each VC with a specific weight in the case of the MinBW scheduler or assigning each table entry with a given VC identifier in the table-scheduler case. This distribution would be made taking into account the requirements and expected amount of traffic of the SCs that traverse each VC [30].…”

Section: Scheduler Configurationmentioning

confidence: 99%

See 1 more Smart Citation

A Framework to Provide Quality of Service over Advanced Switching

Martínez

Alfaro

Sánchez

2008

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Advanced Switching (AS) is a network technology that expands the capabilities of PCI Express, adding new features like peer-to-peer communication. Together, PCI Express and AS have the potential for building the next-generation interconnects. Furthermore, the provision of Quality of Service (QoS) in computing and communication environments is currently the focus of much discussion and research in the industry and academia. In this paper, we propose a framework to provide QoS based on bandwidth, latency, and jitter over AS, employing the mechanisms provided by AS. We also present several implementations for the output scheduling mechanism. Finally, we evaluate our proposals by simulation, comparing the performance of the schedulers that we propose and their implementation complexity.

show abstract

“…Many AC schemes have been proposed. In [30], an implementation and comparison of a probe, a statistical, and a bandwidth broker approach is presented.…”

Section: Admission Controlmentioning

confidence: 99%

Section: Scheduler Configurationmentioning

confidence: 99%

A Framework to Provide Quality of Service over Advanced Switching

Martínez

Alfaro

Sánchez

2008

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…Control applications using a soft real-time environment are good known examples as well (Palopoli et al, 2000;Cervin and Eker, 2005). Reinemo et al (2003) studied the method of providing soft real-time guarantees by using three different admission control schemes, in combination with DiffServ based QoS. Wang (2006) presented a method of improving the QoS of soft real-time applications over IP network infrastructure.…”

Section: Related Workmentioning

confidence: 99%

A RED modified weighted moving average for soft real-time application

Domanźka

Domański

Klamka

2014

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

The popularity of TCP/IP has resulted in an increase in usage of best-effort networks for real-time communication. Much effort has been spent to ensure quality of service for soft real-time traffic over IP networks. The Internet Engineering Task Force has proposed some architecture components, such as Active Queue Management (AQM). The paper investigates the influence of the weighted moving average on packet waiting time reduction for an AQM mechanism: the RED algorithm. The proposed method for computing the average queue length is based on a difference equation (a recursive equation). Depending on a particular optimality criterion, proper parameters of the modified weighted moving average function can be chosen. This change will allow reducing the number of violations of timing constraints and better use of this mechanism for soft real-time transmissions. The optimization problem is solved through simulations performed in OMNeT++ and later verified experimentally on a Linux implementation.

show abstract

“…The first possibility is to configure the schedulers in advance, defining a set of SCs with a different minimum bandwidth and maximum latency reservation [18]. This distribution would be made taking into account the expected use of each SC.…”

Section: Other Considerationsmentioning

confidence: 99%