ns.bib

柯老师网站上找到的

  month =	 may,
  pages =	 "85--110",
  summary =	 "2 key ideas are ``efficient multi-destination
                  delivery'', and ``robust unknown destination
                  delivery''.  Multicast groups as the indirection
                  between sources and group members,  Reverse Path
                  Forwarding for data delivery, routing protocols, DV
                  and LS to detect group members.",
  keyword =	 "Routing/multicast"
}

@InProceedings{Deer94:Architecture,
  author = 	 "Deering, S. and Estrin, D. and Farinacci, D. and
		  Jacobson, V. and Liu, C-G. and Wei, L.",
  title = 	 "An Architecture for Wise-area Multicast ROuting",
  pages =	 "126--135",
  booktitle =	 p-sigcomm,
  year =	 1994,
  month =	 sep,
  annote =	 "PIM",
  summary =	 "See Deer94a:Architecture"
}

@TechReport{Deer94a:Architecture,
  author = 	 "Deering, S. and Estrin, D. and Farinacci, D. and
		  Jacobson, V. and Liu, Ching-{G}ung and Wei, L.",
  title = 	 "An Architecture for Wise-area Multicast ROuting",
  institution =  "Computer Science Department, University of Southern California",
  year = 	 1994,
  number =	 "USC-SC-94-565",
  address =	 "Los Angeles, CA 90089.",
  summary =	 "Protocol Independent Multicast: A combination of
                  Dense Mode DVMRP-like multicast for local groups,
                  and Sparse Mode, Core-Based-Tree-like multicast for
                  wide area multicast groups",
  keyword =	 "Routing/multicast"
}

@Article{Deme90:Analysis,
  author = 	 "Demers, A. and Keshav, S. and Shenker, S.",
  title = 	 "Analysis and Simulation of a Fair Queueing Algorithm",
  journal =	 joi,
  year =	 1990,
  volume =	 1,
  number =	 1,
  pages =	 "3--26",
  month =	 jan,
  summary =	 "bit-wise implementation of weighted fair queueing,
                  with simulation and analysis.",
  keyword =	 "Network/intserv"
}

@InProceedings{Math96:Forward,
  author =	 "Mathis, M. and Mahdavi, J.",
  title =	 "Forward Acknowledgement: Refining {TCP} Congestion Control",
  booktitle =	 p-sigcomm,
  year =	 1996,
  month =	 aug
}

@Article{Dijk59:Note,
  author = 	 "Dijkstra, E. W.",
  title = 	 "A Note on Two Problems in Connection with Graphs",
  journal =	 "Numerical Mathematics",
  year =	 1959,
  volume =	 1,
  pages =	 "269--271"
}

@Article{Doer96:Routing,
  author = 	 "Doeringer, W. and Karjoth, G. and Nassehi, M.",
  title = 	 "Routing on Longest-Matching Prefixes",
  journal = 	 ton,
  year = 	 1996,
  volume =	 4,
  number =	 1,
  month =	 feb,
  pages =	 "86--97",
  abstract =	 "This article describes the Dynamic Prefix Tries - a
                  novel data structure with algorithms for insertion,
                  deletion and retrieval to build and maintain a
                  dynamic database of binary keys of arbitrary
                  length. These tries extend the concepts of compact
                  digital (Patricia) tries to support the storage of
                  prefixes and to guarantee retrieval times at most
                  linear in the length of the input key irrespective
                  of the trie size, even when searching for
                  longest-matching prefixes. The new design permits
                  very efficient, simple and non-recursive
                  implementations of small code size and minimal
                  storage requirements. Insert and delete operations
                  have strictly local effects, and their particular
                  sequence is irrelevant for the structure of the
                  resulting trie, thus maintaining at all times the
                  desired storage and computational efficiency. The
                  algorithms have been successfully employed in
                  experimental communication systems and products for
                  a variety of networking functions such as address
                  resolution, maintenance and verification of access
                  control lists, and high-performance routing tables
                  in operating system kernels",
  keyword =	 "Trie, binary trie, Patricia trie, dynamic prefix
                  trie, DP-Trie, routing table, address prefixes,
                  longest matching prefix, searches, pattern matching,
                  dictionary, address resolution, access control
                  lists.",
  comments =	 "Talks about patricia trees for route lookup
                  algorithms.  Suggests modifications for delete
                  operations.  Compares via simulation the operation
                  of patricia for fixed length keys with AVL balanced trees."
}

