Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

Bounded delay scheduling with packet dependencies

Published: 15 January 2022 Publication History

Abstract

A common situation occurring when dealing with multimedia traffic is having large data frames fragmented into smaller IP packets, and having these packets sent independently through the network. For real-time multimedia traffic, dropping even few packets of a frame may render the entire frame useless. Such traffic is usually modeled as having inter-packet dependencies. We study the problem of scheduling traffic with such dependencies, where each packet has a deadline by which it should arrive at its destination. Such deadlines are common for real-time multimedia applications, and are derived from stringent delay constraints posed by the application. The figure of merit in such environments is maximizing the system’s goodput, namely, the number of frames successfully delivered.
We study online algorithms for the problem of maximizing goodput of delay-bounded traffic with inter-packet dependencies, and use competitive analysis to evaluate their performance. We present competitive algorithms for the problem, as well as matching lower bounds that are tight up to a constant factor. We further present the results of a simulation study which further validates our algorithmic approach and shows that insights arising from our analysis are indeed manifested in practice.

References

[1]
Cisco, Cisco visual networking index: Forecast and trends, 2017–2022, 2019, Online, https://www.cisco.com/c/en/us/solutions/service-provider/visual-networking-index-vni/index.html.
[2]
J.M. Boyce, R.D. Gaglianello, Packet loss effects on MPEG video sent over the public internet, in: Proceedings of the 6th ACM International Conference on Multimedia, 1998, pp. 181–190.
[3]
Albanese A., Blömer J., Edmonds J., Luby M., Sudan M., Priority encoding transmission, IEEE Trans. Inform. Theory 42 (6) (1996) 1737–1744.
[4]
Kurose J.F., Ross K.W., Computer Networking: A Top-Down Approach, Addison-Wesley, 2011.
[5]
Kesselman A., Lotker Z., Mansour Y., Patt-Shamir B., Schieber B., Sviridenko M., Buffer overflow management in QoS switches, SIAM J. Comput. 33 (3) (2004) 563–583.
[6]
Sleator D.D., Tarjan R.E., Amortized efficiency of list update and paging rules, Commun. ACM 28 (2) (1985) 202–208.
[7]
Borodin A., El-Yaniv R., Online Computation and Competitive Analysis, Cambridge University Press, 1998.
[8]
M. Markovitch, G. Scalosub, Bounded delay scheduling with packet dependncies, in: Proceedings of the IEEE INFOCOM Workshop on Communication and Networking Techniques for Contemporary Video, 2014, pp. 257–262.
[9]
Ramanathan S., Rangan P.V., Vin H.M., Kumar S.S., Enforcing application-level QoS by frame-induced packet discarding in video communications, Comput. Commun. 18 (10) (1995) 742–754.
[10]
A. Awad, M.W. McKinnon, R. Sivakumar, Goodput estimation for an access node buffer carrying correlated video traffic, in: Proceedings of the 7th IEEE Symposium on Computers and Communications, ISCC, 2002, pp. 120–125.
[11]
Gürses E., Akar G.B., Akar N., A simple and effective mechanism for stored video streaming with TCP transport and server-side adaptive frame discard, Comput. Netw. 48 (4) (2005) 489–501.
[12]
Goldwasser M.H., A survey of buffer management policies for packet switches, ACM SIGACT News 41 (1) (2010) 100–128.
[13]
Kesselman A., Patt-Shamir B., Scalosub G., Competitive buffer management with packet dependencies, Theoret. Comput. Sci. 489–490 (2013) 75–87.
[14]
Emek Y., Halldórsson M.M., Mansour Y., Patt-Shamir B., Radhakrishnan J., Rawitz D., Online set packing, SIAM J. Comput. 41 (4) (2012) 728–746.
[15]
Mansour Y., Patt-Shamir B., Rawitz D., Overflow management with multipart packets, Comput. Netw. 56 (15) (2012) 3456–3467.
[16]
Scalosub G., Marbach P., Liebeherr J., Buffer management for aggregated streaming data with packet dependencies, IEEE Trans. Parallel Distrib. Syst. 24 (3) (2013) 439–449.
[17]
Mansour Y., Patt-Shamir B., Rawitz D., Competitive router scheduling with structured data, Theoret. Comput. Sci. 530 (2014) 12–22.
[18]
Kawahara J., Kobayashi K.M., Optimal buffer management for 2-frame throughput maximization, Comput. Netw. 91 (2015) 804–820.
[19]
J. Wu, H. Ni, X. Zeng, X. Ye, Goodput guaranteed buffer management strategy for streaming data with packet dependencies, in: Proceedings of the 21st IEEE Symposium on Computers and Communication, ISCC, 2016, pp. 880–885.
[20]
Kawahara J., Kobayashi K.M., Miyazaki S., Better bounds for online k-frame throughput maximization in network switches, Theoret. Comput. Sci. 657 (2017) 173–190.
[21]
Scalosub G., Towards optimal buffer management for streams with packet dependencies, Comput. Netw. 129 (2017) 207–214.
[22]
Silberschatz A., Galvin P.B., Gagne G., Operating System Concepts, John Wiley & Sons, 2012.
[23]
Pinedo M.L., Scheduling: Theory, Algorithms, and Systems, Springer, 2012.
[24]
Englert M., Westermann M., Considering suppressed packets improves buffer management in quality of service switches, SIAM J. Comput. 41 (5) (2012) 1166–1192.
[25]
Jez L., Li F., Sethuraman J., Stein C., Online scheduling of packets with agreeable deadlines, ACM Trans. Algorithms 9 (1) (2012).
[26]
Li F., Scheduling packets with values and deadlines in size-bounded buffers, J. Comb. Optim. 25 (2) (2013) 165–175.
[27]
Böhm M., Chrobak M., Jez L., Li F., Sgall J., Veselý P., Online packet scheduling with bounded delay and lookahead, Theoret. Comput. Sci. 776 (2019) 95–113.
[28]
Veselý P., Packet scheduling: Plans, monotonicity, and the golden ratio, SIGACT News 52 (2) (2021) 72–84.
[29]
Davydow A., Chuprikov P., Nikolenko S.I., Kogan K., Competitive buffer management for packets with latency constraints, Comput. Netw. 189 (2021).
[30]
Jez L., Mansour Y., Patt-Shamir B., Scheduling multipacket frames with frame deadlines, J. Sched. 20 (6) (2017) 623–634.
[31]
Kogan K., Menikkumbura D., Petri G., Noh Y., Nikolenko S.I., Sirotkin A., Eugster P., Towards software-defined buffer management, IEEE/ACM Trans. Netw. 28 (5) (2020) 2337–2349.
[32]
Chuprikov P., Nikolenko S.I., Kogan K., Towards declarative self-adapting buffer management, Comput. Commun. Rev. 50 (3) (2020) 30–37.

Index Terms

  1. Bounded delay scheduling with packet dependencies
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image Computer Communications
    Computer Communications  Volume 182, Issue C
    Jan 2022
    269 pages

    Publisher

    Elsevier Science Publishers B. V.

    Netherlands

    Publication History

    Published: 15 January 2022

    Author Tags

    1. Queue management
    2. Buffer management
    3. Scheduling
    4. Packet dependencies
    5. Deadlines
    6. Delay-aware
    7. Online algorithms
    8. Quality of service
    9. Competitive analysis

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 0
      Total Downloads
    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 10 Nov 2024

    Other Metrics

    Citations

    View Options

    View options

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media