Modeling Traffic Shaping and Traffic Policing in Packet-Switched Networks

Wlodek M. Zuberek^1, and Dariusz Strzeciwilk²

¹Department of Computer Science, Memorial University, St. John’s, Canada

²Department of Applied Informatics, University of Life Sciences, Warsaw, Poland

Cite this paper:
Wlodek M. Zuberek and Dariusz Strzeciwilk. Modeling Traffic Shaping and Traffic Policing in Packet-Switched Networks. Journal of Computer Sciences and Applications. 2018; 6(2):75-81. doi: 10.12691/jcsa-6-2-4

Abstract

Traffic shaping is a computer network traffic management technique which delays some packets to make the traffic compliant with the desired traffic profile. Traffic policing is the process of monitoring network traffic for compliance with a traffic contract and dropping the excess traffic. Both traffic shaping and policing use two popular methods, known as leaky bucket and token bucket. The paper proposes timed Petri net models of both methods and uses these models to show the effects of traffic shaping and policing on the performance of very simple networks.

Keywords:
traffic shaping traffic policing packet-switched networks leaky bucket algorithm token bucket algorithm timed Petri nets performance analysis

This work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

References:

[1]	Chen, T.M. (2007). “Network traffic management”; in: Handbook of Computer Networks, Bidgoli, H. (ed.), New York, NY: Wiley.
[2]	Elwalid, A., Mitra, D. (1997). “Traffic shaping at a network node: theory, optimum design, admission control”, Proc. IEEE INFOCOM’97, 444-454.
[3]	Allen, A.A. (1991). Probability, Statistics and Queueing Theory with Computer Science Applications (2 ed), San Dego, CA: Academic Press.
[4]	Jain, R. (1991). The art of computer systems performance analysis, New York, Y: J. Wiley & Sons.
[5]	Flach, T., Papageorge, P., Tersiz, A., Pedrosa, L.D., Cheng, Y., Karim, T., Bassett, E.K., Govindan, R. (2016). “An internet-wide analysis of traffic policing”, Proc. SIGCOMM’16, Florianopolis, Brazil.
[6]	Murata, T. (1989). “Petri nets: properties, analysis and applications”, Proceedings of IEEE, 77(4), 541-580.
[7]	Reisig, W. (1985). Petri Nets - an Introduction (EATCS Monographs on Theoretical Computer Science 4), New York, NY: Springer-Verlag.
[8]	Zuberek, W.M. (1991). “Timed Petri nets – definitions, properties and applications”, Microelectronics and Reliability (Special Issue on Petri Nets and Related Graph Models), 31(4), 627-644.
[9]	Zuberek, W.M. (1987). “D–timed Petri nets and modelling of timeouts and protocols”, Transactions of the Society for Computer Simulation, 4(4), 331-357.
[10]	Zuberek, W.M. (1986). “M–timed Petri nets, priorities, preemptions, and performance evaluation of systems”; in: Advances in Petri Nets 1985 (Lecture Notes in Computer Science 222), 478-498, Berlin, Heidelberg: Springer–Verlag.
[11]	Swarna, M., Ravi, S., Anand, M. (2016). “Leaky bucket algorithm for congestion control”, Int. Journal of Applied Engineering Research, 11(5), 3155-3159.
[12]	Tannenbaum, A.S. (2003). Computer Networks (4 ed), Englewood Cliffs, NJ: Prentice-Hall.
[13]	Tsai, T-C., Jiang, C-H., Wang, C-Y. (2006). “CAC and packet scheduling using token bucket for IEEE 802.16 networks”, Journal of Communications, 1(2), 30-37.
[14]	Georges, P., Divoux, T., Rondeau, E. (2005). “Strict priority versus weighted fair queueing in switched Ethernet networks for time-critical applications”, Proc. 19-th IEEE International Parallel and Distributed Processing Symposium (IPDPS’05), 141-145.
[15]	Rexford, J., Bonomi, F., Greenberg, A., Wong, A. (1997). “Scalable architecture for integrated traffic shaping and link scheduling in high speed AT- M switches”, IEEE Journal on Selected Areas in Communication, 15, 938-950.