@Article{Dupu90:NEST,
  author = 	 "Dupuy, A. and Schwartz, J. and Yemini, Y. and Bacon, D.",
  title = 	 "{NEST}: A Network Simulation and Prototyping Method",
  journal =	 cacm,
  year =	 1990,
  volume =	 33,
  number =	 10,
  pages =	 "64--74",
  month =	 oct
}

@TechReport{Estr91:Protocol,
  author = 	 "Estrin, D. and Breslau, L. and Zhang, L.",
  title = 	 "Protocol Mechanisms for Adaptive Routing in Global
		  Multimedia Internets",
  institution =  "University of Southern California",
  year = 	 1991,
  number =	 "CS-SYS-91-04",
  month =	 nov
}

@TechReport{Fall95:Simulation-Based,
  author = 	 "Fall, K. and Floyd, S.",
  title = 	 "Simulation-based Comparisons of {T}ahoe, {R}eno, and
		  {SACK} {TCP}",
  institution =  "Lawrence Berkeley Labs",
  year = 	 1995,
  month =	 dec,
  note =	 "Available at \url{ftp://ftp.ee.lbl.gov/papers/sacks.ps.Z}"
}

@Article{Fall96:Simulation-Based,
  author = 	 "Fall, K. and Floyd, S.",
  title = 	 "Simulation-based Comparisons of {T}ahoe, {R}eno, and
		  {SACK} {TCP}",
  journal =	 sigcomm-ccr,
  year =	 1996,
  volume =	 26,
  number =	 3,
  pages =	 "5--21",
  month =	 jul,
  summary =	 " A simulation based comparison of SACK in TCP
                  against Reno and Tahoe flavours in ns.  It shwos
                  that Reno outperforms Tahoe with 1-packet loss, and
                  is comparable to SACK.  With 2 packet loss in a
                  single window, Reno waits for a retransmit timeout
                  and then goes into slow start.   A variant of Reno
                  that stays in the fast retransmit phase performs as
                  well as SACK.  With 3 packet losses in a window,
                  Reno goes into slow start, while the variant
                  sputters and then recovers, and SACK goes along
                  swimmingly. (Hows that for a technical summary? :-)
                  With multiple packet drops, SACK clearly performs
                  better than the other protocols.",
  keyword =	 "Network/real-time"
}

@InProceedings{Floy93:Synchronization,
  author = 	 "Floyd, S. and Jacobson, V.",
  title = 	 "The Synchronization of Periodic Routing Messages",
  booktitle =	 p-sigcomm,
  pages =	 "33--44",
  year =	 1993,
  month =	 sep
}

@InProceedings{BPF93,
  author =	"McCanne, S. and Jacobson, V.",
  title =	"The BSD Packet Filter: A New Architecture for User-level Packet Capture",
  pages =	"259--269",
  year =	1993,
  month =	jan
}

@Article{Floy94:Synchronisation,
  author = 	 "Floyd, S. and Jacobson, V.",
  title = 	 "The Synchronisation of Periodic Routing Messages",
  journal = 	 ton,
  year = 	 1994,
  month =	 apr
}
@Article{Floy94:Synchronization,
  author = 	 "Floyd, S. and Jacobson, V.",
  title = 	 "The Synchronization of Periodic Routing Messages",
  journal =	 ton,
  year =	 1994,
  month =	 apr,
  annote =	 "This paper is an expanded version of
		  \cite{Floy93:Synchronization}"
}

@InProceedings{Floy95:Reliable,
  author = 	 "Floyd, S. and Jacobson, V. and Liu, C. and McCanne,
		  S. and Zhang, L.",
  title = 	 "A Reliable Multicast Framework for Light-weight
		  Sessions and Application Level Framing",
  pages =	 "342--356",
  booktitle =	 p-sigcomm,
  year =	 1995,
  month =	 aug,
  annote =	 "SRM"
}

@Misc{Floy95:Simulator,
  author =	 "Floyd, S.",
  title =	 "Simulator Tests",
  howpublished = "\url{ftp://ftp.ee.lbl.gov/papers/simtests.ps.Z}",
  year =	 1995,
  month =	 jul
}

