"On the Self-Similar Nature of Ethernet Traffic" Leland, et. al. IEEE/ACM Transactions on Networking. 11 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
System Administration: Monitoring, Diagnosing, and Repairing - Anderson (Correct)
....indicates a problem. Handling the first part is simple, as the statistics are gathered, we calculate averages, standard deviations, and burst sizes, and other statistical measures [Jain91] One complication that is likely to arise is that many of the measurements will probably be self similar [Lela94]. This means that there will be bursts at all time scales, and that the load will fluctuate greatly over many time scales. However, given that previous SA systems have just used hard coded constants, and that other non SA systems have successfully used adaptation [Jaco88,Karn91, Brak95] we ....
"On the Self-Similar Nature of Ethernet Traffic" Leland, et. al. IEEE/ACM Transactions on Networking. 11
IP Caching For Terabit Speed Routers - Talbot, Sherwood, Lin (Correct)
....3 is a description of our proposed scheme. Section 4 describes our experimental methodology including trace descriptions. Sections 5 and 6 present the results, and section 7 draws final conclusions. 2 Related Work There has been a great deal of work done towards high speed routers as of late [11][6] 5] 2] some of which was directed at fast IP lookup. Two of the schemes which IP Caching draws heavily upon are the Stanford Lookup scheme [4] and IP Switching [10] 2.1 Stanford Lookup The Stanford lookup scheme [4] is built on the idea that when doing a histogram of the actual sizes of ....
"Routing on Longest-Matching Prefixes", Doeringer, Willibald, Karjoth, Gunter, Nassehi, Mehdi, IEEE ACM Transactions On Networking, Vol. 4, No. 1, pp. 86-97, February 1996.
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