The Community for Technology Leaders
RSS Icon
Issue No.09 - Sept. (2012 vol.23)
pp: 1790-1802
Yu Hua , Huazhong University of Science and Technology, Wuhan
Xue Liu , McGill University, Montreal
An avionics network demands determinism and predictability. This is especially challenging because of the relatively low bandwidth of the on-board network, and the emerging needs of heterogeneous flows due to the proliferation of avionics applications. Redundant transmission and hard real-time scheduling potentially generate many duplicate data, which makes deduplication become more difficult. Many avionic flows further exhibit dynamic workloads which may change abruptly online. Hence, besides the guarantee of transmission delay, modern avionic network design needs to flexibly handle burst flows and efficiently implement data deduplication for bandwidth saving. In order to address these challenges, we propose a DeDuplication-aware Deficit Round Robin (D2DRR)-based scheduling scheme for Avionics Full DupleX (AFDX) networks with the benefits of low complexity and easy implementation. The core idea is to judiciously offer proper “division of labor” between switches and end systems and transform the services for heterogeneous flows to a single representation of utilization, i.e., DRR quantum, which can be flexibly reconfigured. We further leverage Bloom filters to support fast deduplication in order to reduce the load on the AFDX network. D2DRR, hence, offers salient features, elastic scheduling and adept deduplication, to deliver substantial performance improvements. Through both simulations and real implementations, extensive experimental results in an AFDX testbed demonstrate the efficacy and efficiency of our proposed schemes.
Delay, Aerospace electronics, Real time systems, Reliability, Scheduling, Bandwidth, Complexity theory, scheduling analysis, Delay, Aerospace electronics, Real time systems, Reliability, Scheduling, Bandwidth, Complexity theory, data deduplication., Cyber physical systems, avionics networks
Yu Hua, Xue Liu, "Scheduling Heterogeneous Flows with Delay-Aware Deduplication for Avionics Applications", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 9, pp. 1790-1802, Sept. 2012, doi:10.1109/TPDS.2012.51
[1] H. Frazier and C. Inc, "The 802.3z Gigabit Ethernet Standard," IEEE Network, vol. 12, no. 3, pp. 6-7, May/June 1998.
[2] ARINC 664 "Aircraft Data Network, Part 7 Avionics Full Duplex Switched Ethernet (AFDX) Network," ARINC 05-005/ADN-39, 2005.
[3] H. Charara, J. Scharbarg, J. Ermont, and C. Fraboul, "Methods for Bounding End-to-End Delays on an AFDX Network," Proc. 18th Euromicro Conf. Real-Time Systems (ECRTS), 2006.
[4] F. Ridouard, J. Scharbarg, and C. Fraboul, "Probabilistic Upper Bounds for Heterogeneous Flows Using a Static Priority Queueing on an AFDX Network," Proc. IEEE Int'l Conf. Emerging Technologies and Factory Automation, pp. 1220-1227, 2008.
[5] J.-L. Scharbarg, F. Ridouard, and C. Fraboul, "A Probabilistic Analysis of End-To-End Delays on an AFDX Avionic Network," IEEE Trans. Industrial Informatics, vol. 5, no. 1, pp. 38-49, Feb. 2009.
[6] M. Shreedhar and G. Varghese, "Efficient Fair Queuing Using Deficit Round-Robin," IEEE/ACM Trans. Networking, vol. 4, no. 3, pp. 375-385, June 1996.
[7] L. Lenzini, E. Mingozzi, and G. Stea, "Tradeoffs between Low Complexity, Low Latency, and Fairness with Deficit Round-Robin Schedulers," IEEE/ACM Trans. Networking, vol. 12, no. 4, pp. 681-693, Aug. 2004.
[8] H. Chaskar and U. Madhow, "Fair Scheduling with Tunable Latency: A Round-Robin Approach," IEEE/ACM Trans. Networking, vol. 11, no. 4, pp. 592-601, Aug. 2003.
[9] B. Bloom, "Space/Time Trade-Offs in Hash Coding with Allowable Errors," Comm. ACM, vol. 13, no. 7, pp. 422-426, 1970.
[10] L. Fan, P. Cao, J. Almeida, and A. Broder, "Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol," IEEE/ACM Trans. Networking, vol. 8, no. 3, pp. 281-293, June 2000.
[11] J. Bennett and H. Zhang, "WF2Q: Worst-Case Fair Weighted Fair Queueing," Proc. INFOCOM, 1996.
[12] D. Stiliadis and A. Varma, "Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms," IEEE/ACM Trans. Networking, vol. 6, no. 5, pp. 611-624, Oct. 1998.
[13] P. Brucker, Scheduling Algorithms. Springer Verlag, 2007.
[14] M. Katevenis, S. Sidiropoulos, and C. Courcoubetis, "Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip," IEEE J. Selected Areas in Comm., vol. 9, no. 8, pp. 1265-1279, Oct. 1991.
[15] J. Wu, J. Liu, and W. Zhao, "Utilization-Bound Based Schedulability Analysis of Weighted Round Robin Schedulers," Proc. IEEE 28th Int'l Real-Time Systems Symp. (RTSS), pp. 435-446, 2007.
[16] A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters: A Survey," Internet Math., vol. 1, pp. 485-509, 2005.
[17] B. Zhu, K. Li, and H. Patterson, "Avoiding the Disk Bottleneck in the Data Domain Deduplication File System," Proc. Sixth USENIX Conf. File and Storage Technologies (FAST), 2008.
[18] M. Lillibridge, K. Eshghi, D. Bhagwat, V. Deolalikar, G. Trezise, and P. Camble, "Sparse Indexing: Large Scale, Inline Deduplication Using Sampling and Locality," Proc. Seventh Conf. File and Storage Technologies (FAST), pp. 111-123, 2009.
[19] B. Debnath, S. Sengupta, and J. Li, "ChunkStash: Speeding Up Inline Storage Deduplication Using Flash Memory," Proc. USENIX Ann. Technical Conf., 2010.
[20] W. Xia, H. Jiang, D. Feng, and Y. Hua, "SiLo: A Similarity-Locality Based Near-Exact Deduplication Scheme with Low RAM Overhead and High Throughput," Proc. USENIX Ann. Technical Conf., 2011.
[21] W. Dong, F. Douglis, K. Li, H. Patterson, S. Reddy, and P. Shilane, "Tradeoffs in Scalable Data Routing for Deduplication Clusters," Proc. Ninth USENIX Conf. File and Storage Technologies (FAST), 2011.
[22] Y. Jenq, "Performance Analysis of a Packet Switch Based on Single-Buffered Banyan Network," IEEE J. Selected Areas in Comm., vol. 1, no. 6, pp. 1014-1021, Dec. 1983.
[23] D. Stiliadis and A. Varma, "Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms," IEEE/ACM Trans. Networking, vol. 6, no. 5, pp. 611-624, Oct. 1998.
[24] R. Cruz, "A Calculus for Network Delay. I. Network Elements in Isolation," IEEE Trans. Information Theory, vol. 37, no. 1, pp. 114-131, Jan. 1991.
[25] M. Boyer and C. Fraboul, "Tightening End to End Delay Upper Bound for AFDX Network Calculus with Rate Latency FIFO Servers Using Network Calculus," Proc. IEEE Int'l Workshop Factory Comm. Systems, pp. 11-20, 2008.
[26] L. Rizzo, "Dummynet: A Simple Approach to the Evaluation of Network Protocols," ACM SIGCOMM, vol. 27, no. 1, pp. 31-41, 1997.
[27] A. Vahdat, K. Yocum, K. Walsh, P. Mahadevan, D. Kostić, J. Chase, and D. Becker, "Scalability and Accuracy in a Large-Scale Network Emulator," Proc. Fifth Symp. Operating Systems Design and Implementation (OSDI), pp. 271-284, 2002.
[28] S. Dharmapurikar, P. Krishnamurthy, and D. Taylor, "Longest Prefix Matching Using Bloom Filters," Proc. SIGCOMM, pp. 201-212, 2003.
[29] Y. Zhu, H. Jiang, and J. Wang, "Hierarchical Bloom Filter Arrays (HBA): A Novel, Scalable Metadata Management System for Large Cluster-Based Storage," Proc. IEEE Int'l Conf. Cluster Computing, pp. 165-174, 2004.
[30] Y. Hua, Y. Zhu, H. Jiang, D. Feng, and L. Tian, "Scalable and Adaptive Metadata Management in Ultra Large-Scale File Systems," Proc. 28th Int'l Conf. Distributed Computing Systems (ICDCS), 2008.
[31] F. Deng and D. Rafiei, "Approximately Detecting Duplicates for Streaming Data Using Stable Bloom Filters," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 25-36, 2006.
[32] F. Bonomi, M. Mitzenmacher, R. Panigrah, S. Singh, and G. Varghese, "Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines," Proc. SIGCOMM, pp. 315-326, 2006.
[33] M. Bramson, "Instability of FIFO Queueing Networks with Quick Service Times," The Annals of Applied Probability, vol. 4, pp. 693-718, 1994.
[34] C. Liu and J. Layland, "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment," J. ACM, vol. 20, no. 1, pp. 46-61, 1973.
[35] F. Ridouard, J. Scharbarg, and C. Fraboul, "Stochastic Network Calculus for End-to-End Delays Distribution Evaluation on an Avionics Switched Ethernet," Proc. IEEE Fifth Int'l Conf. Industrial Informatics, 2007.
[36] Y. Jiang, "A Basic Stochastic Network Calculus," Proc. SIGCOMM, 2006.
[37] M. Anand, S. Vestal, S. Dajani-Brown, and I. Lee, "Formal Modeling and Analysis of the AFDX Frame Management Design," Proc. IEEE Int'l Symp. Object and Component-Oriented Real-Time Distributed Computing, 2006.
[38] A. Mifdaoui, F. Frances, and C. Fraboul, "Full Duplex Switched Ethernet for Next Generation "1553B"-Based Applications," Proc. IEEE 13th Real Time and Embedded Technology and Applications Symp. (RTAS), 2007.
[39] N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings, "Applying New Scheduling Theory to Static Priority Pre-Emptive Scheduling," J. Software Eng., vol. 8, pp. 284-292, 1993.
[40] H. Zhang and D. Ferrari, "Rate-Controlled Static-Priority Queueing," Proc. INFOCOM, pp. 227-236, 1993.
[41] A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queueing Algorithm," Proc. Applications, Technologies, Architectures, and Protocols for Computer Comm., pp. 1-12, 1989.
[42] J. Wu, J. Liu, and W. Zhao, "On Schedulability Bounds of Static Priority Schedulers," Proc. IEEE 11th Real Time and Embedded Technology and Applications Symp. (RTAS), pp. 529-540, 2005.
[43] X. Liu and T. Abdelzaher, "On Non-Utilization Bounds for Arbitrary Fixed Priority Policies," Proc. IEEE 12th Real-Time and Embedded Technology and Applications Symp. (RTAS), pp. 167-178, 2006.
[44] X. Liu and T. Abdelzaher, "Non-Utilization Bounds and Feasible Regions for Arbitrary Fixed-Priority Policies," J. ACM Trans. Embedded Computing Systems, vol. 10, 2010.
[45] Y. Hua and X. Liu, "Scheduling Design and Analysis for End-to-End Heterogeneous Flows in an Avionics Network," Proc. INFOCOM, 2011.
68 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool