ns.bib

柯老师网站上找到的

  organization = "ACM",
  month =	 sep,
  abstract =	 "This paper examines the network inter-domain routing
                  information exchanged between backbone service
                  providers at the major U.S. public Internet exchange
                  points. Internet routing instability, or the rapid
                  fluctuation of network reachability information, is
                  an important problem currently facing the Internet
                  engineering community. High levels of network
                  instability can lead to packet loss, increased
                  network latency and time to convergence. At the
                  extreme, high levels of routing instability have
                  lead to the loss of internal connectivity in
                  wide-area, national networks.  In this paper, we
                  describe several unexpected trends in routing
                  instability, and examine a number of anomalies and
                  pathologies observed in the exchange of inter-domain
                  routing information.  The analysis in this paper is
                  based on data collected from BGP routing messages
                  generated by border routers at five of the Internet
                  core's public exchange points during a nine month
                  period.  We show that the volume of these routing
                  updates is several orders of magnitude more than
                  expected and that the majority of this routing
                  information is redundant, or
                  pathological. Furthermore, our analysis reveals
                  several unexpected trends and ill-behaved systematic
                  properties in Internet routing.  We finally posit a
                  number of explanations for these anomalies and
                  evaluate their potential impact on the Internet
                  infrastructure.",
  location =	 "http://www.merit.edu/ipma/analysis/"
}

@InProceedings{McCa95:Joint,
  author = 	 "McCanne, S. and Vetterli, M.",
  title = 	 "Joint Source/Channel Coding for Multicast Packet Video",
  booktitle =	 proceedings # "~IEEE International Conference on
		  Image Processing",
  year =	 1995,
  address =	 "Washington D.C., U.S.A.",
  month =	 oct
}

@InProceedings{McCa96:Receiver-Driven,
  author = 	 "McCanne, S. and Jacobson, V. and Vetterli, M.",
  title = 	 "Receiver-driven Layered Multicast",
  booktitle = 	 p-sigcomm,
  year =	 1996,
  address =	 "Stanford, CA, U.S.A.",
  month =	 aug,
  pages =	 "117--130"
}

@Misc{McCaXX:nam,
  author =	 "McCanne, S. and Jacobson, V.",
  title =	 "nam---{N}etwork {AN}imator",
  howpublished = "Available from the authors"
}

@Misc{McCaXX:ns,
  author =	 "McCanne, S. and Floyd, S.",
  title =	 "ns---{N}etwork {S}imulator",
  howpublished = "\url{http://www-mash.cs.berkeley.edu/ns/}"
}

@Misc{McCaXX:wb,
  author =	 "McCanne, S. and Jacobson, V.",
  title =	 "wb--{W}hite{b}oard",
  howpublished = "\url{ftp://ftp.ee.lbl.gov/wb.tar.Z}"
}

@Misc{McQu77:Routing,
  author =	 "McQuillan, J.M.",
  title =	 "Routing Algorithms for Computer Networks---A Survey",
  year =	 1977,
  month =	 dec,
  note =	 "presented at the National Telecommunication COnference",
  abstract =	 "Recent developments in routing algorithms for
                  computer networks are summarized in a comprehensive
                  review covering the period 1974--1977.  An
                  explanation of some of the basic concepts in routing
                  is followed by a survey of various network
                  implementations, and a description of the wide
                  variety of recent research activities.  An extensive
                  bibliography is provided."
}

@Unpublished{MuraXX:Introduction,
  author = 	 "Murayama, Y. and Fujiwara, K. and Shimizu, A. and
                  Nakamura, M. and Aikawa, H. and Yoshida, S. and
                  Matsuo, H.",
  title = 	 "An Introduction to Routing by Preference",
  note = 	 "Pre-publication copy",
  summary =	 " "
}

@Article{Park88:Random,
  author = 	 "Park, S.K. and Miller, R.W.",
  title = 	 "Random Number Generation: Good Ones are Hard to Find",
  journal = 	 cacm,
  year = 	 1988,
  volume =	 31,
  number =	 10,
  month =	 oct,
  pages =	 "1192--1201"
}

@Article{Paxs94:Empirically,
  author = 	 "Paxson, V.",
  title = 	 "Empirically-derived Analytic Models of Wide-area
		  {TCP} Connections",
  journal =	 ton,
  year =	 1994,
  volume =	 2,
  number =	 4,
  month =	 aug
}

@Article{Paxs95:Wide,
  author = 	 "Paxson, V. and Floyd, S.",
  title = 	 "Wide Area Traffic: The Failure of Poisson Modeling",
  journal =	 ton,
  year =	 1995,
  volume =	 3,
  number =	 3,
  pages =	 "226-244",
  month =	 jun
}

@Article{Perl85:Hierarchical,
	AUTHOR="Perlman, R.",
	TITLE="Hierarchical Networks and the Subnetwork Partition Problem",
	YEAR=1985,
	JOURNAL=cnis,
	VOLUME=9,
	PAGES="297--303",
	ENTRYBY=Sn
}

@TechReport{Perl88:Layer,
	AUTHOR="Perlman, Radia",
	TITLE="Network Layer Protocols With Byzantine Robustness",
	NUMBER="TR-429",
	INSTITUTION="MIT Laboratory for Computer Science",
	MONTH=oct,
	YEAR=1988,
	TYPE="Technical Report",
	ENTRYBY=ccr
}

@InProceedings{Perl88:Pitfalls,
	AUTHOR="Perlman, R. and Varghese, G.",
	TITLE="Pitfalls in the Design of Distributed Routing Algorithms",
	BOOKTITLE=p-sigcomm,
	ADDRESS="Stanford, CA, U.S.A.",
	YEAR=1988,
	MONTH=aug,
	PAGES="43--54",
	ABSTRACT="The bridge algorithm adopted by the IEEE 802.1
		  committee for interconnecting 802 LANs requires the
		  topology of the extended LAN to be a spanning tree. A
		  distributed algorithm to compute a spanning tree
		  dynamically has already been published and adopted by
		  the IEEE 802.1 committee. In this paper, however, we
		  describe an alternative distributed spanning tree
		  algorithm. This algorithm, variants of which have
		  been implemented, initially appears simpler than the
		  IEEE 802.1 algorithm; we show, however, that it has
		  subtle failure modes that make it unattractive in
		  practice. We also show some failure modes of the
		  spanning tree algorithm introduced in this paper are
		  characteristic of a broader class of distributed
		  graph algorithms. Such algorithms potentially examine
		  all possible path combinations between a source and a
		  destination in a graph. Thus, they suffer from
		  exponential message overhead in topologies that have
		  an exponential number of paths between source and
		  destination. Attempts to fix this problem lead to
		  extra complexity (in terms of CPU, bandwidth, memory)
		  when compared to other algorithms. We briefly
		  describe a second example belonging to this class,
		  and propose that designers avoid such algorithms if
		  restricting the topology or scale of the network is
		  unacceptable.",
	KEYWORDS="spanning tree; LAN interconnection; routing; bridges;
		  complexity",
	NOTE="also in {\em Computer Communication Review} 18 (4), Aug. 1992",
	SUMMARY="The paper describes a design process of developing an
                  algorithm that bridges in a LAN can use to compute
                  spanning trees.  The algorithm must be reliable,
                  robust, and deal with differetn topologies, and
                  failure modes. The paper is more interesting for the
                  design process methodology than the actual
                  algorithms presented.",
	ENTRYBY=Sc
}

@Article{Rekh91:Border,
  author = 	 "Rekhter, Y. and Katz, D.",
  title = 	 "The Border Gateway Protocol",
  journal =	 "ConneXions",
  year =	 1991,
  volume =	 5,
  number =	 1,
  month =	 jan
}

@TechReport{Rekh93:Constraints,
  author = 	 "Rekhter, Y. and Hotz, S. and Estrin, D.",
  title = 	 "Constraints on Forming Clusters with Link-State
		  Hop-by-Hop Routing",
  institution =  "IBM",
  year = 	 1993,
  number =	 "RC 19203 (83635) 10/6/93",
  address =	 "IBM Research Division, T.J.Watson Research Center,
		  YorkTown Heights, NY 10598"
}

@InProceedings{Shar97:Scalable,
  author = 	 "Sharma, P. and Estrin, D. and Floyd, S. and
                  Jacobson, V.",
  title = 	 "Scalable Timers for Soft State Protocols",
  booktitle = 	 p-infocom,
  year =	 1997,
  summary =	 "The paper considers the bandwidth consumed by soft
                  state protocols using fixed perioidic timers to
                  maintain state in intermediate systems.    It
                  observes that the bandwidth is proportional to the
                  state that must be maintained, which can get
                  expensive if the state is large.  It proposes an
                  alternative of maintaining the bandwidth constant,
                  and varying the timers, and discusses the tradeoffs
                  that must be made.",
  keyword =	 "PIM, Exponential Weighted Moving Average (EWMA),
                  Control trffic, Soft State"
}

@TechReport{Thom94:Generation,
  author = 	 "Thomas, M. and Zegura, E.",
  title = 	 "Generation and Analysis of Random Graphs to Model
		  Internetworks",
  institution =  "Georgia Institute of Technology",
  year = 	 1994,
  number =	 "GIT-CC-94-46"
}

@TechReport{Wei95:Multicast,
  author = 	 "Wei, L. and Estrin, D.",
  title = 	 "Multicast Routing in Dense and Sparse Modes:
                  Simulation Study of Tradeoffs and Dynamics",
  institution =  "Department of Computer Science, University of
                  Southern California",
  year = 	 1995,
  number =	 "TR 95-613",
  summary =	 "PIMsim documentation"
}

@InProceedings{Zegu96:How,
  author = 	 "Zegura, E.W. and Calvert, K.L. and Bhattacharjee, S.",
  title = 	 "How to Model an Internetwork",
  booktitle = 	 p-infocom,
  volume =	 3,
  year =	 1996,
  address =	 "San Francisco, CA, U.S.A.",
  month =	 mar,
  pages =	 "594--602",
  LOC_CAT  =	 "TK5105.5 I48 1996 V.3"
}

@Manual{rfc1075,
  author =	"D. Waitzman and C. Partridge and S.E. Deering.",
  title =	"{Distance Vector Multicast Routing Protocol}",
  edition =	"{RFC 1075}",
  year =	1988,
  format =	"TXT=54731 bytes",
  annote =	rfceds
}

@Manual{rfc2018,
  title = 	 "{TCP} Selective Acknowledgement Options",
  author =	 "Mathis, M. and Mahdavi, J. and Floyd, S. and
                  Romanov, A.",
  edition =	 "{RFC 2018}",
  year =	 1996,
  annote =	 rfceds
}

@Misc{wb,
  crossref =	 "McCaXX:wb"
}

@string{usc = "University of Southern California"}
@string{usc-isi = "USC/Information Sciences Institute"}
@string{ieee-computer = "{IEEE} Computer"};

@Article{Ousterhout98a,
	author = 	"John Ousterhout",
	title = 	"Scripting: Higher-Level Programming for the 21st Century",
	journal = 	ieee-computer,
	year = 		1998,
	volume =	31,
	number =	3,
	month =		mar,
	pages =		"23--30",
	location =	"johnh: folder: lang/tcl",
	keywords =	"tcl, recent paper",
	url =		"http://computer.org/computer/co1998/r3023abs.htm",
}

@TechReport{Bajaj99a,
	author = 	"Sandeep Bajaj and Lee Breslau and Deborah
                         Estrin and Kevin Fall and Sally Floyd and
                         Padma Haldar and Mark Handley and Ahmed Helmy
                         and John Heidemann and Polly Huang and Satish
                         Kumar and Steven McCanne and Reza Rejaie and
                         Puneet Sharma and Kannan Varadhan and Ya Xu
                         and Haobo Yu and Daniel Zappala",
	title = "Improving Simulation for Network Research",
	institution = usc,
	year = 1999,
	number =	"99-702b",
	month = mar,
	location =	"johnh: folder: vint",
	keywords =	"vint, ns, nam, network simulation",
	url =		"http://www.isi.edu/~johnh/PAPERS/Bajaj99a.html",
	note = "(revised September 1999)",
	copyrightholder = "author",
	organization =	usc-isi,
	abstract = "None",
}

@InProceedings{legout_sigmetrics2000,
  author = 	 "A. Legout and E.W. Biersack",
  title = 	 "{PLM}: Fast Convergence for Cumulative Layered
                  Multicast Transmission Schemes",
  booktitle =	 proceedings # "~ACM SIGMETRICS",
  year =	 2000,
  address =	 "Santa Clara, CA, U.S.A.",
  month =	 jun
}


Local Variables:
bibtex-maintain-sorted-entries: t
End: