⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 node589.html

📁 相关搜索: ns2仿真结果分析 all-awk ns2 ns2 无限网络中awk文件 ... [2.tcl.rar] - 在ns2平台上实现对AODV协议的模拟
💻 HTML
字号:
<html><!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN"><!--Converted with jLaTeX2HTML 2002 (1.62) JA patch-1.4patched version by:  Kenshi Muto, Debian Project.LaTeX2HTML 2002 (1.62),original version by:  Nikos Drakos, CBLU, University of Leeds* revised and updated by:  Marcus Hennecke, Ross Moore, Herb Swan* with significant contributions from:  Jens Lippmann, Marek Rouchal, Martin Wilck and others --><HTML><HEAD><TITLE>Bibliography</TITLE><META NAME="description" CONTENT="Bibliography"><META NAME="keywords" CONTENT="everything"><META NAME="resource-type" CONTENT="document"><META NAME="distribution" CONTENT="global"><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1"><META NAME="Generator" CONTENT="jLaTeX2HTML v2002 JA patch-1.4"><META HTTP-EQUIV="Content-Style-Type" CONTENT="text/css"><LINK REL="STYLESHEET" HREF="everything.css" tppabs="http://www.isi.edu/nsnam/ns/doc/everything.css"><LINK REL="next" HREF="node590.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node590.html"><LINK REL="previous" HREF="node583.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node583.html"><LINK REL="up" HREF="everything.html" tppabs="http://www.isi.edu/nsnam/ns/doc/everything.html"><LINK REL="next" HREF="node590.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node590.html"></HEAD><BODY ><!--Navigation Panel--><A NAME="tex2html10468"  HREF="node590.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node590.html"><IMG WIDTH="37" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="next" SRC="file:/usr/share/latex2html/icons/next.png"></A> <A NAME="tex2html10462"  HREF="everything.html" tppabs="http://www.isi.edu/nsnam/ns/doc/everything.html"><IMG WIDTH="26" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="up" SRC="file:/usr/share/latex2html/icons/up.png"></A> <A NAME="tex2html10456"  HREF="node588.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node588.html"><IMG WIDTH="63" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="previous" SRC="file:/usr/share/latex2html/icons/prev.png"></A> <A NAME="tex2html10464"  HREF="node1.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node1.html"><IMG WIDTH="65" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="contents" SRC="file:/usr/share/latex2html/icons/contents.png"></A> <A NAME="tex2html10466"  HREF="node590.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node590.html"><IMG WIDTH="43" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="index" SRC="file:/usr/share/latex2html/icons/index.png"></A> <BR><B> Next:</B> <A NAME="tex2html10469"  HREF="node590.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node590.html">Index</A><B> Up:</B> <A NAME="tex2html10463"  HREF="everything.html" tppabs="http://www.isi.edu/nsnam/ns/doc/everything.html">The Manual (formerly Notes</A><B> Previous:</B> <A NAME="tex2html10457"  HREF="node588.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node588.html">42.2 Using NAM for</A> &nbsp <B>  <A NAME="tex2html10465"  HREF="node1.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node1.html">Contents</A></B>  &nbsp <B>  <A NAME="tex2html10467"  HREF="node590.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node590.html">Index</A></B> <BR><BR><!--End of Navigation Panel--><H2><A NAME="SECTION012000000000000000000">Bibliography</A></H2><DL COMPACT><DD><P></P><DT><A NAME="Alae94:Design">1</A><DD>C.&nbsp;Alaettinoglu, A.U. Shankar, K.&nbsp;Dussa-Zeiger, and I.&nbsp;Matta.<BR>Design and implementation of MaRS: A routing testbed.<BR><EM>Internetworking: Research and Experience</EM>, 5:17-41, 1994.<P></P><DT><A NAME="Bajaj99a">2</A><DD>Sandeep Bajaj, Lee Breslau, Deborah Estrin, Kevin Fall, Sally Floyd, Padma  Haldar, Mark Handley, Ahmed Helmy, John Heidemann, Polly Huang, Satish Kumar,  Steven McCanne, Reza Rejaie, Puneet Sharma, Kannan Varadhan, Ya&nbsp;Xu, Haobo Yu,  and Daniel Zappala.<BR>Improving simulation for network research.<BR>Technical Report 99-702b, University of Southern California, March  1999.<BR>(revised September 1999).<P></P><DT><A NAME="Barf98:WebWorkload">3</A><DD>Paul Barford and Mark Crovella.<BR>Generating representative web workloads for network and server  peformance evaluation.<BR>In <EM>Proceedings of the&nbsp;ACM SIGMETRICS</EM>, pages 151-160, June  1998.<P></P><DT><A NAME="Brak94:TCP">4</A><DD>L.S. Brakmo, S.&nbsp;O'Malley, and L.L. Peterson.<BR>TCP vegas: New techniques for congestion detection and avoidance.<BR>In <EM>Proceedings of the&nbsp;ACM SIGCOMM</EM>, pages 24-35, October 1994.<P></P><DT><A NAME="Brak94a:TCP">5</A><DD>L.S. Brakmo, S.&nbsp;O'Malley, and L.L. Peterson.<BR>TCP vegas: New techniques for congestion detection and avoidance.<BR>Technical Report TR 94 04, Department of Computer Science, The  University of Arizona, Tucson, AZ 85721, February 1994.<P></P><DT><A NAME="Brow88:Calendar">6</A><DD>R.&nbsp;Brown.<BR>Calendar queues: A fast O(1) priority queue implementation for the  simulation event set problem.<BR><EM>Communications of the ACM</EM>, 31(10):1220-1227, October 1988.<P></P><DT><A NAME="Cao97:CacheConsistency">7</A><DD>Pei Cao and Chengjie Liu.<BR>Maintaining strong cache consistency in the World-Wide Web.<BR>In <EM>Proceedings of the&nbsp;IEEE ICDCS</EM>, pages 12-21, May 1997. <P></P><DT><A NAME="SCTP_CARO_2003e">8</A><DD> A.&nbsp;Caro, P.&nbsp;Amer, J.&nbsp;Iyengar, and R.&nbsp;Stewart. <BR>Retransmission Policies with Transport Layer Multihoming. <BR>In <EM>ICON 2003</EM>, Sydney, Australia, September 2003. <P></P><DT><A NAME="SCTP_CARO_2003b">9</A><DD> A.&nbsp;Caro, K.&nbsp;Shah, J.&nbsp;Iyengar, P.&nbsp;Amer, and R.&nbsp;Stewart. <BR>SCTP and TCP Variants: Congestion Control Under Multiple Losses. <BR>Tech Report TR2003-04, CIS Dept, University of Delaware, February   2003. <P></P><DT><A NAME="ChLiAb02a">10</A><DD> N.&nbsp;Christin, J.&nbsp;Liebeherr, and T.&nbsp;Abdelzaher. <BR>A quantitative assured forwarding service. <BR>In <EM>Proceedings of IEEE INFOCOM 2002</EM>, volume&nbsp;2, pages   864-873, New York, NY, June 2002.<P></P><DT><A NAME="Deer94a:Architecture">11</A><DD>S.&nbsp;Deering, D.&nbsp;Estrin, D.&nbsp;Farinacci, V.&nbsp;Jacobson, Ching-Gung Liu, and L.&nbsp;Wei.<BR>An architecture for wise-area multicast routing.<BR>Technical Report USC-SC-94-565, Computer Science Department,  University of Southern California, Los Angeles, CA 90089., 1994.<P></P><DT><A NAME="Feldmann99a">12</A><DD>Anja Feldmann, Anna&nbsp;C. Gilbert, Polly Huang, and Walter Willinger.<BR>Dynamics of IP traffic: A study of the role of variability and the  impact of control.<BR>pages 301-313, Cambridge, MA, USA, August 1999.<P></P><DT><A NAME="Floy95:Reliable">13</A><DD>S.&nbsp;Floyd, V.&nbsp;Jacobson, C.&nbsp;Liu, S.&nbsp;McCanne, and L.&nbsp;Zhang.<BR>A reliable multicast framework for light-weight sessions and  application level framing.<BR>In <EM>Proceedings of the&nbsp;ACM SIGCOMM</EM>, pages 342-356, August 1995.<P></P><DT><A NAME="Friis46">14</A><DD>H.&nbsp;T. Friis.<BR>A note on a simple transmission formula.<BR><EM>Proc. IRE</EM>, 34, 1946.<P></P><DT><A NAME="Heyb89:Netsim">15</A><DD>A.&nbsp;Heybey.<BR><EM>Netsim Manual</EM>.<BR>MIT, 1989.<P></P><DT><A NAME="Jain91:Art">16</A><DD>R.&nbsp;Jain.<BR><EM>The Art of Computer Systems Performance Analysis</EM>.<BR>John Wiley and Sons, Inc., 1996.<P></P><DT><A NAME="lecuyer99">17</A><DD>Pierre L'Ecuyer.<BR>Good parameters and implementations for combined multiple recursive  random number generators.<BR><EM>Operations Research</EM>, 47(1):159-164, 1999.<P></P><DT><A NAME="lecuyer-wsc">18</A><DD>Pierre L'Ecuyer.<BR>Software for uniform random number generation: Distinguishing the  good and the bad.<BR>In <EM>Proceedings of the 2001 Winter Simulation Conference</EM>, pages  95-105, December 2001.<P></P><DT><A NAME="lecuyer01">19</A><DD>Pierre L'Ecuyer, Richard Simard, E.&nbsp;Jack Chen, and W.&nbsp;David Kelton.<BR>An object-oriented random number package with many long streams and  substreams.<BR><EM>Operations Research</EM>, 2001.<P></P><DT><A NAME="legout_sigmetrics2000">20</A><DD>A.&nbsp;Legout and E.W. Biersack.<BR>PLM: Fast convergence for cumulative layered multicast transmission  schemes.<BR>In <EM>Proceedings of the&nbsp;ACM SIGMETRICS</EM>, Santa Clara, CA, U.S.A.,  June 2000. <P></P><DT><A NAME="LiCh01">21</A><DD> J.&nbsp;Liebeherr and N.&nbsp;Christin. <BR>JoBS: Joint buffer management and scheduling for differentiated   services. <BR>In <EM>Proceedings of IWQoS 2001</EM>, pages 404-418, Karlsruhe,   Germany, June 2001. <P></P><DT><A NAME="LiCh02">22</A><DD> J.&nbsp;Liebeherr and N.&nbsp;Christin. <BR>Rate allocation and buffer management for differentiated services. <BR><EM>Computer Networks</EM>, 40(1):89-110, September 2002.<P></P><DT><A NAME="Math96:Forward">23</A><DD>M.&nbsp;Mathis and J.&nbsp;Mahdavi.<BR>Forward acknowledgement: Refining TCP congestion control.<BR>In <EM>Proceedings of the&nbsp;ACM SIGCOMM</EM>, August 1996.<P></P><DT><A NAME="rfc2018">24</A><DD>M.&nbsp;Mathis, J.&nbsp;Mahdavi, S.&nbsp;Floyd, and A.&nbsp;Romanov.<BR><EM>TCP Selective Acknowledgement Options</EM>, RFC 2018 edition,  1996.<P></P><DT><A NAME="ns">25</A><DD>S.&nbsp;McCanne and S.&nbsp;Floyd.<BR>ns--Network Simulator.<BR><TT><FONT SIZE="-1">http://www-mash.cs.berkeley.edu/ns/</FONT></TT>.<P></P><DT><A NAME="BPF93">26</A><DD>S.&nbsp;McCanne and V.&nbsp;Jacobson.<BR>The bsd packet filter: A new architecture for user-level packet  capture.<BR>pages 259-269, January 1993.<P></P><DT><A NAME="Ousterhout98a">27</A><DD>John Ousterhout.<BR>Scripting: Higher-level programming for the 21st century.<BR><EM>IEEE Computer</EM>, 31(3):23-30, March 1998.<P></P><DT><A NAME="Park88:Random">28</A><DD>S.K. Park and R.W. Miller.<BR>Random number generation: Good ones are hard to find.<BR><EM>Communications of the ACM</EM>, 31(10):1192-1201, October 1988.<P></P><DT><A NAME="Diffserv">29</A><DD>Peter Pieda, Jeremy Ethridge, Mandeep Baines, and Farhan Shallwani.<BR><EM>A Network Simulator, Differentiated Services Implementation</EM>.<BR>Open IP, Nortel Networks, 2000.<P></P><DT><A NAME="Rappaport96">30</A><DD>T.&nbsp;S. Rappaport.<BR><EM>Wireless communications, principles and practice</EM>.<BR>Prentice Hall, 1996.<P></P><DT><A NAME="rfc1075">31</A><DD>D.&nbsp;Waitzman, C.&nbsp;Partridge, and S.E. Deering.<BR><EM>Distance Vector Multicast Routing Protocol</EM>, RFC 1075  edition, 1988.</DL><P><BR><HR><ADDRESS>2003-09-23</ADDRESS></BODY></HTML>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -