Curbing Aggregate Member Flow Burstiness to Bound End-to-End Delay in Networks of TDMA Crossbar Real-Time Switches

Nowadays supporting quality of service (QOS) for real time application is the main challenge of the wireless area network. 802.11standards use distributed Coordination Function (DCF) protocol and Enhanced Distributed Channel Access (EDCA) protocol in the MAC layer. DCF protocol has only one queue for different data types, it deals with data depending on the arriving time. There is no priority to serve real time applications faster. However EDCA protocol has four queues and each queue works with specific data type. Voice, video, best effort and background are the different queues in the EDCA protocol. Different parameters and priorities are defined for each queue. The voice queue reserves the highest priority and serves its data first. In this paper QOS parameters are measured for both DCF and EDCA protocol by using OPNET simulation. The QOS parameters must reach the requirements to support QOS. The results show how QOS parameters do not reach the requirements when using DCF protocol. The values of the end to end delay and the packet loss percentage are 0.514second, 19.04% respectively. But, when using EDCA protocol the end to end delay becomes 0.0624 second and the percentage of the packet loss decreases until reach 0.00617%. So the QOS parameters achieve requirements with EDCA protocol and support QOS.

Download Full-text

Real-time packet loss prediction based on end-to-end delay variation

IEEE Transactions on Network and Service Management ◽

10.1109/tnsm.2005.4798299 ◽

2005 ◽

Vol 2 (1) ◽

pp. 29-38 ◽

Cited By ~ 25

Author(s):

Lopamudra Roychoudhuri ◽

Ehab S. Al-Shaer

Keyword(s):

Real Time ◽

Packet Loss ◽

End To End Delay ◽

Loss Prediction ◽

End To End ◽

Delay Variation

Download Full-text

Real-Time Communications in Large-Scale Wireless Networks

International Journal of Digital Multimedia Broadcasting ◽

10.1155/2008/586067 ◽

2008 ◽

Vol 2008 ◽

pp. 1-16 ◽

Cited By ~ 4

Author(s):

Liang Song ◽

Dimitrios Hatzinakos

Keyword(s):

Wireless Networks ◽

Real Time ◽

Large Scale ◽

Visual Sensor ◽

Broadband Internet ◽

Multihop Wireless ◽

Data Packets ◽

End To End Delay ◽

End To End ◽

Qos Performance

There is an emerging need for realizing real-time quality of service (QoS) over multihop wireless communications in large-scale wireless networks. The applications can include wireless mesh infrastructure for broadband Internet access supporting multimedia services, visual sensor networks for surveillance, and disaster-relief networks. However, a number of challenges still exist as revealed by recent works, where the dataflow QoS performance such as throughput and end-to-end delay can degrade fast with the number of wireless hops. We propose to use large-scale cognitive networking methods to resolve the wireless multihop challenges. By the cognitive-networking concept, data packets travel along opportunistically available paths in the network with opportunistically available spectrum in every hop. Reliable end-to-end communications can be achieved for real-time services, where we show that (1) dataflow throughput can be independent of any number of wireless hops, (2) end-to-end delay and delay variance increase linearly with the number of wireless hops, and (3) delay variance decreases to zero with higher network density. These results are supported by analysis, simulations, and experiments.

Download Full-text

The Research on End-to-End Delay Calculation Method for Real-Time Network AFDX

2009 International Conference on Computational Intelligence and Software Engineering ◽

10.1109/cise.2009.5363642 ◽

2009 ◽

Cited By ~ 3

Author(s):

Xingxing Zeng ◽

Dong Song

Keyword(s):

Real Time ◽

Calculation Method ◽

End To End Delay ◽

End To End

Download Full-text

R-TOD: Real-Time Object Detector with Minimized End-to-End Delay for Autonomous Driving

2020 IEEE Real-Time Systems Symposium (RTSS) ◽

10.1109/rtss49844.2020.00027 ◽

2020 ◽

Author(s):

Wonseok Jang ◽

Hansaem Jeong ◽

Kyungtae Kang ◽

Nikil Dutt ◽

Jong-Chan Kim

Keyword(s):

Real Time ◽

Autonomous Driving ◽

End To End Delay ◽

End To End

Download Full-text

Bounding End-to-End Delay for Real-Time Environmental Monitoring in Avionic Systems

2013 27th International Conference on Advanced Information Networking and Applications Workshops ◽

10.1109/waina.2013.96 ◽

2013 ◽

Cited By ~ 2

Author(s):

Daeha Jin ◽

Junhee Ryu ◽

Juyoung Park ◽

Jaemyoun Lee ◽

Heonshik Shin ◽

...

Keyword(s):

Environmental Monitoring ◽

Real Time ◽

End To End Delay ◽

End To End

Download Full-text

End-to-end delay analysis for real-time networks

Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420) ◽

10.1109/real.2001.990628 ◽

2005 ◽

Cited By ~ 1

Author(s):

Shu-Ngai Yeung ◽

J. Lehoczky

Keyword(s):

Real Time ◽

Delay Analysis ◽

End To End Delay ◽

End To End

Download Full-text

Cooperative and Non-Cooperative Frameworks with Utility Function Design for Intermediate Deadline Assignment in Real-Time Distributed Systems

Mathematics ◽

10.3390/math8091579 ◽

2020 ◽

Vol 8 (9) ◽

pp. 1579

Author(s):

Jinkyu Lee

Keyword(s):

Distributed Systems ◽

Real Time ◽

Distributed System ◽

Utility Functions ◽

Trade Off ◽

End To End Delay ◽

Distributed Framework ◽

Function Design ◽

End To End ◽

And Performance

In real-time distributed systems, it is important to provide offline guarantee for an upper-bound of each real-time task’s end-to-end delay, which has been achieved by assigning proper intermediate deadlines of individual real-time tasks at each node. Although existing studies have succeeded to utilize mathematical theories of distributed computation/control for intermediate deadline assignment, they have assumed that every task operates in a cooperative manner, which does not always hold for real-worlds. In addition, existing studies have not addressed how to exploit a trade-off between end-to-end delay fairness among real-time tasks and performance for minimizing aggregate end-to-end delays. In this paper, we recapitulate an existing cooperative distributed framework, and propose a non-cooperate distributed framework that can operate even with selfish tasks, each of which is only interested in minimizing its own end-to-end delay regardless of achieving the system goal. We then propose how to design utility functions that allow the real-time distributed system to exploit the trade-off. Finally, we demonstrate the validity of the cooperative and non-cooperative frameworks along with the designed utility functions, via simulations.

Download Full-text