PACKET SCHEDULING AND PRICING BASED ON INFLICTED DELAY

Ari Viinikainen

2006

Abstract

An adaptive packet scheduling method is presented in this paper. The adaptive weights of a scheduler are chosen based on maximizing the revenue of the network service provider. The pricing scenario is based on the delay that a connection will inflict to other connections. The features of the adaptive weight updating algorithm are simulated, analyzed and compared to a constant weight algorithm.

References

  1. Bennett, J. C. R. and Zhang, H. (1996). WF2Q: worstcase fair weighted fair queueing. In Proc. 15th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'96), volume 1, pages 120 - 128.
  2. Demers, A., Keshav, S., and Shenker, S. (1989). Analysis and simulation of a fair queuing algorithm. ACM SIGCOMM Comput. Commun. Rev., 19(4):1-12.
  3. Golestani, S. J. (1994). A self-clocked fair queueing scheme for broadband applications. In Proc. 13th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'94), volume 2, pages 636 - 646.
  4. Goyal, P., Vin, H. M., and Cheng, H. (1997). Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks. IEEE/ACM Trans. Networking, 5(5):690-704.
  5. Guo, C. (2001). SRR: an O(1) time complexity packet scheduler for flows in multi-service packet networks.
  6. Joutsensalo, J., Viinikainen, A., Hämäläinen, T., and Wikström, M. (2005). Bandwidth allocation and pricing for telecommunications network. In Proc. Next Generation Internet Networks (NGI'05), pages 165 - 172.
  7. Kanhere, S. S. and Sethu, H. (2001). Fair, efficient and lowlatency packet scheduling using nested deficit round robin. In Proc. IEEE Workshop on High Performance Switching and Routing, pages 6 - 10.
  8. Kanhere, S. S., Sethu, H., and Parekh, A. B. (2002). Fair and efficient packet scheduling using elastic round robin. IEEE Trans. Parallel Distrib. Syst., 13(3):324- 336.
  9. Marosits, T., Molnár, S., and Sztrik, J. (2001). CAC algorithm based on advanced round robin method for QoS networks. In Proc. Sixth IEEE Symposium on Computers and Communications, 2001, volume 2, pages 266 - 274.
  10. Parekh, A. K. and Gallager, R. G. (1993). A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Trans. Networking, 1(3):344-357.
  11. Ramabhadran, S. and Pasquale, J. (2003). Stratified round robin: A low complexity packet scheduler with bandwidth fairness and bounded delay. In Proc. 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pages 239 - 250. ACM Press.
  12. Shreedhar, M. and Varghese, G. (1996). Efficient fair queuing using deficit round-robin. IEEE/ACM Trans. Networking, 4(3):375-385.
  13. Stiliadis, D. and Varma, A. (1998). Efficient fair queueing algorithms for packet-switched networks. IEEE/ACM Trans. Networking, 6(2):175-185.
  14. Tsao, S.-C. and Lin, Y.-D. (2001). Pre-order deficit round robin: a new scheduling algorithm for packetswitched networks. Comput. Networks, 35(2-3):287- 305.
  15. Viinikainen, A., Joutsensalo, J., Pääkkönen, M., and Hämäläinen, T. (2004). Packet scheduling algorithm with weight optimization. In Proc. International Conference on E-business and Telecommunication Networks (ICETE'04), volume 2, pages 127 - 133.
  16. Yuan, X. and Duan, Z. (2005). FRR: a proportional and worst-case fair round robin scheduler. In Proc. 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05), volume 2, pages 831- 842.
Download


Paper Citation


in Harvard Style

Viinikainen A. (2006). PACKET SCHEDULING AND PRICING BASED ON INFLICTED DELAY . In Proceedings of the International Conference on e-Business - Volume 1: ICE-B, (ICETE 2006) ISBN 978-972-8865-62-7, pages 113-117. DOI: 10.5220/0001424201130117


in Bibtex Style

@conference{ice-b06,
author={Ari Viinikainen},
title={PACKET SCHEDULING AND PRICING BASED ON INFLICTED DELAY},
booktitle={Proceedings of the International Conference on e-Business - Volume 1: ICE-B, (ICETE 2006)},
year={2006},
pages={113-117},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001424201130117},
isbn={978-972-8865-62-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on e-Business - Volume 1: ICE-B, (ICETE 2006)
TI - PACKET SCHEDULING AND PRICING BASED ON INFLICTED DELAY
SN - 978-972-8865-62-7
AU - Viinikainen A.
PY - 2006
SP - 113
EP - 117
DO - 10.5220/0001424201130117