`
`
`
`
`
`
`
`United States Patent
`(12)
`US 7,088,678 B1
`(10) Patent No.:
`
`
`
`
`
`
`
`Freed etal.
`(45) Date of Patent:
`Aug. 8, 2006
`
`
`
`
`US007088678B1
`
`
`
`
`
`
`
`
`(54) SYSTEM AND METHOD FOR TRAFFIC
`
`
`
`SHAPING BASED ON GENERALIZED
`
`
`
`
`CONGESTION AND FLOW CONTROL
`
`
`
`
`
`
`75
`
`(75)
`
`.
`
`:
`
`.
`
`Inventors: SatishAmara,MtProspectI tus)
`
`
`
`
`
`
`
`
`Michael Borella, Naperville, IL (US)
`
`
`
`
`
`(73) Assignee: 3Com Corporation, Marlborough, MA
`US(US)
`
`
`
`
`
`
`
`
`Subject to any disclaimer, the term ofthis
`
`
`
`
`patent is extended or adjusted under 35
`
`
`(*) Notice:
`
`
`
`
`
`
`
`
`
`
`(21) Appl. No.: 09/941,280
`
`
`
`
`Aug. 27, 2001
`Filed:
`
`
`
`Int. Cl.
`
`
`
`(2006.01)
`HOAL 12/726
`
`
`
`
`
`
`cceccccccvcessssssssssesssseeeeee 370/230; 370/236.1
`(52) US. C1.
`
`
`
`
`
`
`(58) Field of Classification Search ...... 370/229-236.1,
`370/248, 412; 709/232-235
`
`
`
`
`
`
`
`
`
`
`See application file for complete search history.
`
`
`References Cited
`
`(22)
`
`(51)
`
`
`
`(56)
`
`
`
`
`
`U.S. PATENT DOCUMENTS
`
`
`
`
`
`
`
`2/1987 Braff et al. oe 370/94
`
`
`
`
`
`
`
`11/1989 Herbison et al.
` ......0..... 380/21
`
`
`
`
`
`
`
`
`2/1991 Farese et al.
` ....... we 370/58.1
`
`
`
`
`
`
`5/1991 Edwards, Jr. oe. 364/900
`
`
`
`
`8/1992 Corbin oo... eee 395/700
`
`
`
`
`
`4/1994 Konishi 0.0.0... 395/200
`
`
`
`
`
`
`9/1994 Moura et al.
`oo... 348/12
`
`
`
`
`FN99S Callon wc... 370/85.13
`
`
`
`
`
`
`8/1995 Northcutt et al.
`....... 395/200.09
`
`
`
`
`
`1/1996 Majetiet al. ou . 348/10
`
`
`
`
`
`
`
`2/1996 Inoue ............
`.. 340/870.39
`
`
`
`
`
`
`6/1996 Walsh et al.
`........00.. 370/85.13
`
`
`
`
`
`
`12/1996 Schneider et al.
`.......... 379/399
`
`
`
`
`
`
`12/1996 Mouraet al... 370/404
`
`
`
`
`
`1/1997 Stone oo... eee 370/469
`
`
`
`
`
`
`
`2/1997 Schneideret al.
`.......... 379/399
`
`
`
`
`
`
`2/1997 Schneideret al.
`.......... 379/399
`
`
`4,644,533 A
`
`4,881,263 A
`
`4,996,685 A
`
`5,014,234 A
`
`5,138,712 A
`
`5,301,273 A
`
`5,347,304 A
`
`5,430,727 A
`
`5,442,749 A
`
`5,488,412 A
`
`5,489,897 A
`
`5,528,595 A
`
`5,583,931 A
`
`5,586,121 A
`
`5,598,410 A
`
`5,600,717 A
`
`5,606,606 A
`
`
`5,608,446 A
`
`5,610,910 A
`
`5,623,542 A
`
`5,623,601 A
`
`5,636,211 A
`5,675,732 A
`
`
`
`
`
`
`
`3/1997 Carr et al. veer 348/6
`
`
`
`
`
`
`3/1997 Focsaneanuet al.
`........ 370/351
`
`
`
`
`
`
`
`4/1997 Schneider et al... 379/399
`
`
`
`
`A997 VU wee eceeeeeeeeee 395/187.01
`
`
`
`
`
`6/1997 Newlin oe 370/465
`10/1997 Majeti et al.
`.......... 395/200.01
`
`
`
`
`
`
`(Continued)
`
`
`FOREIGN PATENT DOCUMENTS
`WO 99/11003
`3/1999
`
`
`
`
`
`
`
`WO
`
`
`
`.
`(Continued)
`
`
`
`
`
`
`
`
`Droms, R., Dynamic Host Configuration Protocol, Request
`
`
`
`
`
`
`
`
`for Comments 1541, Oct. 1993, pp. 1 to 31.
`
`
`
`
`
`(Continued)
`
`
`
`Primary Examiner—Duc Ho
`
`
`
`
`Assistant Examiner—Phuongchau Ba Nguyen
`
`
`
`C‘\ Atrorney. Agent or Firm—McDonnell Boehnen
`ube
`ergho
`
`
`
`
`(57)
`ABSTRACT
`
`
`
`
`
`
`
`
`
`
`
`
`
`A system and methods are shownfor traffic shaping and
`
`
`
`
`
`
`congestion avoidance in a computer network such as a
`data-over-cable network. A headend of the data-over-cable
`
`
`
`
`
`
`
`
`
`
`
`system includes a traffic shaper configured to calculate a
`
`
`
`
`
`
`
`
`
`packet arrival rate from a cable modem anda traffic condi-
`
`
`
`
`
`
`tioner configured to calculate an average queue size on an
`
`
`
`
`
`
`
`
`output interface to an external network. For example, the
`
`
`
`
`
`
`
`
`
`traffic shaper compares the packetarrival rate to three packet
`
`
`
`
`
`
`arrival thresholds including a committed rate threshold, a
`
`
`
`
`
`
`
`
`
`control rate threshold and a peak rate threshold. If the
`
`
`
`
`
`
`
`
`calculated packet arrival rate falls between the committed
`
`
`
`
`
`
`
`
`threshold and control
`rate threshold,
`the traffic shaper
`
`
`
`
`
`
`
`applies a link layer mechanism, such as a MAP bandwidth
`
`
`
`
`
`
`
`allocation mechanism, to lower the transmission rate from
`the cable modem.
`
`
`
`
`
`
`
`35 Claims, 5 Drawing Sheets
`
`
`
`
`[-
`
`120
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`eoco
`|ROUTER
`
`TRAFFIC MANAGER
`
`102 OUTGOING
`
`
`
`CLIENT
`
`DEVICE
`
`
`
`
`INCOMING
`
`INTERFACE 108
`
`
`
`
`
`
`
`
`
`
`TRAFFIC
`
`SHAPER 110
`
`
`
`INTERFACE 114
`
`
`
`
`TRAFFIC
`
`CONDITIONING
`412
`
`
`
`
`PROCESSOR
`122
`
`
`
`
`
`
`MEMORY
`UNIT 124
`
`
`
`
`
`
`
`
`DATA
`
`
`NETWORK
`
`
`Splunk Inc.
`
`Exhibit1015
`
`Page 1
`
`Splunk Inc. Exhibit 1015 Page 1
`
`

`

`
`
`US 7,088,678 B1
`
`
`Page 2
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`....... 370/236.1
`4/2000 Hasegawaet al.
`6,046,983 A *
`U.S. PATENT DOCUMENTS
`_ sont
`anes A an Samakrishnan ,
`5,675,742 A
`10/1997 Jain et al. wees 395/200
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`eee 709/222
`6,049,826 A
`4/2000 Beser wees...
`5,678,041 A
`10/1997 Baker etal. ...
`+++ 395/609
`
`
`
`
`
`
`
`
`
`
`
`
`
`seessecessseee- 709/223
`6,052,724 A
`4/2000. Willie et al.
`5,708,654 A
`1/1998 Arndtet al.
`s+ 370/242
`...
`6,058,421 A
`5/2000. Fijolek et al. vse 709/225
`Saoeto A
`‘loos Bondi
`seteeaeeeanecnsaee 395/200.54
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`6,061,349 A
`5/2000. Coile et al. essseecessseees 370/380
`ndt et al.
`............. 395/200.5
`724,
`
`
`
`
`
`
`
`
`
`erotet A
`.loos mene tal ag 6,064,372 A
`5/2000 Kahkoska veesseesseecssees 345/173
`
`
`
`
`
`
`
`
`
`
`
`ab vee
`ve
`1Cary Ct
`6,065,049 A
`5/2000 Beser occ.
`we 709/218
`”
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,784,597 A
`7/1998 Chiu et al. veeeceeeen 395/552
`6070187 A
`5/2000 Subramaniam et al... 709/220
`
`
`
`
`
`
`
`5,790,198 A
`8/1998 Roopet al... a. 348/460
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,790,548 A
`8/1998 Sistanizadeh et al.
`....... 370/401
`6,070,242 A
`5/2000 Wonget al.
`-------sssseeoe 713/201
`6,070,246 A
`5/2000 Beser v.cceecesseesseeseseeeene 713/201
`ae
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,790,677 A
`8/1998 Fox etal. wees 380/24
`010,
`
`
`
`
`
`
`
`
`
`
`
`
`
`5790770 A
`6,073,178 A
`6/2000 Wong et al. vse 709/229
`‘8/1998 McClure etal... 395/200.61
`
`
`
`
`
`
`
`
`
`
`5.790.806 A
`8/1998. Koperda..
`305/200 82
`6,075,787 A
`6/2000 Bobeck et al.
`.. 370/395
`.....
`
`
`
`
`
`
`
`
`
`
`
`
`5,793,747 A
`8/1998 Kline ......
`6,091,709 A
`7/2000 Harrison et al.
`...
`_... 370/230
`... 370/235
`
`
`
`
`
`
`
`
`
`
`
`.-- 370/395
`5,799,086 A
`8/1998 Sudia wee 380/23
`6,094,431 A
`7/2000 Yamatoetal. .....
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,805,804 A
`9/1998 Laursen et al.
`........ 395/200.02
`6,104,700 A
`8/2000 Haddock et al.
`............ 370/235
`
`
`
`
`
`
`
`
`
`
`
`
`5,809,252 A
`9/1998 Beighe et al.
`.......... 395/200.57
`6,112,258 A
`8/2000 Miller et al. oo... 710/19
`
`
`
`
`
`
`
`
`
`
`
`
`5,812,819 A
`9/1998 Rodwin et al.
`2.0.0.0... 395/500
`6,122,254 A
`9/2000 Aydemir et al.
`.. 370/235
`...
`
`
`
`
`
`
`
`
`
`
`
`
`5,815,664 A
`9/1998 Asano ........
`.. 395/200.57
`6,128,298 A
`10/2000 Wootton et al.
`... 370/392
`
`
`
`
`
`
`
`
`
`
`
`
`5,818,845 A
`10/1998 Moura et al... 370/449
`6,130,879 A
`10/2000 Liu we ... 370/230
`
`
`
`
`
`
`
`
`
`
`5,819,028 A
`10/1998 Manghirmalani
`6,130,880 A
`10/2000 Nauduset al... 370/235
`
`
`
`
`
`
`
`
`
`
`
`6,137,792 A
`10/2000 Jonaset al. ...ceceeee 370/354
`etal.
`....
`ws 395/185.1
`
`
`
`
`
`
`
`
`
`
`ee A
`toloos nansen or
`6,137,793 A
`10/2000 Gorman etal. .
`“ ‘ner
`.. 370/360
`
`oura et al. wo.
`828,
`
`
`
`
`
`5,828,666 A
`10/1998 Focsaneanuet al.
`eis7.965 A Dee easkeyetahoe _ on
`........ 370/389
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,835,720 A
`11/1998 Nelson et al.
`......... 395/200.54
`6,170,061 BL
`1/2001 Beser veeccssescsseessseecsneee 713/201
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,835,727 A
`L1/1998 Wonget all.
`........... 395/200.68
`6,178,455 Bl
`1/2001 Schutte et al. ...seees 709/228
`
`
`
`
`
`
`
`
`
`
`
`509/230
`5,841,777 A
`11/1998 Cohen ........
`618564 BL
`2/2001 Fiiolek ot al
`wae 370/433
`5,848,233 A
`12/1998 Radia et al.
`........... 395/187.01
`Csr erereeces
`184
`J
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`3'852.721 A
`12/1998 Dillon et al... 398/20047
`6,189,102 Bl
`2/2001 Beser v.ccsecesscesseeseseeeeee 713/201
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,854,901 A
`12/1998 Cole et al......
`6,208,656 Bl
`3/2001 Hrastar et al.
`»- 370/401
`vee 709/245
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,859,852 A
`1/1999 Moura etal. ..
`ae 370/449
`6,212,563 Bl
`4/2001 Beser....
`vee 709/227
`
`
`
`
`
`
`
`
`
`
`
`
`
`v 709/250
`5,864,679 A
`1/1999 Kanai et al.
`......
`ve 709/238
`6,216,171 Bl
`4/2001 Isonoetal. ..
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,870,134 A
`2/1999 Laubach et al.
`.ecccccccccee 348/12
`6,223,222 Bl
`4/2001 Fijolek et al. ow. 709/227
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,872,523 A
`2/1999 Dellaverson et al.
`.. 340/825.52
`6,233,224 BI*
`5/2001 Yamashita et al.
`.......... 370/231
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,884,024 A 6,240,464 BL=5/2001 Fijolek et al.3/1999 Limet al. wu. 395/187.01 ........ .-- 709/250
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,892,754 A
`4/1999 Kompella et al.
`.....000.. 370/236
`6,243,369 Bl
`6/2001 Grimwoodet al.
`.......... 370/335
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,894,479 A
`4/1999 Mohammed......
`370/401
`6,260,072 BL
`7/2001 Rodriguez-Moral
`........ 709/241
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,903,558 A
`5/1999 Jones et al. oe. eee 370/351
`6,269,099 BI
`7/2001 Borella et al. we. 370/389
`
`
`
`
`
`
`
`
`
`
`
`
`5,909,549 A
`6/1999 Complimentet al.
`....... 709/223
`6,272,150 Bl
`8/2001) Hrastar oe ceeeeeeeee 370/486
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,913,037 A
`6/1999 Spofford et al.
`....... 395/200.56
`6,275,853 Bl
`8/2001 Beser et al.
`... 709/223
`....
`
`
`
`
`
`
`
`
`
`
`
`
`oOodo A
`£009 mone ae sooo
`6,289,377 B1
`9/2001 Lalwaney etal.
`.......... 709/222
`
`
`
`
`
`
`
`5922051 A
`7/1999 Sidey verevonvnsnnnn 709/223
`6301223 BL
`102001 Hiastaret ale
`370027
`
`FERNORFREEAAATIIRcrests secces vere 301, rastar et al. we
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`51923,659 A
`TIL999 Curry et al. sesso 370/401
`6,301,618 Bl
`10/2001 Sitaraman et al.
`.......... 709/227
`ooogen A
`roo Bevreeeeeneny sen
`6,308,328 Bl
`10/2001 Boweutt et al. sees... 725/111
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`3.041.988 A
`8/1999 Bhagwat ef al.oo. 713/201
`6,331,987 Bl
`12/2001 Beser v..ccecssseesseeseseeeene 370/486
`
`
`
`
`
`
`
`
`
`5.943.604 A
`8/1999 Chenet al. sees 455/5.1
`6,332,163 Bl
`12/2001 Bowman-Amuah
`......... 709/231
`
`
`
`
`
`
`
`
`
`
`
`
`5954797 A
`9/1909 Sidey .......
`6,337,858 Bl
`1/2002 Petty et al. esses 370/356
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,958,007 A
`9/1999 Lee et al. ceceeeuseen 709/219
`6,351,773 Bl
`2/2002 Fijolek et al... 709/228
`
`
`
`
`
`
`
`
`
`
`
`5,960,177 A
`9/1999 Tanno veesseessceeseeeone 395/200.59
`6,370,147 BL
`4/2002 Beser ..........
`+ 370/401
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,974,453 A
`10/1999 Andersen et al.
`ae 709/220
`6,393,478 Bl
`5/2002 Bahlmann.
`- 709/224
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,982,748 A
`LL/1999 Yinet al.
`ceceescecseeeseee 370/232
`6,442,158 BL
`8/2002 Beser.......
`w+ 370/352
`
`
`
`
`
`
`
`
`
`
`
`5,987,524 A
`11/1999 Yoshidaet al... 709/245
`6,449,291 Bl
`9/2002 Burnsetal. .
`-- 370/516
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`we F25/111
`.......
`5,991,292 A
`11/1999 Focsaneanuetal. ........ 370/352
`6,453,472 Bl
`9/2002 Leanoet al.
`
`
`
`
`
`
`
`
`
`
`
`
`
`........... 725/129
`5,991,306 A
`11/1999 Burnset al. eee 370/429
`6,490,727 BL
`12/2002 Nazarathy et al.
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`5,996,076 A
`11/1999 Rowney et al. vs... 713/201
`6,510,162 BL
`1/2003. Fijolek et al.
`........
`++ 370/432
`
`
`
`
`
`
`
`
`
`
`
`
`
`5.999.536 A
`12/1999 Kawafuyji et al.
`......... 370/401
`6,625,118 B1*
`9/2003 Hadi Salim etal. ........ 370/236
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`6,003,077 A
`12/1999 Bawden et al. wo... 709/223
`6,865,185 B1*
`3/2005 Patel et al.
`........
`370/412
`
`
`
`
`
`
`
`
`
`
`
`6,005,851 A
`12/1999 Craddock et al. wees... 370/329
`6,868,063 BL*
`3/2005 De Cnodder
`+ 370/236
`...
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`6,006,264 A
`12/1999 Colby et al.
`...
`eee 709/226
`6,904,015 BI*
`6/2005 Chenet al.
`..
`++ 370/235
`
`
`
`
`
`
`
`
`
`
`
`6,009,103 A
`12/1999 Woundy esses 370/401
`6,914,883 BL*
`7/2005 Dharanikota .
`- 370/230.1
`
`
`
`
`
`
`
`
`
`
`
`
`6,012,088 A
`1/2000 Liet al. ecceeeeeen 709/219
`2002/0122050 Al
`9/2002 Sandberg .....
`w+ 345/705
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`6,013,107 A
`1/2000 Blackshear et al.
`......... 703/229
`2002/0136165 Al
`9/2002 Ady et al.
`+ 370/241
`...
`
`
`
`
`
`
`
`
`
`
`
`
`6,014,545 A
`1/2000 Wut al.
`cececesceseene 455/3.1
`2002/0186660 A1* 12/2002 Bahadiroglu .
`s+ 370/248
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`6,018,767 A
`1/2000 Fijolek et al. wees... 709/218
`2003/0028891 Al
`2/2003. Hardt et al.
`....
`ve 725/107
`6,031,841 A
`2/2000 Woundy veeeeee
`. 370/410
`2003/0097461 Al*
`5/2003 Barham et al.
`............. 709/235
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`6,032,019 A
`—-2/2000 Chenet al. eee 455/5.1
`6,041,041 A
`3/2000 _Ramanathan et al.
`....... 370/241
`FOREIGN PATENT DOCUMENTS
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`6,046,979 A
`4/2000 Bauman w.eeeeeceeeeeee 370/229
`WO 00/67385
`11/2000
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`WO
`
`
`
`Splunk Inc.
`
`Exhibit1015
`
`Page 2
`
`Splunk Inc. Exhibit 1015 Page 2
`
`

