Advertisement

Modified Packet Scheduling Algorithm for Real-Time Service

  • Ha-Sung Koo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6935)

Abstract

In this paper analyzes various scheduling algorithms applied to multi-media streaming system for providing real-time service in Internet and proposed a scheduling algorithm that can meet the QoS requirements of delay-sensitive traffic and loss-sensitive traffic for specific services. First, the concept of QoS drafted from the recommendation of ITU-T is defined and the requirements for packet multiplexer in Internet are examined. Then the scheduling algorithm to satisfy various QoS based on functional architecture of packet multiplexer for streaming system bound to real-time service and QoS levels of input source traffic is designed. Finally, the performance of the algorithm is evaluated thru experiments that measure the packet loss and average delay time of the proposed algorithm.

Keywords

Packet Scheduling Algorithm QoS Multiplexer Real-time service Multi-media streaming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Braden, R., Clack, D., Shenker, S.: Integrated Service in the internet Architecture: an Overview. RFC 1633 (June 1994)Google Scholar
  2. 2.
    Write, P.P.: RSVP and Integrated Services in the internet: A Tutorial. IEEE Communications Magazine, 100–106 (May 1997)Google Scholar
  3. 3.
    Chen, W.T., Huang, C.F., Ding, S.C.: A Scheme for QoS Control in ATM Switching Systems. J. of High Speed Networks, 221–236 (June 1997)Google Scholar
  4. 4.
    Lin, A.Y.M., Silvester, J.A.: Priority Queueing Strategies and Buffer Allocation Protocols for Traffic Control at an ATM Integrated Broad-band Switching System. IEEE J. on Sel. Area in Comm. 9(9), 1524–1536 (1991)CrossRefGoogle Scholar
  5. 5.
    Li, L., Hu, C., Liu, P.: Maximum Throughput of an Input Queueing Packet Switch with Two Priority Classes. IEEE Trans. on Comm. 42(12), 3095–3097 (1994)CrossRefGoogle Scholar
  6. 6.
    Ross, K.W., Biersack, E.: Topology Centric Lookup Service. In: 5th Int. Workshop Network Group Communications, NGC (2003)Google Scholar
  7. 7.
    Takine, T., Sengupta, B., Hasegawa, T.: An Analysis of a Discrete-Time Queue for Broadband ISDN with Priorities among Trafic Classes. IEEE Trans. on Comm. 42(2), 1837–1845 (1994)CrossRefGoogle Scholar
  8. 8.
    Stavrakakis, I.: Delay Bounds on a Queueing System with Consistent Priorities. IEEE Trans. on Comm. 42(2/3/4), 615–624 (1994)CrossRefGoogle Scholar
  9. 9.
  10. 10.
    Kurose, J.F., Ross, K.W.: Computer Networking. Addison Wesley, Reading (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ha-Sung Koo
    • 1
  1. 1.Department of Computer and InformationHanseo UniversitySeosan-siSouth Korea

Personalised recommendations