On the ability of establishing real-time channels in point-to-point packet-switched networks

Qin, Zheng; Shin, Kang G.

doi:10.1109/tcomm.1994.580218

Cited by 149 publications

(83 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some scheduling protocols (e.g., [4,18] among others) guarantee to each flow f a per-hop delay of δ.f, chosen by the source of f, rather than the usual per-hop delay of L.f max /R.f. This is accomplished by enhancing the algorithm to compute packet timestamps to take into consideration the δ.f per-hop delay, and accepting a new flow only if it passes a schedulability condition.…”

Section: Discussionmentioning

confidence: 99%

Preserving quality of service guarantees in spite of flow aggregation

Cobb¹

Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256)

View full text Add to dashboard Cite

We investigate the preservation of quality of service guarantees to a flow of packets in the presence of flow aggregation. In flow aggregation, multiple flows, known as the constituent flows, are merged together resulting in a single aggregate flow. Packet schedulers located after the network point where the aggregation occurred are aware of the aggregate flow, but are unaware of its constituent flows. In spite of this, we show that quality of service may still be guaranteed to the constituent flows if the aggregation is performed fairly. Furthermore, contrary to intuition, the quality of service guaranteed to a flow may be greater under flow aggregation than in the case where no aggregation is performed.

show abstract

Section: Discussionmentioning

confidence: 99%

Preserving quality of service guarantees in spite of flow aggregation

Cobb¹

Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256)

View full text Add to dashboard Cite

show abstract

“…If the set of "jobs" are schedulable with deadlines τ i max , and release times greater than γ i min for every i ∈ {1, · · · , ℓ}, then the completion of the job i is guaranteed before τ i max . Hence the corresponding sampling-delay sequence satisfies (26) and consequently stability of all subsystems connected to the network is guaranteed.…”

Section: Wireless Ncs Qosmentioning

confidence: 96%

Implementation Considerations For Wireless Networked Control Systems

Naghshtabrizi

Hespanha²

2010

Wireless Networking Based Control

View full text Add to dashboard Cite

We show that delay impulsive systems are a natural framework to model wired and wireless NCSs with variable sampling intervals and delays as well as packet dropouts. Then, we employ discontinuous Lyapunov functionals to characterize admissible sampling intervals and delays such that exponential stability of NCS is guaranteed. These results allow us to determine requirements needed to establish exponential stability, which is the most basic Quality of Performance (QoP) required by the application layer. Then we focus on the question of whether or not the Quality of Service (QoS) provided by the wireless network suffices to fulfil the required QoP. To answer this question we employ results from real-time scheduling and provide a set of conditions under which the desired QoP can be achieved.

show abstract

“…When agreeing to receive traffic at a certain packet rate [22], [26], as is the case in this design with RT channels, flow control is redundant, and as long as the traffic is complying with the real-time scheduling analysis (explained later in the paper), it is guaranteed that no congestion will occur. Although assuming a bidirectional channel, the analysis is implemented in one direction at a time, taking into consideration the asymmetric characteristic of the wireless channel.…”

Section: Protocol Definition and Timing Analysismentioning

confidence: 99%