Deadline-Aware Routing: Quality of Service Enhancement in Cyber-Physical Systems
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.
Abstract
Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.
참고문헌 (17)
- K.-J. Park, "Cyber-physical systems: Milestones and research challenges", Elsevier Computer Communications, 36(1), pp.1~7 (2012)[DOI]
- L. G. Bushnell, "Networks and control", IEEE Control Systems Magazine, 21(1), pp.22~23 (2001)[DOI]
- D. Medhi, "Network routing: algorithms, protocols, and architectures" (2010), Morgan Kaufmann
- H. Li, "Minimizing end-to-end delay: A novel routing metric for multi-radio wireless mesh networks", Proceedings of INFOCOM, pp.46~54 (2009)
- R. Bellman, "On a routing problem", Quarterly of applied mathematics, 16(1), pp.87~90 (1958)[DOI]
- E. W. Dijkstra, "A note on two problems in connexion with graphs", Numerische mathematik, 1(1), pp.269~271 (1959)[DOI]
- A. Malik, "QoS in IEEE 802.11-based wireless networks: A comtemporary review", Journal of Network and Computer Applications, 55, pp.24~46 (2015)[DOI]
- K.-J. Park, "Robust path diversity for network quality of service in cyber-physical systems", IEEE Transactions on Industrial Informatics, 10(4), pp.2204~2215 (2014)[DOI]
- A. Alanazi, "Real-time QoS routing protocols in wireless multimedia sensor networks: Study and analysis", Sensors, 15(9), pp.22209~22233 (2015)[DOI]
- X. M. Zhang, "Interference-based topology control algorithm for delay- constrained mobile ad hoc networks", IEEE Transactions on Mobile Computing, 14(4), pp.742~754 (2015)[DOI]
- S. Lim, "Stochastic motion planning and applications to traffic", The International Journal of Robotics Research, 30(6), pp.699~712 (2011)[DOI]
- E. Nikolova, "Stochastic shortest paths via quasi-convex maximization", European Symposium on Algorithms, pp.552~563 (2006)
- E. Nikolova, "Optimal route planning under uncertainty", ICAPS, 6, pp.131~141 (2006)
- K. Papagiannaki, "Measurement and analysis of single-hop delay on an IP backbone network", IEEE Journal on Selected Areas in Communications, 21(6), pp.908~921 (2003)[DOI]
- A. Di Pietro, "End-to-end inference of link level queueing delay distribution and variance", Proceedings of IEEE International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS), pp.503~510 (2008)
- P. Fransson, "End-to-end measurements on performance penalties of IPv4 options", Proceedings of Global Telecommunications Conference (GLOBECOM), 3, pp.1441~1447 (2004)
- "MATLAB version 8.1.0.604 (R2013a)", The Mathworks, Inc., ~ (2013)