| E. H. Spa#ord. The Internet worm program: An analysis. ACM SIGCOMM Computer Communication Review, 19(1):17--57, January 1989. |
....knowledge they have about tra#c workloads. SPF #adaptive, link state#: is the prototype of link state algorithms with dynamic metric for link costs evaluations. A similar algorithm was implemented in the second version of ARPANET #McQuillan, Richer, Rosen, 1980# and in its successive revisions #Khanna Zinky, 1989#. Our implementation uses the same #ooding algorithm, while link costs are assigned over a discrete scale of 20 values by using the ARPANET hop normalized delay metric 12 #Khanna Zinky, 1989# and the the statistical window average method described in #Shankar, Alaettino#glu, Dussa Zieger, ....
....in the second version of ARPANET #McQuillan, Richer, Rosen, 1980# and in its successive revisions #Khanna Zinky, 1989#. Our implementation uses the same #ooding algorithm, while link costs are assigned over a discrete scale of 20 values by using the ARPANET hop normalized delay metric 12 #Khanna Zinky, 1989# and the the statistical window average method described in #Shankar, Alaettino#glu, Dussa Zieger, Matta, 1992a#. Link costs are computed as weighted averages between short and long term real valued statistics re#ecting the delay #e.g. utilization, queueing and#or transmis 12. The ....
[Article contains additional citation context not shown here]
Khanna, A., & Zinky, J. #1989#. The revised ARPANET routing metric. ACM SIGCOMM Computer Communication Review, 19 #4#, 45#56.
No context found.
E. H. Spa#ord. The Internet worm program: An analysis. ACM SIGCOMM Computer Communication Review, 19(1):17--57, January 1989.
No context found.
TCP in the ANSNET. ACM SIGCOMM Computer Communication Review, 24#5#, October 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC