The QoSbox: Quantitative service differentiation in BSD routers

Christin, Nicolas; Liebeherr, Jörg

doi:10.1016/j.comnet.2006.01.002

Cited by 3 publications

(3 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When arranged in non increasing order of their component values, these are the distinct vectors [4,3,0], [3,2,2], [7,0,0], [5,2,0], [4,2,1]. The lexicographically smallest of these vectors is [3,2,2] corresponding to the most balanced distribution of the component values.…”

Section: System Modelmentioning

confidence: 98%

“…Iteratively applying bipartite matching suggested by them prevents reassignment in the future, so fairness is no longer guaranteed. Other mechanisms such as QoSBox [7], and Diffservs [5] achieve service differentiation by packet dropping, traffic shaping and reordering. Most of these techniques cannot be adapted to work in storage systems [26].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Lexicographic QoS scheduling for parallel I/O

Gulati

Varman

2005

Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

High-end shared storage systems serving multiple independent workloads must assure that concurrently executing clients will receive a fair or agreed-upon share of system I/O resources. In a parallel I/O system an application makes requests for specific disks at different steps of its computation depending on the data layout and its computational state. Different applications contend for disk access making the problem of maintaining fair allocation challenging.We propose a model for differentiated disk bandwidth allocation based on lexicographic minimization, and provide new efficient scheduling algorithms to allocate the I/O bandwidth fairly among contending applications. A major contribution of our model is its ability to handle multiple parallel disks and contention for disks among the concurrent applications. Analysis and simulation-based evaluation shows that our algorithms provide performance isolation, weighted allocation of resources, and are work conserving. The solutions are also applicable to other shared resource environments dealing with non-uniform heterogeneous servers.

show abstract

Section: System Modelmentioning

confidence: 98%

Section: Related Workmentioning

confidence: 99%

Lexicographic QoS scheduling for parallel I/O

Gulati

Varman

2005

Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

show abstract

“…Several projects aim at building QoS-enabled switches or routers from scratch [5,9]. In [24] Chiueh and Varadarajan present EtheReal, a switch that allows connection establishment with policing.…”

Section: Related Workmentioning

confidence: 99%

Low-latency hard real-time communication over switched ethernet

Loeser

Haertig

Proceedings. 16th Euromicro Conference on Real-Time Systems, 2004. ECRTS 2004.

View full text Add to dashboard Cite

MotivationEthernet as de£ned in the IEEE 802.3 standard is the commodity network since decades, and has undergone a number of changes in its existence. It is used for hard realtime communication already, and demanding applications continue to emerge. A typical example is factory automation, where Ethernet replaces CAN for performance and cost reasons. In the context of professional audio mastering (audio-LAN) Ethernet is experimented with: multiple nodes generate samples for hundreds of instruments in parallel and send them to a central mixer node. The process is interactively controlled and delays are expected to be less than 10ms. The bandwidth requirement for such a scenario is ten to hundred megabytes a second. Another application from the audio domain is DMIDI [30], an attempt to use Ethernet LANs for MIDI control commands. Although the bandwidth demands are moderate, the delays are expected to be a few milliseconds too.CSMA/CD Ethernet Real-time approaches using the original bus-based Ethernet basically fall in three categories: token-based medium access control protocols, time slot-based protocols and statistical approaches. Time slots and token passing techniques are used by cooperating nodes for both: to avoid collisions and to obey the limit of bandwidth allocated to the participating nodes. Intuition indicates that the use of such techniques to avoid collisions limits the achievable utilization and increases the CPU load of the nodes much more than using more relaxed forms of cooperation that only control bandwidth allocation. Related research supports our intuition on the high cost for collision avoidance by node cooperation (see Section 5).Switched Ethernet is a star-based topology providing a private collision domain to each of the ports of a switch. Collisions do not occur, thus node cooperation is needed only for bandwidth control, not any more to avoid collisions. It was our starting assumption that with £ne grained traf£c shaping as only means of node cooperation, we should be able to achieve lower guaranteed delays and higher bandwidth utilization than time-slotted and tokenpassing approaches, even though Switched Ethernet does not support policing in the switches as for example in ATM switches.Although we heard rumors on the usage of Switched Ethernet in hard real-time applications that do not rely on pure time-driven technology (as for example in MARS [12]), we are not aware of any practical analysis.In this paper, we make an attempt to close that gap and to validate our assumption as stated previously. We show how commodity Switched Ethernet technology can be used for low-latency hard real-time communication, provided the right operating system support is available: In Section 2 we £rst adapt well-established scheduling theory to our needs. In Section 3 we show how the needed traf£c shaping can be practically done using the Dresden real-time operating system (DROPS) as a basis for experimentation. In Section 4 we present detailed measurements. Section 5 surveys other work in the area of rea...

show abstract