"Modeling traffic shaping and traffic policing in packetswitched
networks"
Zuberek, W.M., Strzeciwilk, D.
Journal of Computer Sciences and Applications, vol.?, no.?, pp.?, 2018.
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, packetswitched networks,
leaky bucket algorithm, token bucket algorithm, timed Petri nets,
performance analysis.
References:

Allen, A.A., Probability, Statistics and Queueing Theory with
Computer Science Applications (2 ed); Academic Press 1991.

Chen, T.M., ``Network traffic management''; in: Handbook of
Computer Networks, Bidgoli, H. (ed.), Wiley 2007.

Elwalid, A., Mitra, D., ``Traffic shaping at a network node: theory,
optimum design, admission control'', Proc. IEEE INFOCOM'97, pp.444454,
1997.

Flach, T., Papageorge, P., Tersiz, A., Pedrosa, L.D., Cheng, Y., Karim, T.,
Bassett, E.K., Govindan, R., ``An internetwide analysis of traffic
policing'', Proc. SIGCOMM'16, Florianopolis, Brazil, 2016.

Georges, P., Divoux,T., Rondeau, E. (2005). ``Strict priority versus weighted
fair queueing in switched Ethernet networks for timecritical applications'',
Proc. 19th IEEE Int. Parallel and Distributed Processing Symposium (IPDPS'05),
pp.141145, 2005.

Jain, R., The Art of Computer Systems Performance Analysis;
J. Wiley Interscience, 1991.

Murata, T., ``Petri nets: properties, analysis and applications'';
Proceedings of IEEE, vol.77, no.4, pp.541580, 1989.

Reisig, W., Petri Nets  an Introduction (EATCS Monographs on
Theoretical Computer Science 4); SpringerVerlag 1985.

Rexford, J., Bonomi, F., Greenberg, A., Wong, A., ``Scalable architecture
for integrated traffic shaping and link scheduling in high speed ATM
switches'', IEEE Journal on Selected Areas in Communication, vol.15,
pp.938950, 1997.

Swarna, M., Ravi, S., Anand, M., ``Leaky bucket algorithm for congestion
control'', Int. Journal of Applied Engineering Research, vol.11, no.5,
pp.31553159, 2016.

Tannenbaum, A.S., Computer Networks (4 ed), PrenticeHall 2003.
% (ISBN 0131668366).

Tsai, TC., Jiang, CH., Wang, CY., ``CAC and packet scheduling using
token bucket for IEEE 802.16 networks'', Journal of Communications, vol.1,
no.2, pp.3037, 2006.

Zuberek, W.M., ``Mtimed Petri nets, priorities,
preemptions, and performance evaluation of systems''; in: Advances
in Petri Nets 1985 (LNCS 222), pp.478498, SpringerVerlag 1986.

Zuberek, W.M., ``Dtimed Petri nets and modelling
of timeouts and protocols''; Transactions of the Society for Computer
Simulation, vol.4, no.4, pp.331357, 1987.

Zuberek, W.M., ``Timed Petri nets  definitions,
properties and applications''; Microelectronics and Reliability
(Special Issue on Petri Nets and Related Graph Models), vol.31, no.4,
pp.627644, 1991.
Available in pdf.