`

`
`
`US 7,088,678 B1
`
`
`Page 3
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`OTHER PUBLICATIONS
`
`
`
`
`
`
`
`
`RFC 791, Internet Protocol, DARPA Internet Program Pro-
`
`
`
`
`
`
`tocol Specification, Sep. 1981, pp. 1-37.
`
`
`
`
`
`
`
`Postel, J., Internet Protocol, DARPA Internet Program Pro-
`
`
`
`
`
`
`
`
`tocol Specification, RFC 792, Sep. 1981, pp. 1-14.
`
`
`
`
`
`
`
`
`
`Postel, J., User Datagram Protocol, RFC 768, Aug. 28,
`
`
`
`1980, pp. 1-3.
`
`
`
`
`
`
`RFC 793, Transmission Control Protocol, DARPA Internet
`
`
`
`
`
`
`
`Program Protocol Specification, Sep. 1981, pp. 1-68.
`
`
`
`
`
`
`Case, J. et al., A Simple Network Management Protocol
`
`
`
`
`
`
`
`(SNMP), RFC 1157, May 1990, pp. 1-26.
`
`
`
`
`
`
`
`
`
`Sollins, K., Zke TFTP Protocol (Revision 2), RFC 1350,Jul.
`
`
`
`1992, pp. 1-9.
`
`
`
`
`
`
`
`
`Alexander, S., DHCP Options and BOOTP Vendor Exten-
`
`
`
`
`
`
`
`sions, RFC 2132, Mar. 1997, pp. 1-37.
`
`
`
`
`
`
`“Radio Frequency Interface Specification (Interim Specifi-
`
`
`
`
`
`cation) SP-RFIv1.1-103-991105”, MCNS Holdings, L.P.,
`
`
`
`
`1999, pp. li to 366.
`
`
`
`
`
`
`“Cable Modem to Customer Premise Equipment Interface
`
`
`
`
`Specification (Interim) SP-CMCI-I02-980317”, Multimedia
`
`
`
`
`
`
`
`Cable Network Systems (MCNS) Holdings, L.P., Cable
`
`
`
`
`
`
`
`Television Laboratories, Inc., 1998, pp. i1 to 40.
`
`
`
`
`
`“Operations
`System Interface
`Specification
`Support
`
`
`
`
`
`
`Baseline Privacy Interface MIB (Interim Specification)
`
`
`
`
`
`SP-OSSI-BPI-I01-980331”, MCNS Holdings, L.P., 1997
`
`
`
`
`
`and 1998, pp. ii to 33.
`
`
`
`
`
`“Cable Modem Termination System-Network Side Interface
`
`
`
`Specification (Interim Specification) SP-CMTS-NSIIO1-
`
`
`
`
`
`
`
`
`960702”, MCNS Holdings, L.P., 1996, pp. ii to 13.
`
`
`
`
`
`“Removable Security Module
`Interface Specification
`
`
`
`
`(Interim Specification) SP-RSMI-I01-980204”, MCNS
`
`
`
`
`
`
`
`Holdings, L.P., Cable Television Laboratories, Inc., 1997,
`
`
`
`pp. ito 47.
`
`
`
`
`
`
`“Baseline Privacy Interface Specification (Interim) SP-BPI-
`
`
`
`
`
`
`
`
`[01-970922”, MCNSHoldings, L.P., 1997, pp. ii to 65.
`
`
`
`
`
`“Operations
`Support
`System Interface
`Specification
`
`
`
`
`
`(Interim) SP-OSSII01-970403”, MCNS Holdings, L.P.,
`
`
`
`
`1997, pp. 1 to 30.
`
`
`
`
`
`
`“Radio Frequency Interface Specification (Interim Specifi-
`
`
`
`
`
`
`cation) SP-RFI-102-971008”, MCNSHoldings, L.P., 1997,
`
`
`
`pp. 11 to 186.
`
`
`
`
`
`
`“Cable Modem Telephony Return Interface Specification
`
`
`
`
`
`(Interim) SP-CMTRI-I01-970804”, MCNS Holdings, L.P.,
`
`
`
`
`
`
`
`
`Cable Television Laboratories, Inc., 1997, pp. ii to 73.
`
`
`
`
`
`“Security System Specification (Interim Sepcification)
`
`
`
`
`
`
`SP-SSI-I01-970506”, MCNS Holdings, L.P., 1997, pp. 11 to
`103.
`
`
`
`
`
`
`
`“Internet Engineering Task Force”, Request for Comments
`
`
`
`
`
`
`2131, Dynamic Host Configuration Protocol (DHCP), Mar.
`
`
`
`
`1997, pp. 1 to 42.
`
`
`
`
`
`
`IPCDN Telephony Return MIB,
`S. Adiraju, J. Fijolek,
`
`
`
`
`
`
`Internet Engineering Task Force, Internet Draft, “<draft-ietf-
`
`
`
`
`
`
`ipcedn-tri-mib-00.1.txt>,” Mar. 1998, pp. 1 to 26.
`
`
`
`
`
`
`
`Kyees, P.J. et a., ADSL: A New Twisted-Pair Access to the
`
`
`
`
`Information Highway, IEEE Communications Magazine,
`
`
`
`
`
`
`
`vol. 33, Issue 4, Apr. 1995, pp. 52-60.
`
`
`
`
`
`Huang, Yin-Hwaet al., Design of an MPEG-Based Set-Top
`
`
`
`
`
`
`Boxfor Video on Demand Services, Acoustics, Speech, and
`
`
`
`
`
`Signal Processing, 1995, ICASSP-95., 1995 International
`
`
`
`
`
`
`Conference, vol. 4, ISBN: 0-7803-2431-5, May 9-12, 1995,
`
`
`pp. 2655-2658.
`
`
`
`
`
`
`
`“A Solution for the Priority Queue Problem of Deadline-
`
`
`
`
`
`
`Ordered Service Disciplines,” N.R. Figueira, IEEE Interna-
`
`
`
`
`
`tional Conference on Computer Communications and Net-
`
`
`
`
`
`
`works, Sep. 22-25, 1997, pp. 320-325.
`
`
`
`
`
`“Radio Frequency Interface Specification (Interim Specifi-
`
`
`
`
`
`cation) SP-RFI-104-980724”, MCNSHoldings, L.P., 1997,
`
`
`
`pp. lito 196.
`
`
`
`
`
`Ramakrishnan, K., A Proposal to Add Explicit Congestion
`
`
`
`
`
`
`
`
`
`Notification (ECN) to IP, RFC 2481, Jan. 1999, pp. 1 to 24.
`
`
`
`
`
`ITU-T 1.732, Fuecntional Characteristics ofATM Equipment,
`Oct. 2000.
`
`
`
`
`
`
`
`
`ITU-T 1363.3, B-ISDN ATM Apaptation Layer Specifica-
`
`
`
`
`
`
`tion: Type 3/4 AAL, Aug. 1996.
`
`
`
`
`
`ITU-T 1.326, Functional Architecture ofTransport Networks
`
`
`
`
`Based on ATM, Nov. 1995.
`
`
`
`
`
`“Radio Frequency Interface Specification (Interim Specifi-
`
`
`
`
`
`cation) SP-RFI-I05-991105”, MCNSHoldings, L-P., 1999,
`
`
`
`pp. li to 202.
`
`
`
`
`
`“Radio Frequency Interface Specification (Interim Specifi-
`
`
`
`
`cation) SP-RFIv1.1-I06-001215”, MCNS Holdings, L.P.,
`
`
`
`
`2000, pp. ii to 432.
`
`
`
`
`
`WAPArchitecture, Wireless Application Protocol Architec-
`
`
`
`
`
`
`
`
`
`ture Specification, Version 12, Jul. 12, 2001, pp. 2-24.
`
`
`
`
`
`www.cotse.com, Congestion Avoidance Overview, Oct. 30,
`
`
`
`2000, pp. 1-8.
`
`
`* cited by examiner
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`Splunk Inc.
`
`Exhibit 1015
`
`Page 3
`
`Splunk Inc. Exhibit 1015 Page 3
`
`

`

