End-to-end delay bound analysis of VANETs based on stochastic method via queueing theory model

This paper describes a framework application for the control plane of a network infrastructure; the objective is to feature end-user applications with the capability of requesting at any time a customised end-to-end Quality-of-Service profile in the context of dynamic Service-Level-Agreements. Our solution targets current and future real-time applications that require tight QoS parameters, such as a guaranteed end-to-end delay bound. These applications include, but are not limited to, health-care, mobility, education, manufacturing, smart grids, gaming and much more. We discuss the issues related to the previous Integrated Service and the reason why the RSVP protocol for guaranteed QoS did not take off. Then we present a new signaling and resource reservation framework based on the cutting-edge network controller ONOS. Moreover, the presented system foresees the need of considering the edges of the network, where terminal applications are connected to, to be piloted by distinct logically centralised controllers. We discuss a possible inter-domain communication mechanism to achieve the end-to-end QoS guarantee.

Download Full-text

An End-to-End Delay Bound Based on Stochastic Network Calculus in Wireless Mesh Network

Lecture Notes in Electrical Engineering - Future Wireless Networks and Information Systems ◽

10.1007/978-3-642-27323-0_30 ◽

2012 ◽

pp. 235-242 ◽

Cited By ~ 3

Author(s):

Gaocai Wang ◽

Nao Wang ◽

Mingxing Lai

Keyword(s):

Wireless Mesh Network ◽

Mesh Network ◽

Network Calculus ◽

Stochastic Network ◽

Delay Bound ◽

Wireless Mesh ◽

End To End Delay ◽

End To End ◽

Stochastic Network Calculus

Download Full-text

End-to-end delay bound calculation in generalized processor sharing networks

Proceedings. Sixth IEEE Symposium on Computers and Communications ◽

10.1109/iscc.2001.935388 ◽

2002 ◽

Cited By ~ 6

Author(s):

P. Barta ◽

F. Nemeth ◽

R. Szabo ◽

J. Biro

Keyword(s):

Processor Sharing ◽

Generalized Processor Sharing ◽

Delay Bound ◽

End To End Delay ◽

End To End

Download Full-text

End-to-End Delay Bound for VR Services in 6G Terahertz Networks with Heterogeneous Traffic and Different Scheduling Policies

Mathematics ◽

10.3390/math9141638 ◽

2021 ◽

Vol 9 (14) ◽

pp. 1638

Author(s):

Benedetta Picano

Keyword(s):

Network Performance ◽

Heterogeneous Traffic ◽

Actual Behavior ◽

Traffic Flows ◽

Delay Bound ◽

Scheduling Policies ◽

End To End Delay ◽

End To End ◽

Support Resource ◽

Service Constraints

The emerging sixth-generation networks have to provide effective support to a wide plethora of novel disruptive heterogeneous applications. This paper models the probabilistic end-to-end delay bound for the virtual reality services in the presence of heterogeneous traffic flows by resorting to the stochastic network calculus principles and exploiting the martingale envelopes. The paper presents the network performance analysis under the assumption of different scheduling policies, considering both the earliest deadline first and the first-in-first-out queue discipline. Furthermore, differently from previous literature, the probabilistic per-flow bounds have been formulated taking into account a number of traffic flows greater than two, which results in a theoretical analysis that is remarkably more complex than the case in which only two concurrent flows are considered. Finally, the validity of the theoretical bounds have been confirmed by the evident closeness between the analytical predictions and the actual simulation results considering, for the sake of argument, four concurrent traffic flows with heterogeneous quality-of-service constraints. That closeness exhibits the ability of the proposed analysis in fitting the actual behavior of the system, representing a suitable theoretical tool to support resource allocation strategies, without violating service constraints.

Download Full-text