Pay bursts only once holds for (some) non-FIFO systems.
Non-FIFO processing of flows by network nodes is not a rare phenomenon. Unfortunately, the state-of-the-art analytical tool for the computation of performance bounds in packet-switched networks, network calculus, cannot deal well with non-FIFO systems. The problem lies in its conventional service cu...
| প্রধান লেখক: | , , , |
|---|---|
| বিন্যাস: | Conference item |
| প্রকাশিত: |
IEEE
2011
|
Search Result 1
Search Result 2