`U.S. Patent
`
`Aug. 8
`
`, 2006
`
`Sheet 1 of 5
`
`US 7,088,678 B1
`
`mSbaaNDIS
`
`SLL
`
`Viva
`
`MYOMLAN
`
`VILSOVANSLNI
`
`SNIODLNO
`
`ONINOONI
`
`B0FSJOVAYMALNI
`
`OladAVeL
`
`SNINOILIGNOD
`
`che
`
`DisdVaL
`
`OLFYadVHS
`
`
`
`verLINN
`
`cob
`
`AXOINAIN
`dOsssad0dd
`
`aeeeeeCe
`
`cOL
`
`LNAITD
`
`ASIAIG
`
`Splunk Inc.
`
`Exhibit 1015
`
`Page 4
`
`Splunk Inc. Exhibit 1015 Page 4
`
`
`
`
`
`
`
`
`
`
`

`

`
`U.S. Patent
`
`
`
`
`Aug. 8, 2006
`
`
`
`
`Sheet 2 of 5
`
`002
`
`éAYMNSIs
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`WALSASNOLLVNIWYALNACGOWATEaVoO
`
`
`
`US 7,088,678 B1
`
`QNAQVAH
`
`
`
`
`
`Ze
`
`ple
`
`JlddVaL
`
`OldsVaL
`
`YsadVHS
`YANOILIGNOSD
`
`
`
`O07ez(SLIND)
`
`
`
`¢YAOVNVWOlasval
`
`VLvd
`
`
`
`MYOMLAN
`
`
`
`8b7~
`
`
`
`Splunk Inc.
`
`Exhibit 1015
`
`Page5
`
`Splunk Inc. Exhibit 1015 Page 5
`
`
`
`
`
`

