Periodic Packet Discard Policy for Frame Based Scheduler 


Vol. 38,  No. 2, pp. 97-104, Feb.  2013


PDF
  Abstract

This paper introduces waiting time based periodic packet discard policy for frame based scheduler. This policy can be used with conventional packet discard policy or buffer management schemes, such as drop-tail or random early detection. Proposed discard policy discards packets, which are stayed in the buffer longer than threshold, at every period of scheduling. This decision of discard is based on waiting time of packet. In this paper, mathematical analysis is performed with situation of network congestion. Also, the simulation is performed to evaluate the performance of proposed discard policy. In the result, proposed discard policy can limit queuing delay by threshold. Also, if the packet discard is performed before scheduling and threshold is set with smaller value than frame length, it can limit the throughput of traffic.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Lee, H. Lee, J. Cha, J. Kim, D. Kum, H. Baek, S. Shin, J. Jun, "Periodic Packet Discard Policy for Frame Based Scheduler," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 2, pp. 97-104, 2013. DOI: .

[ACM Style]

Sung-Hyung Lee, Hyun-Jin Lee, Jae-Ryong Cha, Jae-Hyun Kim, Dong-Won Kum, Hae-Hyeon Baek, Sang-heon Shin, and Jehyun Jun. 2013. Periodic Packet Discard Policy for Frame Based Scheduler. The Journal of Korean Institute of Communications and Information Sciences, 38, 2, (2013), 97-104. DOI: .

[KICS Style]

Sung-Hyung Lee, Hyun-Jin Lee, Jae-Ryong Cha, Jae-Hyun Kim, Dong-Won Kum, Hae-Hyeon Baek, Sang-heon Shin, Jehyun Jun, "Periodic Packet Discard Policy for Frame Based Scheduler," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 2, pp. 97-104, 2. 2013.