@TechReport{Floy95a:Reliable,
  institution =  "Lawrence Berkeley Laboratory",
  year = 	 1995,
  crossref =	 "Floy95:Reliable",
  address =	 "University of California, Berkeley, CA 94720",
  month =	 nov,
  note =	 "This is an extended version of \cite{Floy95:Reliable}"
}

@Misc{Floy96:Ns,
  author =	 "Floyd, S.",
  title =	 "Ns Simulator Tests for Class-Based Queueing",
  howpublished = "\url{ftp://ftp.ee.lbl.gov/papers/cbqsims.ps.Z}",
  year =	 1996,
  month =	 feb
}

@Unpublished{Floy96:Phase,
  author = 	 "Floyd, S.",
  title = 	 "Phase Effects in Simulation Studies",
  note = 	 "Personal Communication",
  year =	 1997,
  month =	 aug
}

@Article{Floy97:Reliable,
  author = 	 "Floyd, S. and Jacobson, V. and McCanne, S. and Liu,
		  C-G. and Zhang, L.",
  title = 	 "A Reliable Multicast Framework for Light-weight
		  Sessions and Application Level Framing",
  journal = 	 ton,
  year = 	 1997,
  note =	 "To appear"
}

@Unpublished{FloyXX:Reliable,
  author = 	 "Floyd, S. and Jacobson, V. and McCanne, S. and Liu,
		  C-G. and Zhang, L.",
  title = 	 "A Reliable Multicast Framework for Light-weight
		  Sessions and Application Level Framing",
  note = 	 "Sumbitted to~" # ton
}

@Book{Ford62:Flows,
  author = 	 "Ford, L.R. and Fulkerson, D.R.",
  title = 	 "Flows in Networks",
  publisher = 	 "Princeton University Press",
  year = 	 1962,
  address =	 "Princeton, N.J., U.S.A.",
  summary =	 "Bellman-Ford or Ford-Fulkerson reference"
}

@Unpublished{Halp91:Modifications,
  author = 	 "Halpern, J.M.",
  title = 	 "Modifications of Patricia Trees fir Handling Values
                  with Discontiguous Masks with Emphasis on Internet
                  Routing Applications",
  note = 	 "Pre-publication copy",
  year =	 1991,
  month =	 oct # "~15",
  summary =	 ""
}

@Manual{Heyb89:Netsim,
  title = 	 "Netsim Manual",
  author =	 "Heybey, A.",
  organization = "MIT",
  year =	 1989,
  annote =	 "Netsim"
}

@Article{Hutc91:x-kernel,
  author = 	 "Hutchinson, N.C. and Peterson, L.L.",
  title = 	 "The $x$-kernel: An Architecture for Implementing
		  Network Protocols",
  journal =	 "ieeese",
  year =	 1991,
  volume =	 17,
  number =	 1,
  pages =	 "64--76",
  month =	 jan
}

@InProceedings{Jaco88:Congestion,
  author = 	 "Jacobson, V.",
  title = 	 "Congestion Avoidance and Control",
  booktitle = 	 p-sigcomm,
  year =	 1988,
  month =	 aug,
  address =	 "Stanford, CA, U.S.A.",
  pages =	 "314--329"
}

@Book{Jain91:Art,
  author = 	 "Jain, R.",
  title = 	 "The Art of Computer Systems Performance Analysis",
  publisher = 	 "John Wiley and Sons, Inc.",
  year = 	 1996,
  LOCnumber =	 "LOC: QA76.9.E94J32 1991"
}

@TechReport{Kesh88:REAL,
  author = 	 "Keshav, S.",
  title = 	 "{REAL}: A Network Simulator",
  institution =  "University of California, Berkeley",
  year = 	 1988,
  number =	 "UCB/CSD 88/472"
}

@Article{Klie77:Hierarchical,
  author = 	 "Kleinrock, L. and Kamoun, F.",
  title = 	 "Hierarchical Routing for Large Networks: Performance
		  Evaluation and Optimization",
  journal =	 cn,
  year =	 1977,
  volume =	 1,
  pages =	 "155--174"
}

@InProceedings{Labo97:Internet,
  author = 	 "Labovitz, C. and Malan, G.R. and Jahanian, F.",
  title = 	 "Internet Routing Instability",
  booktitle = 	 p-sigcomm,
  year =	 1997,