`

`U.S. Patent
`
`Aug. 8, 2006
`
`Sheet 3 of 5
`
`US 7,088,678 B1
`
`€AYuNSIS
`
`
`
`
`
`
`
`MHYOMLANVLVG
`
`
`
`(ZL€)CIOHSSYHL (OL€)CIOHSSYHL
`
`LNSIT19
`
`JOIASg
`
`(vL¢)
`
`
`ALVYIVANLaWoVd
`
`
`(YATIONLNOOSDIssAVYEL/MAAVHSDIsdVeL)
`
`
`
`
`
`90€YAOVNVINDISAVeLL
`
`L3¥MOVd
`
`(pz¢)
`
`NOIDSyYdoua
`
`ALNIavaodd
`HLIMdONa
`
`LaNOVd
`
`
`
`(zze)NOIDA
`
`
`
`4ZIsanand
`
`(gL)
`
`
`
`MVadJOYNLNOD
`
`QALLIWINOD
`
`
`
`(30¢)QIOHSSYHL
`
`aavsia
`
`MO14
`
`IONLNOD
`
`NOIDSeY
`
`(gL)
`
`Splunk Inc.
`
`Exhibit 1015
`
`Page 6
`
`Splunk Inc. Exhibit 1015 Page 6
`
`

`

`
`U.S. Patent
`
`
`
`
`Aug.8, 2006
`
`
`
`
`Sheet 4 of 5
`
`
`
`US 7,088,678 B1
`
`
`FIGURE 4A
`
`
`(c)START
`
`
`
`
`
`RECEIVE DATA PACKETS FROM A NETWORK
`
`
`
`DEVICE ON A TRAFFIC SHAPER
`
`
`
`
`
`
`COMPUTE A PACKET ARRIVAL RATE
`
`
`
`ON AN INCOMING INTERFACE
`
`
`
`APPLY AT LEAST THREE THRESHOLD LEVELS
`
`
`
`
`
`
`
`
`
`
`
`TO THE COMPUTED PACKET ARRIVAL RATE
`
`402
`
`
`
`404
`
`
`
`
`
`406
`
`408
`
`
`
`
`ACTION REQUIRED?
`
`
`
`
`
`
`
`
`
`FORWARD THE
`
`
`DATA PACKETS
`
`
`
`
`
`
`
` 410
`YES
`
`
`vs
`M4
`
`
`
`
` ENABLE
`
`
`
`FLOW CONTROL?
`
`
`
`
`
`
`
`
`ENABLE A LINK LAYER MECHANISM SUCH AS
`
`
`
`
`
`A TIME SLOT ALLOCATION MECHANISM
`
`
`
`
`TO CONTROL THE PACKET ARRIVAL RATE
`
`
`
`©
`
`
`
`Splunk Inc.
`
`Exhibit1015
`
`Page7
`
`Splunk Inc. Exhibit 1015 Page 7
`
`

`

`
`U.S. Patent
`
`
`
`
`Aug.8, 2006
`
`
`
`
`Sheet 5 of 5
`
`
`
`US 7,088,678 B1
`
`
`FIGURE 4B
`
`
`
`
`
`SUCCESSFUL
`
`CONTROL?
`
`
`
`YES
`
`
`
`
`
`
`
`
`
`O—x
`
`
`
`
`NO
`
`
`
`
`
`
`ENABLE
`
`PACKET DROP WITH
`
`PROBABILITY?
`
`
`
`YES
`
`
`
`
`
`
`
`COMPUTE A PACKET DROP PROBABILITY
`
`
`
`NO
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`DROP DATA PACKETS BASED ON
`
`
`
`THE CALCULATED PROBABILITY
`
`
`
`
`
`
`
`
`
`
`
`
`
`DROP THE DATA PACKETS RECEIVED
`
`
`
`
`FROM THE CLIENT DEVICE
`
`
`
`
`
`424
`
`Splunk Inc.
`
`Exhibit1015 Pages
`
`Splunk Inc. Exhibit 1015 Page 8
`
`

`

`
`
`US 7,088,678 B1
`
`
`1
`SYSTEM AND METHOD FOR TRAFFIC
`
`
`
`
`SHAPING BASED ON GENERALIZED
`
`
`
`CONGESTION AND FLOW CONTROL
`
`
`
`
`
`FIELD OF THE INVENTION
`
`
`
`
`
`BACKGROUND OF THE INVENTION
`
`
`
`
`
`
`
`
`
`
`
`The present invention relates to communications in com-
`
`
`
`
`
`
`
`puter networks. More specifically, it relates to a system and
`
`
`
`
`
`
`
`methodfor traffic shaping based on general congestion and
`flow control.
`
`
`
`
`2
`flows with a fixed rate of admission into the network and is
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`generally ineffective in providing a mechanism for shaping
`traffic into flows with variable rates of admission.
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`The token bucket provides a method for traffic shaping
`
`
`
`
`
`
`
`
`
`and ingress rate control. The token bucket provides a control
`mechanism that dictates when data can be transmitted based
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`on the presence of tokens in a bucket and uses network
`
`
`
`
`
`
`resources by allowing flows to burst up to configurable burst
`
`
`
`
`
`
`
`threshold levels. In the token bucket implementation, tokens
`
`
`
`
`
`
`
`
`
`
`
`are “put” into the bucketat a certain rate, and the bucket has
`
`
`
`
`
`
`a predetermined capacity. In such an implementation, if the
`
`
`
`
`
`
`
`
`
`
`bucket fills up to its top capacity, newly arriving tokens are
`
`
`
`
`
`
`
`discarded. Similarly, if the bucketis full of tokens, incoming
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`In high-speed networks, routers are required to meet
`tokens overflow and are not available for future packets.
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`certain quality-of-service requirements associated with com-
`Thus, at any time, the largest burst of data a source can send
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`municating network entities. As is known in the art, the
`into a network is roughly proportional to the size of the
`
`
`
`
`
`
`
`
`
`
`
`
`quality-of-service is a communication networkattribute that
`bucket. In the token burst implementation, a system admin-
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`exists between two network entities requiring a predeter-
`istrator may configure a token generation rate and a depth of
`
`
`
`
`
`
`
`
`the burst.
`
`
`mined network service level. The basic network parameters
`
`
`
`
`
`
`
`typically affecting network performance are bandwidth and
`
`
`
`
`
`
`
`
`In addition to traffic shaping, the token bucket methods
`
`
`
`
`
`
`
`
`delays since the application traffic between two network
`
`
`
`
`
`may be employed for congestion avoidance. As is known in
`
`
`
`
`
`
`
`entities in a computer network may require a certain mini-
`
`
`
`
`
`
`
`the art, congestion avoidance refers to methods of control-
`
`
`
`
`
`
`
`mum bandwidth or maybe sensitive to delays. Thus, in the
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`ling an average queue size on an outgoing interface of a
`simplest terms, the quality-of-service means providing con-
`
`
`
`
`
`
`
`
`router such as an edge router. The primary mechanism used
`
`
`
`
`
`
`
`sistent and predictable data delivery services to communi-
`
`
`
`
`
`
`
`
`
`
`by the token bucket and leaky bucket for shaping thetraffic
`
`
`
`
`
`
`
`cating network entities requiring a predetermined level of
`
`
`
`
`
`
`
`
`includes dropping the incoming data packets to the network.
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`network service. Further, the quality-of-service is the ability
`Somerouters handle dropping the packets using a technique
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`of a network element, such as an application process, host or
`typically referred to as tail dropping. Using tail dropping, a
`router to have some level of assurance that its traffic and
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`router simply drops packets indiscriminately, i.e., without
`
`
`
`
`service requirements can be satisfied.
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`regard to priority or class of service, for example. Other
`In general, the quality-of-service elements manage net-
`
`
`
`
`
`
`
`
`methods that have been used to avoid congestion more
`
`
`
`
`
`
`
`work resources according to application demands and net-
`
`
`
`
`
`
`
`effectively than tail dropping include a Random Early
`
`
`
`
`
`
`
`
`work managementsettings and, thus, cannot provide cer-
`
`
`
`
`
`
`Detection (“RED”), a Flow-based Random Early Detection
`
`
`
`
`
`
`
`tainty that resource sharing occurs. Therefore, quality-of-
`
`
`
`
`
`
`(“FRED”), or
`a Weighted Random Early Detection
`
`
`
`
`
`
`
`service with a guaranteed service level requires resource
`
`(“WRED”).
`
`
`
`
`
`
`
`allocation to individual data streams through the network. In
`
`
`
`
`
`
`
`
`
`
`
`
`
`When REDis not configured, output buffers fill during
`current implementations, a priority for quality-of-service
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`periods of congestion. When the buffers are full, tail drop
`developers has been to ensure that resources allocated to the
`
`
`
`
`
`
`
`
`best-effort traffic are not limited after reservations are made.
`
`
`
`
`
`
`
`
`
`occurs, and all additional packets are dropped. Since the
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`packets are dropped all at once, global synchronization of
`However, equally important is that the high-priority appli-
`
`
`
`
`
`
`
`
`
`
`
`
`
`Transmission Control Protocol hosts can occur as multiple
`cations do not disable low-priority Internet applications.
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`hosts reduce their transmission rates. As the congestion
`The key mechanisms for providing a predeterminedlevel
`
`
`
`
`
`
`
`
`
`
`
`
`
`clears, the Transmission Control Protocol sources increase
`of quality-of-service include an admission control,
`traflic
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`their data transmission rates, resulting in waves of conges-
`shaping, packet classification, packet marking and packet
`
`
`
`
`
`
`
`
`
`
`
`
`
`tion followed by periods where the transmission link is not
`
`scheduling. In quality-of-service enabled Internet Protocol
`
`
`
`
`
`
`
`
`
`fully used.
`(“IP”) networks, it is necessary to specifyatraffic profile for
`
`
`
`
`
`
`
`
`
`
`
`
`
`The Random Early Detection mechanism controls the
`a connection or a set of connections. Traffic shaping ortraflic
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`data congestion by dropping or marking packets with a drop
`conditioning is typically used, for example, to control the
`
`
`
`
`
`
`
`rate of data transmitted out of an interface so that it matches
`
`
`
`
`
`
`
`probability. Typically, an algorithm used by the Random
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`Early Detection mechanism may sample a queue length on
`to
`the speed of the remote target interface and, further,
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`a router and compare it
`to two threshold levels, a low
`ensure that the traffic conforms to a predetermined policy
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`threshold level and a high threshold level. For example, if
`level. Thus, traffic shaping is primarily used to control the
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`the queue length is less than the low threshold level, no
`access to available bandwidth, to ensurethattraffic conforms
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`packets are dropped and packets are forwarded to a desti-
`to a predeterminedset of policies, and to regulate the flow
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`nation address. If the queue length is between the low
`of traffic in order to avoid congestion that can occurif the
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`threshold level and the high threshold level, incoming pack-
`transmitted traffic exceeds the access speed of its remote,
`
`
`
`
`
`
`
`
`
`
`ets are dropped with a probability that is directly propor-
`target interface.
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`tional to the queue length, and, if the queue length is greater
`Traffic shaping is typically implemented on an edge router
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`than the high threshold level, all
`incoming packets are
`or core router and provides a mechanism to control the
`
`
`
`
`
`
`
`
`
`
`dropped.
`amount and volume of data being sent into the network as
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`well as the rate at which the data is being sent. The
`The Random Early Detection mechanism reduces the
`
`
`
`
`
`
`
`
`
`
`
`
`
`predominant methods for traffic shaping include a leaky
`chances of tail dropping by selectively dropping packets
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`bucket method and a token bucket method. The leaky bucket
`when,for example, an output interface begins to show signs
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`is typically used to control the rate at which data is sent into
`of congestion. By dropping some packets early rather than
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`the network and provides a mechanism by which bursty data
`waiting until the buffer is full, Random Early Detection
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`can be shaped into a steady data stream. The leaky bucket
`avoids dropping large numbers of packets at once and
`
`
`
`
`
`
`
`
`
`
`
`implementation is typically employed for shaping traffic into
`minimizes the chances of global synchronization.
`Splunk Inc.
`Exhibit 1015
`
`
`
`
`
`20
`
`25
`
`
`
`30
`
`
`
`35
`
`
`
`40
`
`
`
`45
`
`50
`
`
`
`55
`
`
`
`60
`
`
`
`65
`
`
`
`
`
`
`
`
`
`
`Page 9
`
`Splunk Inc. Exhibit 1015 Page 9
`
`

`

