Exact and efficient analysis of schedulability in fixed-packet networks: a generic approach

Gorinsky, Sergey; Baruah, Sanjoy; Marlowe, Thomas J.; Stoyenko, Alexander D.

doi:10.1109/infcom.1997.644509

Cited by 8 publications

(7 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To provide the flexible but assured differentiation at the flow granularity, the best IntServ designs employ such complicated link scheduling algorithms as WFQ (Weighted Fair Queuing) [9], WF 2 Q (Worst-case Fair Weighted Fair Queueing) [2], Start-time Fair Queueing (SFQ) [20], Virtual Clock (VC) [40], or Earliest Deadline First (EDF) [10] and restrict network access with distributed admission control [17,28]. In contrast, RD routers maintain only two FIFO queues per output link and schedule the link capacity with the simple algorithm which is easy to implement even at high bitrates.…”

Section: Related Workmentioning

confidence: 99%

Rd network services

Podlesny

Gorinsky

2008

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

With the Internet offering a single best-effort service, there have been numerous proposals of diversified network services that align better with the divergent needs of different distributed applications. The failure of these innovative architectures to gain wide deployment is primarily due to economic and legacy issues, rather than technical shortcomings. We propose a new paradigm for network service differentiation where design principles account explicitly for the multiplicity of Internet service providers and users as well as their economic interests in environments with partly deployed new services. Our key idea is to base the service differentiation on performance itself, rather than price. The proposed RD (Rate-Delay) services enable a user to choose between a higher transmission rate or low queuing delay at a congested network link. An RD router supports the two services by maintaining two queues per output link and achieves the intended rate-delay differentiation through simple link scheduling and dynamic buffer sizing. After analytically deriving specific rules for RD router operation, we conduct extensive simulations that confirm effectiveness of the RD services geared for incremental deployment in the Internet.

show abstract

Section: Related Workmentioning

confidence: 99%

Rd network services

Podlesny

Gorinsky

2008

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

show abstract

“…This sections discusses some of them related to our own. The approach of Gorinsky et al (1997) develops schedulability tests for traffic flow in multimedia network applications. Like in the work presented here the Processor Demand Analysis is used to determine the schedulability of a task set.…”

Section: Related Workmentioning

confidence: 99%

Scalable Online Feasibility Tests for Admission Control in a Java Real-Time System

Brinkschulte¹

2006

Real-Time Syst

View full text Add to dashboard Cite

In the Komodo project a real-time Java system based on a multithreaded Java microcontroller has been developed. A main scheduling policy realized by hardware in the microcontroller core is a new scheme called Guaranteed Percentage (GP) scheduling. This scheme assigns each thread a guaranteed percentage of the processor power thus providing a strict isolation of the threads on the processor.To prevent processor overload in the dynamic Java environment, fast online feasibility tests are necessary before a new thread is allowed to enter the microcontroller. Starting with the well known Processor Demand Analysis, a new test based on the periodic transformation of the processor workload is developed. This is a sufficient (but not necessary) scalable test, where the number of feasible thread sets found can be controlled by the costs. Furthermore, this test can be stopped, if a given cost or time limit is reached. We additionally propose a modified version of this test, which further reduces the costs and allows an online hardware feasibility test with a polynomial complexity of O(n(n + 1)/2). An evaluation shows, that the tests proposed here are able to find more than 90% of the feasible thread sets and all non-feasible thread sets with costs suitable for online testing.

show abstract

“…At the same time, making the traffic conform to a dual leaky bucket specification can be beneficial. According to (4) and (5), the end-to-end delay bound reaches its minimal value d,,, = 80 ms when p' = 10 F. In other words, changing the connection specification from (100 KB, 3 F) to (0, 10 y, 3 F , 80 ms) reduces the minimumendto-end delay bound almost thrice (see Figure 3 ) . Now, consider a network where all connections are characterized by the dual leaky bucket model.…”

Section: K € S " Kmentioning

confidence: 93%

“…According to [4], the minimumdelay bound that can be guaranteed over link k without reshaping is equal to: Then the end-to-end delay for connection C without reshaping is bounded by:…”

Section: K € S " Kmentioning

confidence: 99%

See 1 more Smart Citation

Boosting the network performance via traffic reshaping

Gorinsky

Baruah

Stoyen

Proceedings of Sixth International Conference on Computer Communications and Networks

Self Cite

View full text Add to dashboard Cite

Trafic reshaping and its impact on providing deterministic guarantees of timely data delivery in a packetswitched virtual-circuit fixed-packet network are investigated. Two types of trafic smoothing are considered: global reshaping (when trafic on all network connections is smoothed) and local reshaping (when the trafic specification is changed only f o r a single connection). The conditions when reshaping is beneficial are derived and the optimal values of trafic model parameters are obtained. In particular, it is shown that, when one tries to minimize end-to-end delay bounds f o r leaky bucket constrained trafic, the trafic either should be made Constant Bit Rate ( C B R ) or should not be reshaped at all. It is proven that changing the leaky bucket specification to the dual leaky bucket specification is always able to yield better timeliness guarantees and utilization of network resources. Finally, local reshaping for the dual leaky bucket model is studied.

show abstract

Exact and efficient analysis of schedulability in fixed-packet networks: a generic approach

Cited by 8 publications

References 17 publications

Rd network services

Rd network services

Scalable Online Feasibility Tests for Admission Control in a Java Real-Time System

Boosting the network performance via traffic reshaping

Contact Info

Product

Resources

About