On the sensitivity of network simulation to topology
暂无分享,去创建一个
[1] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.
[2] Ellen W. Zegura,et al. A quantitative comparison of graph-based models for Internet topology , 1997, TNET.
[3] Vern Paxson,et al. On calibrating measurements of packet transit times , 1998, SIGMETRICS '98/PERFORMANCE '98.
[4] Cathy H. Xia,et al. Clock synchronization algorithms for network measurements , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[5] Matthew Doar,et al. A better model for generating test networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.
[6] V. Jacobson,et al. Congestion avoidance and control , 1988, CCRV.
[7] John Nagle,et al. Congestion control in IP/TCP internetworks , 1995, CCRV.
[8] Sally Floyd,et al. Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic , 1991, CCRV.
[9] Van Jacobson,et al. Traffic phase effects in packet-switched gateways , 1991, CCRV.
[10] QUTdN QeO,et al. Random early detection gateways for congestion avoidance , 1993, TNET.
[11] Donald F. Towsley,et al. Estimation and removal of clock skew from network delay measurements , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[12] SemkeJeffrey,et al. The macroscopic behavior of the TCP congestion avoidance algorithm , 1997 .
[13] Larry L. Peterson,et al. TCP Vegas: new techniques for congestion detection and avoidance , 1994 .
[14] Van Jacobson,et al. A tool to infer characteristics of internet paths , 1997 .
[15] Matthew Mathis,et al. The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.
[16] Mark Handley,et al. Equation-based congestion control for unicast applications , 2000, SIGCOMM.
[17] Kostas G. Anagnostakis,et al. On the Feasibility of Network Delay Tomography Using Only Existing Infrastructure , 2001 .
[18] Kostas G. Anagnostakis,et al. Direct measurement vs. indirect inference for determining network-internal delays , 2002, Perform. Evaluation.
[19] Mark Handley,et al. Equation-based congestion control for unicast applications , 2000, SIGCOMM 2000.
[20] Kostas G. Anagnostakis,et al. cing: measuring network-internal delays using only existing infrastructure , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[21] Srinivasan Keshav,et al. Packet-Pair Flow Control , 2003 .
[22] Ramesh Govindan,et al. Estimating Router ICMP Generation Delays , 2002 .
[23] Sugih Jamin,et al. Inet-3.0: Internet Topology Generator , 2002 .
[24] Ibrahim Matta,et al. BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.
[25] Anoop Gupta,et al. SPLASH: Stanford parallel applications for shared-memory , 1992, CARN.
[26] Sally Floyd,et al. Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.
[27] Anja Feldmann,et al. Dynamics of IP traffic: a study of the role of variability and the impact of control , 1999, SIGCOMM '99.