`
`3
`
`
`
`
`
`
`
`The Weighted Random Early Detection generally drops
`
`
`
`
`
`
`packets selectively based on IP precedence so that packets
`
`
`
`
`
`
`
`
`
`with a higher IP precedence are less likely to be dropped
`
`
`
`
`
`
`
`than packets with a lower precedence. In such an imple-
`
`
`
`
`
`
`
`
`mentation, higher priority traffic is delivered with a higher
`
`
`
`
`
`
`
`
`probability than lowerpriority traffic. The Weighted Ran-
`
`
`
`
`
`
`
`
`dom Early Detection is more useful in the core routers of a
`
`
`
`
`
`
`
`
`
`
`network, rather than at
`the edge routers that assign IP
`
`
`
`
`
`
`precedence to packets as they enter the network.
`
`
`
`
`
`
`
`
`While the Random Early Detection mechanism and the
`
`
`
`
`
`
`
`
`variation thereof have been widely studied and employed in
`
`
`
`
`
`
`
`
`the existing computer networks, they suffer from a number
`
`
`
`
`
`
`
`of disadvantages. The Random Early Detection mechanism
`
`
`
`
`
`
`
`
`as well as the Weighted Random Early Detection mechanism
`
`
`
`
`
`
`
`
`
`signal
`the source about the congestion by dropping the
`
`
`
`
`
`
`
`
`packets and have the ability to control only a predetermined
`
`
`
`
`
`
`
`type of data, specifically, Transmission Control Protocol
`data.
`
`
`
`
`
`
`
`
`
`Thus, the need remains for a system and methodfortraflic
`
`
`
`shaping in computer networks.
`
`
`
`
`
`
`
`
`
`20
`
`SUMMARY OF THE INVENTION
`
`
`
`
`
`
`
`
`
`
`
`In accordance with embodiments of the present invention,
`
`
`
`
`
`
`
`
`some of the problems associated with traffic shaping are
`overcome.
`
`
`
`
`
`
`
`An embodiment of a method for traffic shaping in a
`
`
`
`
`
`
`
`computer network, according to the present
`invention,
`
`
`
`
`
`
`
`
`
`involves receiving at
`least one data packet on a traflic
`
`
`
`
`
`
`
`
`manager from a user network entity and, responsive thereto,
`
`
`
`
`
`
`
`
`calculating at least one flow control parameter using the at
`
`
`
`
`
`
`
`
`
`
`
`least one data packet from the user network entity. Next, the
`
`
`
`
`
`
`
`
`at least one flow control parameter is compared to at least
`
`
`
`
`
`
`
`three threshold levels including a committed threshold level,
`
`
`
`
`
`
`
`
`
`a control threshold level and a peak threshold level. Accord-
`
`
`
`
`
`
`
`
`ing to one embodiment of the present invention, the traflic
`
`
`
`
`
`
`
`manager includes a traffic shaper. In such an embodiment,
`
`
`
`
`
`
`
`
`
`the method includes calculating a data packet rate on the
`
`
`
`
`
`
`
`
`
`traffic shaper. If a value of the at least one flow control
`
`
`
`
`
`
`
`
`
`parameter, i.e. a data packet r