%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Raj Jain",
%%%     version         = "1.08",
%%%     date            = "19 February 2013",
%%%     time            = "16:27:29 MST",
%%%     filename        = "jain-raj.bib",
%%%     address         = "The Ohio State University
%%%                        Dept of Computer and Information Science
%%%                        2015 Neil Avenue, DL395
%%%                        Columbus, OH 43210-1277
%%%                        USA",
%%%     telephone       = "+1 614 292 3989",
%%%     FAX             = "+1 614 292 2911",
%%%     URL             = "http://www.cis.ohio-state.edu/~jain/",
%%%     checksum        = "45261 2506 12572 120591",
%%%     email           = "jain at acm.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "Traffic Management, Quality of Service,
%%%                        Performance Benchmarking",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a bibliography of publications of
%%%                        Raj Jain.  The companion LaTeX file
%%%                        jain-raj.ltx can be used to typeset
%%%                        this bibliography.
%%%
%%%                        At version 1.08, the year coverage looked
%%%                        like this:
%%%
%%%                             1974 (   1)    1987 (   2)    2000 (   1)
%%%                             1975 (   0)    1988 (   4)    2001 (   1)
%%%                             1976 (   0)    1989 (   4)    2002 (   0)
%%%                             1977 (   0)    1990 (   5)    2003 (   0)
%%%                             1978 (   2)    1991 (   3)    2004 (   1)
%%%                             1979 (   1)    1992 (   3)    2005 (   0)
%%%                             1980 (   0)    1993 (   2)    2006 (   0)
%%%                             1981 (   0)    1994 (   3)    2007 (   0)
%%%                             1982 (   2)    1995 (   9)    2008 (   0)
%%%                             1983 (   0)    1996 (  11)    2009 (   0)
%%%                             1984 (   1)    1997 (  15)    2010 (   1)
%%%                             1985 (   2)    1998 (   7)    2011 (   1)
%%%                             1986 (   5)    1999 (   1)
%%%                             19xx (   2)
%%%
%%%                             Article:         36
%%%                             Book:             5
%%%                             InProceedings:   26
%%%                             PhdThesis:        1
%%%                             Proceedings:     11
%%%                             TechReport:      11
%%%
%%%                             Total entries:   90
%%%
%%%                        This file is available as part of the BibNet
%%%                        Project.  The master copy is available for
%%%                        public access on ftp.math.utah.edu in the
%%%                        directory tree /pub/bibnet/authors.  It is
%%%                        mirrored to netlib.bell-labs.com in the directory
%%%                        tree /netlib/bibnet/authors, from which it is
%%%                        available via anonymous ftp and the Netlib
%%%                        service.
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================

%%% ====================================================================
%%% Acknowledgment abbreviations:

@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Journal abbreviations:

@String{j-CACM                  = "Communications of the ACM"}

@String{j-COMP-COMM             = "Computer Communications"}

@String{j-COMP-COMM-REV         = "Computer Communications Review, ACM SIGCOMM"}

@String{j-COMP-NET-AMSTERDAM    = "Computer Networks (Amsterdam, Netherlands:
                                  1999)"}

@String{j-COMP-NET-ISDN         = "Computer Networks and ISDN Systems"}

@String{j-DEC-TECH-J            = "Digital Technical Journal"}

@String{j-GOV-COMP-NEWS         = "Government computer news"}

@String{j-IEEE-COMM-MAG         = "IEEE Communications Magazine"}

@String{j-IEEE-J-SEL-AREAS-COMMUN = "IEEE Journal on Selected Areas in Communications"}

@String{j-IEEE-LTS              = "IEEE Lightwave Telecommunication Systems"}

@String{j-IEEE-NETWORK          = "IEEE network"}

@String{j-IEEE-TRANS-COMM       = "IEEE Transactions on Communications"}

@String{j-IEEE-TRANS-NETWORKING = "IEEE\slash ACM Transactions on Networking"}

@String{j-INT-J-SATELL-COMMUN   = "International Journal of Satellite
                                  Communications"}

@String{j-INTERNETWORKING       = "Internetworking: Research and Experience"}

@String{j-LIGHTWAVE-TECHNOL     = "Journal of lightwave technology"}

@String{j-NETWORK-WORLD         = "Network World"}

@String{j-PERF-EVAL             = "Performance Evaluation"}

@String{j-TOCS                  = "ACM Transactions on Computer Systems"}

%%% ====================================================================
%%% Publisher abbreviations:

@String{pub-ACM                 = "ACM Press"}
@String{pub-ACM:adr             = "New York, NY 10036, USA"}

@String{pub-AW                  = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}
@String{pub-AW:adr              = "Reading, MA, USA"}

@String{pub-IEEE                = "IEEE Computer Society Press"}
@String{pub-IEEE:adr            = "1109 Spring Street, Suite 300,
                                  Silver Spring, MD 20910, USA"}

@String{pub-NBS                 = "U.S. National Bureau of Standards"}
@String{pub-NBS:adr             = "Gaithersburg, MD, USA"}

@String{pub-PEARSON-PH          = "Pearson Pren{\-}tice Hall"}
@String{pub-PEARSON-PH:adr      = "Upper Saddle River, NJ 07458, USA"}

@String{pub-WILEY-INTERSCIENCE  = "Wiley-In{\-}ter{\-}sci{\-}ence"}
@String{pub-WILEY-INTERSCIENCE:adr = "New York, NY, USA"}

%%% ====================================================================
%%% Bibliography entries:

@InProceedings{Jain:1974:MLC,
  author =       "R. Jain",
  booktitle =    "Proc. Symposium on Industrial Automation, Bangalore,
                 India",
  title =        "Models of {LD} Converter for its Automation",
  publisher =    "????",
  address =      "????",
  pages =        "??--??",
  month =        jun,
  year =         "1974",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  annote =       "REPORTS (Released for External Distribution)",
}

@InProceedings{Jain:1978:CTA,
  author =       "R. Jain",
  title =        "Control-theoretic Approach to Computer Systems
                 Performance Improvement",
  crossref =     "Weatherbee:1978:CPE",
  pages =        "93--100",
  year =         "1978",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
}

@Book{Jain:1979:CTF,
  author =       "Rajendra K. Jain",
  title =        "Control-theoretic Formulation of Operating Systems
                 Resource Management Policies",
  publisher =    "Garland Publishing Company",
  address =      "New York, NY, USA",
  pages =        "215",
  year =         "1979",
  ISBN =         "0-8240-4402-9",
  ISBN-13 =      "978-0-8240-4402-2",
  LCCN =         "QA76.9.E94J34 1980",
  bibdate =      "Tue Aug 18 08:27:07 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "Originally presented as the author's thesis, Harvard
                 University, 1978.",
  series =       "Outstanding Dissertations in the Computer Sciences
                 Series",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jain:1982:WCU,
  author =       "R. Jain and R. Turner",
  title =        "Workload Characterization Using Image Accounting",
  crossref =     "Wilson:1982:PCP",
  pages =        "111--120",
  year =         "1982",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
}

@TechReport{Jain:1984:QMF,
  author =       "R. Jain and D. Chiu and W. Hawe",
  title =        "A Quantitative Measure of Fairness and Discrimination
                 for Resource Allocation in Shared Computer Systems",
  type =         "DEC Research Report",
  number =       "TR-301",
  institution =  "Digital Equipment Corporation",
  address =      "Maynard, MA, USA",
  pages =        "38",
  month =        sep,
  year =         "1984",
  bibdate =      "Tue Aug 18 09:05:39 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "ftp://ftp.netlab.ohio-state.edu/pub/jain/papers/fairness.htm",
}

@Article{Jain:1985:ADC,
  author =       "Raj Jain and Imrich Chlamtac",
  title =        "The {$P^2$} Algorithm for Dynamic Calculation of
                 Quantiles and Histograms Without Storing Observations",
  journal =      j-CACM,
  volume =       "28",
  number =       "10",
  pages =        "1076--1085",
  month =        oct,
  year =         "1985",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 06:52:29 MST 2001",
  bibsource =    "and
                 ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1985.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm28.html#JainC85;
                 http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0001-0782/4378.html",
  acknowledgement = ack-nhfb,
  descriptors =  "Statistics; time series analysis",
  keywords =     "algorithms; image processing; measurement; quality",
  oldlabel =     "JainC85",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Statistical computing. {\bf I.6.m}:
                 Computing Methodologies, SIMULATION AND MODELING,
                 Miscellaneous. {\bf J.7}: Computer Applications,
                 COMPUTERS IN OTHER SYSTEMS, Real time.",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/JainC85",
}

@TechReport{Jain:1985:COP,
  author =       "R. Jain",
  title =        "On Caching Out-of-Order Packets in Window Flow
                 Controlled Network",
  type =         "DEC Research Report",
  number =       "DEC-TR-342",
  institution =  "Eastern Research Laboratory, Digital Equipment
                 Corporation",
  address =      "77 Reed Road, Hudson, MA 01749, USA",
  pages =        "8",
  month =        sep,
  year =         "1985",
  bibdate =      "Tue Aug 18 09:05:39 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
}

@InProceedings{Zabih:1986:PCW,
  author =       "Ramin Zabih and Raj Jain",
  booktitle =    "{CSC '86: Proceedings of the 1986 ACM fourteenth
                 annual conference on Computer science, February 1986}",
  title =        "A performance comparison of the window systems of two
                 {LISP} machines (abstract)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "458--458",
  year =         "1986",
  DOI =          "http://dx.doi.org/10.1145/324634.325139",
  ISBN =         "0-89791-177-6",
  ISBN-13 =      "978-0-89791-177-1",
  LCCN =         "????",
  bibdate =      "Wed Sep 28 16:52:14 2011",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jain:1986:DTA,
  author =       "R. Jain",
  booktitle =    "Proceedings of the 5th IEEE Phoenix Conference on
                 Computers and Communication",
  title =        "Divergence of Timeout Algorithms for Packet
                 Retransmissions",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "174--179",
  month =        mar,
  year =         "1986",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
}

@Article{Jain:1986:PAM,
  author =       "R. Jain and W. R. Hawe",
  title =        "Performance Analysis and Modeling of {Digital}'s
                 {Networking Architecture}",
  journal =      j-DEC-TECH-J,
  volume =       "1",
  number =       "3",
  pages =        "25--34",
  month =        sep,
  year =         "1986",
  CODEN =        "DTJOEL",
  ISSN =         "0898-901X",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
}

@Article{Jain:1986:PTM,
  author =       "R. Jain and S. Routhier",
  title =        "Packet Trains-Measurements and a New Model for
                 Computer Network Traffic",
  journal =      j-IEEE-J-SEL-AREAS-COMMUN,
  volume =       "SAC-4",
  number =       "6",
  pages =        "986--995",
  month =        sep,
  year =         "1986",
  CODEN =        "ISACEM",
  ISSN =         "0733-8716 (print), 1558-0008 (electronic)",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "Reprinted in Amit Bhargava, Ed., {\em Integrated
                 Broadband Networks}, Artech House, Norwood, MA, 1990.",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/train.htm",
  abstract =     "Traffic measurements on a ring local area computer
                 network at the Massachusetts Institute of Technology
                 are presented. The analysis of the arrival pattern
                 shows that the arrival processes are neither Poisson
                 nor compound Poisson. An alternative model called
                 ``Packet Train'' is proposed.\par

                 In the train model, the traffic on the network consists
                 of a number of packet streams between various pairs of
                 nodes on the network. Each node-pair stream (or
                 node-pair process, as we call them) consists of a
                 number of trains. Each train consists of a number of
                 packets (or cars) going in either direction (from node
                 A to B or from node B to A). The intercar gap is large
                 (compared to packet transmission time) and random. The
                 intertrain time is even larger. The Poisson and the
                 compound Poisson arrivals are shown to be special cases
                 of the train arrival model.\par

                 Another important observation is that the packet
                 arrivals exhibit a ``source locality.'' If a packet is
                 seen on the network going from A to B, the probability
                 of the next packet going from A to B or from B to A is
                 very high.\par

                 Implications of the train arrivals and of source
                 locality on the design of bridges, gateways, and
                 reservation protocols are discussed. A number of open
                 problems requiring development of analysis techniques
                 for systems with train arrival processes are also
                 described.",
}

@Article{Jain:1986:TBC,
  author =       "R. Jain",
  title =        "A Timeout Based Congestion Control Scheme for Window
                 Flow- Controlled Networks",
  journal =      j-IEEE-J-SEL-AREAS-COMMUN,
  volume =       "SAC-4",
  number =       "7",
  pages =        "1162--1167",
  month =        oct,
  year =         "1986",
  CODEN =        "ISACEM",
  ISSN =         "0733-8716 (print), 1558-0008 (electronic)",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "Reprinted in C. Partridge, Ed., {\em Innovations in
                 Internetworking}, 289--295, Artech House, Norwood, MA
                 1988",
}

@TechReport{Jain:1987:CAC,
  author =       "R. Jain and K. Ramakrishnan and D. Chiu",
  title =        "Congestion Avoidance in Computer Networks with a
                 Connectionless Network Layer",
  number =       "DEC-TR-506",
  institution =  "DEC",
  pages =        "17",
  year =         "1987",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "DEC-TR-506, reprinted in C. Partridge, Ed., {\em
                 Innovations in Internetworking}, 140--156, published by
                 Artech House, October 1988.",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/cr5.htm",
  abstract =     "Widespread use of computer networks and the use of
                 varied technology for the interconnection of computers
                 has made congestion a significant problem.\par

                 In this report, we summarize our research on congestion
                 avoidance. We compare the concept of congestion
                 avoidance with that of congestion control.\par

                 Briefly, congestion control is a recovery mechanism,
                 while congestion avoidance is a prevention mechanism. A
                 congestion control scheme helps the network to recover
                 from the congestion state while a congestion avoidance
                 scheme allows a network to operate in the region of low
                 delay and high throughput with minimal queuing, thereby
                 preventing it from entering the congested state in
                 which packets are lost due to buffer shortage.\par

                 A number of possible alternatives for congestion
                 avoidance were identified. From these alternatives we
                 selected one called the binary feedback scheme in which
                 the network uses a single bit in the network layer
                 header to feed back the congestion information to its
                 users, which then increase or decrease their load to
                 make optimal use of the resources. The concept of
                 global optimality in a distributed system is defined in
                 terms of efficiency and fairness such that they can be
                 independently quantified and apply to any number of
                 resources and users.\par

                 The proposed scheme has been simulated and shown to be
                 globally efficient, fair, responsive, convergent,
                 robust, distributed, and configuration-independent.",
}

@TechReport{Ramakrishnan:1987:CAC,
  author =       "K. K. Ramakrishnan and D. Chiu and R. Jain",
  title =        "Congestion Avoidance in Computer Networks with a
                 Connectionless Network Layer, Part {IV}: {A} Selective
                 Binary Feedback Scheme for General Topologies",
  number =       "DEC-TR-510",
  institution =  "DEC",
  pages =        "43",
  month =        aug,
  year =         "1987",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "ftp://ftp.netlab.ohio-state.edu/pub/jain/papers/dectr510.pdf",
}

@InProceedings{Jain:1988:CAC,
  author =       "R. Jain and K. Ramakrishnan",
  title =        "Congestion Avoidance in Computer Networks with {A}
                 Connectionless Network Layer: Concepts, Goals, and
                 Methodology",
  crossref =     "IEEE:1988:CNS",
  pages =        "134--143",
  year =         "1988",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
}

@InProceedings{Ramakrishnan:1988:BFS,
  author =       "K. Ramakrishnan and R. Jain",
  title =        "A Binary Feedback Scheme for Congestion Avoidance in
                 Computer Networks with Connectionless Network Layer",
  crossref =     "ACM:1988:ASS",
  pages =        "303--313",
  year =         "1988",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "Selected as the best paper.",
}

@Article{Chiu:1989:AID,
  author =       "Dah-Ming Chiu and Raj Jain",
  title =        "Analysis of the Increase\slash Decrease Algorithms for
                 Congestion Avoidance in Computer Networks",
  journal =      j-COMP-NET-ISDN,
  volume =       "17",
  number =       "1",
  pages =        "1--14",
  month =        jun,
  year =         "1989",
  CODEN =        "CNISE9",
  ISSN =         "0169-7552 (print), 1879-2324 (electronic)",
  bibdate =      "Sat Sep 25 23:08:50 MDT 1999",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/Bibnet/authors/j/jain-raj.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Digital Equipment Corp",
  affiliationaddress = "Littleton, USA",
  classification = "721; 722; 723; 921; 922",
  journalabr =   "Comput Networks ISDN Syst",
  keywords =     "Computer Networks; Computers, Digital--Data
                 Communication Systems; Congestion Avoidance; Flow
                 Control; Mathematical Techniques--Algorithms;
                 Probability--Queueing Theory; Resource Management",
  xxtitle =      "Analysis of the increase and decrease algorithms for
                 congestion avoidance in computer networks",
}

@Article{Jain:1989:CDA,
  author =       "R. Jain",
  title =        "Characteristics of Destination Address Locality in
                 Computer Networks: {A} Comparison of Caching Schemes",
  journal =      j-COMP-NET-ISDN,
  volume =       "18",
  pages =        "243--254",
  year =         "1989\slash 1990",
  CODEN =        "CNISE9",
  ISSN =         "0169-7552 (print), 1879-2324 (electronic)",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/cache_ps.htm",
  abstract =     "The size of computer networks, along with their
                 bandwidths, is growing exponentially. To support these
                 large, high-speed networks, it is necessary to be able
                 to forward packets in a few microseconds. One part of
                 the forwarding operation consists of searching through
                 a large address database. This problem is encountered
                 in the design of bridges, routers, gateways and name
                 servers.\par

                 Caching can reduce the lookup time if there is a
                 locality in the address reference pattern. Using a
                 destination reference trace measured on an extended
                 local are a network, we attempt to see if the
                 destination references do have a significant
                 locality.\par

                 We compared the performance of MIN, LRU, FIFO, and
                 random cache replacement algorithms. We found that the
                 interactive (terminal) traffic in our sample had quite
                 different locality behavior than that of the
                 noninteractive traffic. The interactive traffic did not
                 follow the LRU stack model while the noninteractive
                 traffic did. Examples are shown of the environments in
                 which caching can help as well as those in which
                 caching can hurt, unless the cache size is large.",
}

@TechReport{Jain:1989:CHS,
  author =       "Raj Jain",
  key =          "Jain:1989:CHS",
  title =        "A Comparison of Hashing Schemes for Address Lookup in
                 Computer Networks",
  number =       "DEC-TR-593",
  institution =  "Digital Equipment Corporation",
  pages =        "??",
  month =        feb,
  year =         "1989",
  bibdate =      "Thu Jul 21 08:50:43 1994",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  acknowledgement = ack-nhfb,
}

@Article{Jain:1989:DBA,
  author =       "R. Jain",
  title =        "A Delay Based Approach for Congestion Avoidance in
                 Interconnected Heterogeneous Computer Networks",
  journal =      j-COMP-COMM-REV,
  volume =       "??",
  number =       "??",
  pages =        "56--71",
  month =        oct,
  year =         "1989",
  CODEN =        "CCRED2",
  ISSN =         "0146-4833",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/delay.htm",
  abstract =     "In heterogeneous networks, achieving congestion
                 avoidance is difficult because the congestion feedback
                 from one subnetwork may have no meaning to source on
                 other subnetworks. We propose using changes in
                 round-trip delay as an implicit feedback. Using a
                 black-box model of the network, we derive an expression
                 for the optimal window as a function of the gradient of
                 the delay-window curve.\par

                 The problems of selfish optimum and social optimum are
                 also addressed. It is shown that without a careful
                 design, it is possible to get into a race condition
                 during heavy congestion, where each user wants more
                 resources than others, thereby leading to a diverging
                 congestion.\par

                 It is shown that congestion avoidance using round trip
                 delay is a promising approach. The aproach has the
                 advantage that there is absolutely no overhead for the
                 network itself. It is exemplified by a simple scheme.
                 The performance of the scheme is analyzed using a
                 simulation model. The scheme is shown to be efficient,
                 fair, convergent and adaptive to changes in network
                 configuration.\par

                 The scheme as described works only for networks that
                 can ne modelled with queueing servers with constant
                 service times. Further research is required to extend
                 it for implementation in practical networks. Several
                 directions for future research have been suggested.",
}

@Article{Ramakrishnan:1990:BFS,
  author =       "K. K. Ramakrishnan and R. Jain",
  title =        "A Binary Feedback Scheme for Congestion Avoidance in
                 Computer Networks",
  journal =      j-TOCS,
  volume =       "8",
  number =       "2",
  pages =        "158--181",
  month =        may,
  year =         "1990",
  CODEN =        "ACSYEC",
  ISSN =         "0734-2071 (print), 1557-7333 (electronic)",
  bibdate =      "Wed Jan 13 18:36:53 MST 1999",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tocs/",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tocs/1990-8-2/p158-ramakrishnan/",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; performance",
  subject =      "{\bf C.2.1} Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Network Architecture
                 and Design, Network communications. {\bf C.2.3}
                 Computer Systems Organization, COMPUTER-COMMUNICATION
                 NETWORKS, Network Operations, Network monitoring. {\bf
                 C.2.2} Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Network Protocols.",
}

@Article{Jain:1990:CCC,
  author =       "R. Jain",
  title =        "Congestion Control in Computer Networks: Trends and
                 Issues",
  journal =      j-IEEE-NETWORK,
  pages =        "24--30",
  month =        may,
  year =         "1990",
  ISSN =         "0890-8044",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/cong_trends.htm",
  abstract =     "Popular myths that cheaper memory, high-speed links
                 and high-speed processors will solve the problem of
                 congestion in computer networks are shown to be false.
                 A simple definition for congestion based on supply and
                 demand of resources is proposed and is then used to
                 classify various congestion schemes. The issues that
                 make the congestion problem a difficult one are
                 discussed, and then the architectural decisions that
                 affect the design of a congestion scheme are presented.
                 It is argued that long-, medium- and short-term
                 congestion problems require different solutions. Some
                 of the recent schemes are briefly surveyed, and areas
                 for further research are discussed.",
}

@Article{Jain:1990:ECF,
  author =       "R. Jain",
  title =        "Error Characteristics of Fiber Distributed Data
                 Interface ({FDDI})",
  journal =      j-IEEE-TRANS-COMM,
  volume =       "38",
  number =       "8",
  pages =        "1224--1252",
  month =        aug,
  year =         "1990",
  CODEN =        "IECMBT",
  ISSN =         "0090-6778 (print), 1558-0857 (electronic)",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/xie1.htm",
  abstract =     "Fiber Distributed Data Interface (FDDI) is a 100
                 megabits per second fiber optic local area network
                 (LAN) standard being developed by the American National
                 Standard Institute (ANSI).\par

                 We analyze the impact of various design decisions on
                 the error detection capability of the protocol. In
                 particular, we quantify frame error rate, token loss
                 rate, and undetected error rate. Several
                 characteristics of the 32-bit frame check sequence
                 (FCS) polynomial, which is also used in IEEE 802 LAN
                 protocols, are discussed.\par

                 The standard uses a ``non-return to zero invert on
                 ones'' (NRZI) signal encoding and a 4 bit-to-5 bit
                 (4B/5B) symbol encoding in the physical layer. Due to
                 the combination of NRZI and 4B/5B encoding, many noise
                 events are detected by code (or symbol) violations. A
                 large percentage of errors is also detected by framing
                 violations. Some of the remaining errors are detected
                 by FCS violations. The errors that escape these three
                 violations remain undetected. The probability of
                 undetected errors due to creation of false starting
                 delimiters, false ending delimiters, or merging of two
                 frames is analyzed.\par

                 It is shown that every noise event results in two
                 code-bit errors, which in turn may result in up to four
                 data-bit errors. The FCS can detect up to two noise
                 events. Creation of a false starting delimiter or
                 ending delimiter on a symbol boundary also requires two
                 noise events. This assumes enhanced frame validity
                 criteria. We justify the enhancements by quantifying
                 their effect.\par

                 This analysis here is limited to noise events not
                 resulting in a change of symbol boundaries. Extensions
                 to the case of changed symbol boundaries is continuing
                 and will be presented at a later time.",
}

@Article{Jain:1990:PAFa,
  author =       "R. Jain",
  title =        "Performance Analysis of {FDDI} Token Ring Networks:
                 Effect of Parameters and Guidelines for Setting
                 {TTRT}",
  journal =      j-IEEE-LTS,
  volume =       "20",
  number =       "2",
  pages =        "16--22",
  month =        may,
  year =         "1990",
  CODEN =        "IELTEU",
  ISSN =         "1055-6877",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "Also in Proceedings ACM SIGCOMM'90, Philadelphia, PA,
                 September 24--27, 1990, pp. 264--275 (Computer
                 communication review, Vol. 20, No. 4)",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/ttrt_lcs_1col.htm",
  abstract =     "The performance of Fiber-Distributed Data Interface
                 (FDDI) depends upon several workload parameters; for
                 example; the arrival pattern, frame size, and
                 configuration parameters, such as the number of
                 stations on the ring, extent of the ring, and number of
                 stations that are waiting to transmit. In addition, the
                 performance is affected by a parameter called the
                 Target Token Rotation Time (TTRT), which can be
                 controlled by the network manager. We considered the
                 effect of TTRT on various performance metrics for
                 different ring configurations and concluded that a TTRT
                 value of 8 ms provides a good performance over a wide
                 range of configurations and workloads.",
}

@Article{Jain:1990:PAFb,
  author =       "R. Jain",
  title =        "Performance Analysis of {FDDI} Token Ring Networks:
                 Effect of Parameters and Guidelines for Setting
                 {TTRT}",
  journal =      j-COMP-COMM-REV,
  volume =       "20",
  number =       "4",
  pages =        "264--275",
  month =        sep,
  year =         "1990",
  CODEN =        "CCRED2",
  DOI =          "http://dx.doi.org/10.1145/99508.99563",
  ISBN =         "0-89791-405-8",
  ISBN-13 =      "978-0-89791-405-5",
  ISSN =         "0146-4833",
  bibdate =      "Tue Aug 18 08:13:25 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  acknowledgement = ack-nhfb,
}

@Article{Jain:1991:ACSa,
  author =       "R. Jain",
  title =        "The Art of Computer Systems Performance Analysis",
  journal =      j-COMP-COMM,
  volume =       "14",
  number =       "4",
  pages =        "253--??",
  month =        may,
  year =         "1991",
  CODEN =        "COCOD7",
  ISSN =         "0140-3664 (print), 1873-703X (electronic)",
  bibdate =      "Tue Aug 18 08:27:07 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  acknowledgement = ack-nhfb,
}

@Book{Jain:1991:ACSb,
  author =       "R. Jain",
  title =        "The Art of Computer Systems Performance Analysis:
                 Techniques for Experimental Design, Measurement,
                 Simulation, and Modeling,",
  publisher =    pub-WILEY-INTERSCIENCE,
  address =      pub-WILEY-INTERSCIENCE:adr,
  pages =        "xxvii + 685",
  month =        may,
  year =         "1991",
  ISBN =         "0-471-50336-3",
  ISBN-13 =      "978-0-471-50336-1",
  LCCN =         "QA76.9.E94J32 1991",
  bibdate =      "Tue Aug 18 08:27:07 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "Winner of ``1991 Best Advanced How-To Book, Systems''
                 award from the Computer Press Association.",
  acknowledgement = ack-nhfb,
}

@Article{Jain:1991:PAH,
  author =       "Raj Jain",
  title =        "Performance Analysis of a High-Speed {FDDI} Adapter",
  journal =      j-DEC-TECH-J,
  volume =       "3",
  number =       "3",
  pages =        "1--11 (??)",
  month =        "Summer",
  year =         "1991",
  CODEN =        "DTJOEL",
  ISSN =         "0898-901X",
  bibdate =      "Mon Jun 24 18:53:12 1996",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "ftp://ftp.digital.com/pub/Digital/info/DTJ/v3n3/Performance_Analysis_of_FDDIgh_01apr1992DTJ307P8.ps",
  abstract =     "The performance of an FDDI LAN depends upon
                 configuration and workload parameters such as the
                 extent of the ring, the number of stations on the ring,
                 the number of stations that are waiting to transmit,
                 and the frame size. In addition, one key parameter that
                 network managers can control to improve performance is
                 the target token rotation time (TTRT). Analytical
                 modeling and simulation methods were used to
                 investigate the effect of the TTRT on various
                 performance metrics for different ring configurations.
                 This analysis demonstrated that setting the TTRT at 8
                 milliseconds provides good performance over a wide
                 range of configurations and workloads.",
  acknowledgement = ack-nhfb,
  xxtitle =      "Performance Analysis of {FDDI}",
}

@TechReport{Jain:1992:CHSa,
  author =       "R. Jain",
  title =        "A Comparison of Hashing Schemes for Address Lookup in
                 Computer Networks",
  institution =  "DEC",
  pages =        "17",
  year =         "1992",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/hash_ps.htm",
  annote =       "This is a more detailed version of the paper with the
                 same title published in the IEEE Transactions on
                 Communications, October 1992.",
}

@Article{Jain:1992:CHSb,
  author =       "R. Jain",
  title =        "A Comparison of Hashing Schemes for Address Lookup in
                 Computer Networks",
  journal =      j-IEEE-TRANS-COMM,
  volume =       "40",
  number =       "3",
  pages =        "1570--1573",
  month =        oct,
  year =         "1992",
  CODEN =        "IECMBT",
  ISSN =         "0090-6778 (print), 1558-0857 (electronic)",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/hash_ieee_2col.htm",
  abstract =     "Using a trace of address references, we compared the
                 efficiency of several different hashing functions, such
                 as cyclic redundancy checking (CRC) polynomials,
                 Fletcher checksum, folding of address octets using the
                 exclusive-or operation and bit extraction from the
                 address. Guidelines are provided for determining the
                 size of the hashmark required to achieve a specified
                 level of performance.",
}

@Article{Jain:1992:MAC,
  author =       "R. Jain",
  title =        "Myths about Congestion Management in High Speed
                 Networks",
  journal =      j-INTERNETWORKING,
  volume =       "3",
  number =       "??",
  pages =        "101--113",
  month =        "????",
  year =         "1992",
  CODEN =        "IREEE7",
  ISSN =         "1049-8915",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/cong_myths.htm",
  abstract =     "Weaknesses in several recently proposed ideas about
                 congestion control and avoidance in high-speed networks
                 are identified. Both sides of the debate concerning
                 prior reservation of resources versus walk-in service,
                 open-loop control versus feedback control, rate control
                 versus window control, and router-based control versus
                 source-based control are presented. The circumstances
                 under which backpressure is useful or not are
                 discussed, and it is argued that a single congestion
                 scheme is not sufficient, but that a combination of
                 several schemes is required for complete congestion
                 management in a network.",
}

@Article{Alexander:1993:PCW,
  author =       "S. B. Alexander and R. S. Bondurant and D. Byrne and
                 V. W. S. Chan and S. G. Finn and others",
  title =        "A Precompetitive Consortium on Wide-Band All-Optical
                 Networks",
  journal =      j-LIGHTWAVE-TECHNOL,
  volume =       "11",
  number =       "5--6",
  pages =        "714--735",
  month =        may # "\slash " # jun,
  year =         "1993",
  CODEN =        "JLTEDG",
  ISSN =         "0733-8724 (print), 1558-2213 (electronic)",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "Special issue on broad-band optical networks.",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/aon.zip",
  abstract =     "This paper represents the technical core of a
                 pre-competitive consortium formed by AT&T, DEC and MIT
                 to study the technology, architecture and applications
                 of wide-band all-optical networks of local to national
                 (or international) extent. This effort is currently
                 partially sponsored by the Defence Advanced Research
                 Projects Agency (DARPA). Sections I and II of this
                 paper provide a general introduction to all-optical
                 networks and discuss some proposed applications.
                 Sections III, IV and V cover the architecture,
                 technology and test-bed portions of our effort.",
  annote =       "This paper has 23 authors.",
}

@Article{Jain:1993:FCI,
  author =       "R. Jain",
  title =        "{FDDI}: Current Issues and Future Trends",
  journal =      j-IEEE-COMM-MAG,
  volume =       "31",
  number =       "9",
  pages =        "98--105",
  month =        sep,
  year =         "1993",
  CODEN =        "ICOMD9",
  ISSN =         "0163-6804",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/gmu_paper.htm",
  abstract =     "Key issues in upcoming FDDI standards including
                 low-cost fiber, twisted-pair, SONET mapping, and FDDI
                 follow-on LAN are discussed after a brief introduction
                 to FDDI and FDDI-II",
}

@Book{Jain:1994:FH,
  author =       "Raj Jain",
  title =        "{FDDI} Handbook: High-speed Networking using Fiber and
                 Other Media",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxvii + 528",
  year =         "1994",
  ISBN =         "0-201-56376-2",
  ISBN-13 =      "978-0-201-56376-4",
  LCCN =         "TK5105.72 .J35 199",
  bibdate =      "Fri Jun 17 09:22:27 1994",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  price =        "US\$49.50",
  acknowledgement = ack-nhfb,
  bookreview =   "SunExpert, 5(6), 26--32, June 1994",
}

@Book{Jain:1994:FHH,
  author =       "R. Jain",
  title =        "{FDDI} handbook: high-speed networking using fiber and
                 other media",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xxvii + 528",
  month =        apr,
  year =         "1994",
  ISBN =         "0-201-56376-2",
  ISBN-13 =      "978-0-201-56376-4",
  LCCN =         "TK5105.72 .J35 1994",
  bibdate =      "Tue Aug 18 08:27:07 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1995:KAH,
  author =       "Anonymous",
  title =        "Killer App: It's the high-speed backbone",
  journal =      j-GOV-COMP-NEWS,
  volume =       "??",
  number =       "??",
  pages =        "24",
  day =          "16",
  month =        oct,
  year =         "1995",
  ISSN =         "0738-4300",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "An interview with Raj Jain.",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/gcn.htm",
  abstract =     "The interview includes Jain's answers to several ATM
                 related questions from Government Computer News. For
                 example: Will we see ATM take hold first in the LAN or
                 in the WAN? Does multimedia require ABR, CBR, VBR, or
                 UBR? If ATM is going to be cheaper than leased lines,
                 then what inducement do the carriers have to offer ATM,
                 and how are they going to make any money from it?",
}

@InProceedings{Charny:1995:CCE,
  author =       "A. Charny and D. D. Clark and R. Jain",
  title =        "Congestion Control with Explicit Rate Indication",
  crossref =     "IEEE:1995:III",
  pages =        "1954--1963",
  month =        jun,
  year =         "1995",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/charny.htm",
  abstract =     "As the speed and the dynamic range of computer
                 networks evolve, the issue of efficient traffic
                 management becomes increasingly important. This work
                 describes an approach to traffic management using
                 explicit rate information provided to the source by the
                 network. We present an asynchronous distributed
                 algorithm for optimal rate calculation across the
                 network, where optimality is understood in the maxmin
                 sense. The algorithm quickly converges to the optimal
                 rates and is shown to be well-behaved in transience.",
}

@Article{Fahmy:1995:SCC,
  author =       "Sonia Fahmy and Raj Jain and Fang Lu and Shivkumar
                 Kalyanaraman",
  title =        "A Survey of Congestion Control Techniques and Data
                 Link Protocols in Satellite Networks",
  journal =      j-INT-J-SATELL-COMMUN,
  volume =       "??",
  number =       "??",
  pages =        "31",
  year =         "1995",
  CODEN =        "IJSCEF",
  ISSN =         "0737-2884",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/sat_surv.htm",
  abstract =     "Satellite communication systems are the means of
                 realizing a global broadband integrated services
                 digital network. Due to the statistical nature of the
                 integrated services traffic, the resulting rate
                 fluctuations and burstiness render congestion control a
                 complicated, yet indispensable function. The long
                 propagation delay of the earth-satellite link further
                 imposes severe demands and constraints on the
                 congestion control schemes, as well as the media access
                 control techniques and retransmission protocols that
                 can be employed in a satellite network. The problems in
                 designing satellite network protocols, as well as some
                 of the solutions proposed to tackle these problems,
                 will be the primary focus of this survey.",
}

@InProceedings{Jain:1995:ANI,
  author =       "R. Jain",
  title =        "{ATM} Networks: Issues and Challenges Ahead",
  crossref =     "Vuong:1994:PST",
  pages =        "12--??",
  year =         "1995",
  bibdate =      "Tue Aug 18 08:35:57 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/atm_issu.htm",
  abstract =     "The paper begins with a discussion of current trends
                 in networking and a historical reviews of past
                 networking technologies some of which failed. This
                 leads us to the discussion about what it takes for a
                 new technology to succeed and what challenges we face
                 in making the current dream of a seamless world-wide
                 high-speed ATM network a reality. Issues in using ATM
                 cells for very high speed applications are presented.
                 Ensuring that the users benefit from ATM networks
                 involves several other related disciplines. These are
                 reviewed.",
}

@Article{Jain:1995:ASA,
  author =       "R. Jain",
  title =        "{ABR} Service on {ATM} Networks: What is it?",
  journal =      j-NETWORK-WORLD,
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  day =          "24",
  month =        jun,
  year =         "1995",
  ISSN =         "0887-7661 (print), 1944-7655 (electronic)",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/networkw.htm",
  abstract =     "Explains available bit rate service in simple terms",
}

@Article{Jain:1995:DFS,
  author =       "R. Jain",
  title =        "Data Flies Standby with {ABR} service",
  journal =      j-NETWORK-WORLD,
  volume =       "??",
  number =       "??",
  pages =        "43",
  day =          "12",
  month =        jun,
  year =         "1995",
  ISSN =         "0887-7661 (print), 1944-7655 (electronic)",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/networkw.htm",
  annote =       "Explains available bit rate service in simple terms.",
}

@Article{Ramakrishnan:1995:BFS,
  author =       "K. K. Ramakrishnan and Raj Jain",
  title =        "A binary feedback scheme for congestion avoidance in
                 computer networks with a connectionless network layer",
  journal =      "SIGCOMM Computer Communication Review",
  volume =       "25",
  number =       "1",
  pages =        "??--??",
  month =        jan,
  year =         "1995",
  bibdate =      "Wed Sep 28 16:56:06 2011",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  acknowledgement = ack-nhfb,
}

@Article{Siu:1995:BOA,
  author =       "K. Siu and R. Jain",
  title =        "A Brief Overview of {ATM}: Protocol Layers, {LAN}
                 Emulation, and Traffic Management",
  journal =      j-COMP-COMM-REV,
  volume =       "25",
  number =       "2",
  pages =        "6--28",
  month =        apr,
  year =         "1995",
  CODEN =        "CCRED2",
  ISSN =         "0146-4833",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/atm_tut.htm",
  abstract =     "Asynchronous Transfer Mode (ATM) has emerged as the
                 most promising technology in supporting future
                 broadband multimedia communication services. To
                 accelerate the deployment of ATM technology, the ATM
                 Forum, which is a consortium of service providers and
                 equipment vendors in the communication industries has
                 been created to develop implementation and
                 specification agreements. In this article, we present a
                 brief overview on ATM protocol layers and current
                 progress on LAN Emulation and Traffic Management in the
                 ATM Forum.",
}

@TechReport{Dommety:1996:PNA,
  author =       "G. Dommety and Raj Jain",
  title =        "Potential Networking Applications of Global
                 Positioning Systems ({GPS})",
  number =       "TR-24",
  institution =  "????",
  address =      "????",
  pages =        "??",
  month =        apr,
  year =         "1996",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/gps.htm",
  abstract =     "Global Positioning System (GPS) Technology allows
                 precise determination of location, velocity, direction,
                 and time. The price of GPS receivers is falling rapidly
                 and the applications are growing. PCMCIA receivers that
                 can be connected to any notebook personal computers are
                 available for \$300-400 to end consumers.\par

                 The main goal of this study was to survey current
                 applications of GPS to distributed systems and
                 networks. While GPS is appearing in the computer
                 magazines very often and while many computer companies
                 have announced GPS related efforts, most such efforts
                 are in providing navigational guidance to drivers.
                 Digitized city maps along with a GPS sensor on a mobile
                 computer provide directions to drivers. A number of
                 consortiums have been formed by companies such as IBM,
                 Apple, Toshiba, Sony, and others.\par

                 Currently, applications of GPS for distributed
                 computation and networking are limited to measuring
                 delays in Wolter and Golderman's DA-30 network
                 analyzers and in clock synchronization in synchronous
                 optical networks (SONET) used in telecommunication
                 networks.\par

                 We have identified twenty new applications of GPS for
                 distributed computing and networking. These
                 applications include circuit switching using
                 synchronized clocks, synchronous slotted systems, clock
                 synchronization in distributed systems, database
                 synchronization, connectionless real-time
                 communication, one-way delay, delay based routing, time
                 to live, resource location, location adaptive
                 protocols, home vs office vs car, electronic fence,
                 handoffs in wireless networks, prescheduled handoffs
                 based on velocity and direction, adaptive transmission
                 power control algorithms, directional antennas,
                 temporary cell partitioning for congestion avoidance,
                 peer-to-peer routing with limited range receivers,
                 email delivery based on geographic location,
                 distributed robot control and navigation, and equipment
                 location marking for maintenance crew.\par

                 There two main obstacles to applications of GPS. First
                 is that GPS antennas must point to open sky. They
                 cannot be used directly inside a building. Unless this
                 is avoided by new antenna designs or by rebroadcasting
                 GPS data inside a building, the use of GPS techniques
                 is limited to improving the performance of distributed
                 systems rather than proper operation. This is similar
                 to cache memories in computer systems. Systems can
                 operate without cache but perform better with cache.
                 The second obstacle is the pseudo-random noise
                 introduced in the GPS signals by the defense department
                 to disallow other governments from using the full
                 precision of GPS. This is called selective
                 availability. Fortunately, this can be easily overcome
                 by differential GPS techniques.\par

                 Detailed lists of GPS products, current applications,
                 addresses of manufacturers, and sources for further
                 information are included in this report.",
}

@InProceedings{Fahmy:1996:SRA,
  author =       "Sonia Fahmy and Raj Jain and Shivkumar Kalyanaraman
                 and Rohit Goyal and Fang Lu",
  booktitle =    "Proceedings of the First International Workshop on
                 Satellite-based Information Services, Rye, New York,
                 November 1996",
  title =        "On Source Rules for {ABR} Service on {ATM} Networks
                 with Satellite Links",
  publisher =    "????",
  address =      "????",
  pages =        "108--115",
  year =         "1996",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/wosbis.htm",
  abstract =     "During the design of ABR traffic management at the ATM
                 Forum, we performed several analyses to ensure that the
                 ABR service will operate efficiently over satellite
                 links. In the cases where the performance was
                 unacceptable, we suggested modifications to the traffic
                 management specifications. This paper describes one
                 such issue related to the count of missing resource
                 management cells (Crm) parameter of the ABR source
                 behavior. The analysis presented here led to the
                 changes which are now part of the ATM traffic
                 management (TM 4.0) specification. In particular, the
                 size of the transient buffer exposure (TBE) parameter
                 was set to 24 bits, and no size was enforced for the
                 Crm parameter. This simple change improved the
                 throughput over OC-3 satellite links from 45 Mbps to
                 140 Mbps.",
}

@Article{Jain:1996:CCT,
  author =       "Raj Jain",
  title =        "Congestion Control and Traffic Management in {ATM}
                 Networks: Recent Advances and {A} Survey",
  journal =      j-COMP-NET-ISDN,
  volume =       "28",
  number =       "13",
  pages =        "1723--1738",
  day =          "15",
  month =        oct,
  year =         "1996",
  CODEN =        "CNISE9",
  ISSN =         "0169-7552 (print), 1879-2324 (electronic)",
  bibdate =      "Sat Sep 25 15:30:03 1999",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Bibnet/authors/j/jain-raj.bib;
                 http://www.elsevier.com/cgi-bin/cas/tree/store/cna/cas_free/browse/browse.cgi?year=1996&volume=28&issue=13;
                 http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/cnis.htm;
                 http://www.elsevier.com/cgi-bin/cas/tree/store/comnet/cas_sub/browse/browse.cgi?year=1996&volume=28&issue=13&aid=1565",
  abstract =     "Congestion control mechanisms for ATM networks as
                 selected by the ATM Forum traffic management group are
                 described. Reasons behind these selections are
                 explained. In particular, selection criteria for
                 selection between rate-based and credit-based approach
                 and the key points of the debate between the two
                 approaches are presented. The approach that was finally
                 selected and several other schemes that were considered
                 are described.",
  acknowledgement = ack-nhfb,
}

@Article{Jain:1996:OSC,
  author =       "Raj Jain and Shiv Kalyanaraman and Ram Viswanathan",
  title =        "The {OSU} Scheme for Congestion Avoidance in {ATM}
                 Networks: Lessons Learnt and Extensions",
  journal =      j-PERF-EVAL,
  volume =       "31",
  number =       "1--2",
  pages =        "67--88",
  month =        may,
  year =         "1996",
  CODEN =        "PEREDN",
  ISSN =         "0166-5316 (print), 1872-745X (electronic)",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/perf-sub.htm",
  abstract =     "The OSU scheme is a rate-based congestion avoidance
                 scheme for ATM networks using explicit rate indication.
                 This work was one of the first attempts to define
                 explicit rate switch mechanisms and the Resource
                 Management (RM) cell format in Asynchronous Transfer
                 Mode (ATM) networks. The key features of the scheme
                 include explicit rate feedback, congestion avoidance,
                 fair operation while maintaining high utilization, use
                 of input rate as a congestion metric, O(1) complexity.
                 This paper presents an overview of the scheme, presents
                 those features of the scheme that have now become
                 common features of other switch algorithms and
                 discusses three extensions of the scheme.",
}

@Article{Jain:1996:SBA,
  author =       "R. Jain and S. Kalyanaraman and S. Fahmy and R. Goyal
                 and S. Kim",
  title =        "Source Behavior for {ATM} {ABR} Traffic Management: An
                 Explanation",
  journal =      j-IEEE-COMM-MAG,
  volume =       "34",
  number =       "11",
  pages =        "50--57",
  day =          "1",
  month =        nov,
  year =         "1996",
  CODEN =        "ICOMD9",
  ISSN =         "0163-6804",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/src_rule.htm",
  abstract =     "The Available Bit Rate (ABR) service has been
                 developed to support data applications over
                 Asynchronous Transfer Mode (ATM) networks. The network
                 continuously monitors its traffic and provides feedback
                 to the source end systems. This paper explains the
                 rules that the sources have to follow to achieve a fair
                 and efficient allocation of network resources.",
}

@InProceedings{Kalyanaraman:1996:BRT,
  author =       "Shiv Kalyanaraman and Raj Jain and Sonia Fahmy and
                 Rohit Goyal",
  booktitle =    "Proc. IEEE ATM'96 Workshop, San Francisco, August
                 23--24, 1996",
  title =        "Buffer Requirements For {TCP\slash IP} Over {ABR}",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "6",
  year =         "1996",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/atm96.htm",
  abstract =     "We study the buffering requirements for zero cell loss
                 for TCP over ABR. We show that the maximum buffers
                 required at the switch is proportional to the maximum
                 round trip time (RTT) of all VCs through the link. The
                 number of round-trips depends upon the switch algorithm
                 used. With our ERICA [erica-final] switch algorithm, we
                 find that the buffering required is independent of the
                 number of TCP sources. We substantiate our arguments
                 with simulation results.",
}

@Article{Kalyanaraman:1996:PBR,
  author =       "Shiv Kalyanaraman and Raj Jain and Sonia Fahmy and
                 Rohit Goyal and Seong-Cheol Kim",
  title =        "Performance and Buffering Requirements of Internet
                 Protocols over {ATM} {ABR} and {UBR} Services",
  journal =      j-IEEE-COMM-MAG,
  volume =       "36",
  number =       "6",
  pages =        "152--157",
  month =        sep,
  year =         "1996",
  CODEN =        "ICOMD9",
  ISSN =         "0163-6804",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/ieee-mag.htm",
  abstract =     "The Asynchronous Transfer Mode (ATM) networks are
                 quickly being adopted as backbones over various parts
                 of the Internet. This paper analyzes the performance of
                 TCP/IP protocols over ATM network's Available Bit Rate
                 (ABR) and Unspecified Bit Rate (UBR) services. It is
                 shown that ABR pushes congestion to the edges of the
                 ATM network while UBR leaves it inside the ATM
                 portion.",
}

@InProceedings{Kalyanaraman:1996:PTI,
  author =       "S. Kalyanaraman and R. Jain and S. Fahmy and R.
                 Goyal",
  title =        "Performance of {TCP\slash IP} over {ABR} Service on
                 {ATM} Networks",
  crossref =     "IEEE:1996:IGL",
  pages =        "468--475",
  year =         "1996",
  bibdate =      "Tue Aug 18 08:40:26 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kalyanaraman:1996:PTIa,
  author =       "Shiv Kalyanaraman and Raj Jain and Rohit Goyal and
                 Sonia Fahmy and Seong-Cheol Kim",
  booktitle =    "Proc. IEEE Communication Society Workshop on
                 Computer-Aided Modeling , Analysis and Design of
                 Communication Links and Networks, McLean, VA, October
                 20, 1996",
  title =        "Performance of {TCP\slash IP} Using {ATM} {ABR} and
                 {UBR} Services over Satellite Networks",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "8",
  month =        oct,
  year =         "1996",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/satellit.htm",
  abstract =     "We study the buffering requirements for zero cell loss
                 for TCP/IP over satellite links using the available bit
                 rate (ABR) and unspecified bit rate (UBR) services of
                 asynchronous transfer mode (ATM) networks. For the ABR
                 service, we explore the effect of feedback delay (a
                 factor which depends upon the position of the
                 bottleneck), the switch scheme used, and background
                 variable bit rate (VBR) traffic. It is shown that the
                 buffer requirement for TCP over ABR is independent of
                 the number of TCP sources, but depends on the
                 aforementioned factors. For the UBR service, we show
                 that the buffer requirement is the sum of the TCP
                 receiver window sizes. We substantiate our arguments
                 with simulation results.",
}

@InProceedings{Kalyanaraman:1996:PTIb,
  author =       "Shiv Kalyanaraman and Raj Jain and Sonia Fahmy and
                 Rohit Goyal and Fang Lu and Saragur Srinidhi",
  title =        "Performance of {TCP\slash IP} over {ABR}",
  crossref =     "IEEE:1996:IGL",
  pages =        "468--475",
  year =         "1996",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/globecom.htm",
  abstract =     "The Available Bit Rate (ABR) service has been
                 developed to support data applications over
                 Asynchronous Transfer Mode (ATM). It is hence
                 interesting to study the performance of reliable data
                 transport protocols like TCP over ABR. We study the
                 effect of running large unidirectional file transfer
                 applications on TCP over ABR with an explicit rate
                 algorithm (ERICA) implemented at the ATM switches. The
                 study shows that it is possible to get maximum TCP
                 throughput when there are enough buffers at the
                 switches and the sources are rate-limited by ABR.
                 However, when the number of buffers is smaller, there
                 is a large reduction in throughput even though the Cell
                 Loss Ratio (CLR) is very small and the sources are
                 window-limited by TCP. The primary reason for the large
                 throughput degradation is the TCP timer granularity
                 (which affects the timeout interval) and retransmission
                 of duplicate packets which are discarded at the
                 destination. We show that switch buffers should not be
                 dimensioned based on the ABR Source parameter Transient
                 Buffer Exposure (TBE). When ABR capacity is varied, we
                 find that CLR exhibits high variance and is not a good
                 indicator of TCP performance. Further, larger buffers
                 and a larger number of TCP sources increase TCP
                 throughput. Even when buffers are small, dropping of
                 End of Message (EOM) cells should be avoided. This
                 avoids merging of packets at the destination AAL5 and
                 improves fairness.",
}

@TechReport{Fahmy:1997:SPO,
  author =       "Sonia Fahmy and Raj Jain and Shivkumar Kalyanaraman
                 and Rohit Goyal and Bobby Vandalore and Xiangrong Cai",
  title =        "A Survey of Protocols and Open Issues in {ATM}
                 Multipoint Communications",
  number =       "47",
  institution =  "The Ohio State University, Department of Computer and
                 Information Science",
  address =      "Columbus, OH 43210-1277, USA",
  pages =        "??",
  day =          "21",
  month =        aug,
  year =         "1997",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/mcast.htm",
  abstract =     "Asynchronous transfer mode (ATM) networks must define
                 multicast capabilities in order to efficiently support
                 numerous applications, such as video conferencing and
                 distributed applications, in addition to LAN emulation
                 (LANE) and Internet protocol (IP) multicasting. Several
                 problems and issues arise in ATM multicasting, such as
                 signaling, routing, connection admission control, and
                 traffic management problems. IP integrated services
                 over ATM poses further challenges to ATM multicasting.
                 Scalability and simplicity are the two main concerns
                 for ATM multicasting. This paper provides a survey of
                 the current work on multicasting problems in general,
                 and ATM multicasting in particular. A number of
                 proposed schemes is examined, such as the schemes MARS,
                 MCS, SEAM, SMART, RSVP, and various multipoint traffic
                 management and transport-layer schemes. The paper also
                 indicates a number of key open issues that remain
                 unresolved.",
}

@Article{Goyal:1997:IPT,
  author =       "Rohit Goyal and Raj Jain and Shiv Kalyanaraman and
                 Sonia Fahmy and Bobby Vandalore",
  title =        "Improving the Performance of {TCP} over the {ATM-UBR}
                 service",
  journal =      j-COMP-COMM,
  volume =       "??",
  number =       "??",
  pages =        "??",
  month =        jul,
  year =         "1997",
  CODEN =        "COCOD7",
  ISSN =         "0140-3664 (print), 1873-703X (electronic)",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/cc.htm",
  annote =       "To appear.",
}

@InProceedings{Goyal:1997:TSA,
  author =       "Rohit Goyal and Raj Jain and Shivkumar Kalyanaraman
                 and Sonia Fahmy and Bobby Vandalore and Sastri Kota",
  title =        "{TCP} Selective Acknowledgments and {UBR} Drop
                 Policies to Improve {ATM-UBR} Performance over
                 Terrestrial and Satellite Networks",
  crossref =     "Makki:1997:SIC",
  pages =        "17--27",
  year =         "1997",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/ic3n97.htm",
  abstract =     "We study the performance of Selective Acknowledgments
                 with TCP over the ATM-UBR service category. We examine
                 various UBR drop policies, TCP mechanisms and network
                 configurations to recommend optimal parameters for TCP
                 over UBR. We discuss various TCP congestion control
                 mechanisms compare their performance for LAN and WAN
                 networks. We describe the effect of satellite delays on
                 TCP performance over UBR and present simulation results
                 for LAN, WAN and satellite networks. SACK TCP improves
                 the performance of TCP over UBR, especially for large
                 delay networks. Intelligent drop policies at the
                 switches are an important factor for good performance
                 in local area networks.",
}

@InProceedings{Goyal:1997:UIP,
  author =       "Rohit Goyal and Raj Jain and Shiv Kalyanaraman and
                 Sonia Fahmy and Seong-Cheol Kim",
  title =        "{UBR}+: Improving Performance of {TCP} over {ATM-UBR}
                 service",
  crossref =     "IEEE:1997:FIE",
  pages =        "1042--1048",
  year =         "1997",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/icc97.htm",
  abstract =     "ATM-UBR switches respond to congestion by dropping
                 cells when their buffers become full. TCP connections
                 running over UBR experience low throughput and high
                 unfairness. For 100\% TCP throughput each switch needs
                 buffers equal to the sum of the window sizes of all the
                 TCP connections. Intelligent drop policies can improve
                 the performance of TCP over UBR with limited buffers.
                 The UBR+ service proposes enhancements to UBR for
                 intelligent drop. Early Packet Discard improves
                 throughput but does not attempt to improve fairness.
                 Selective packet drop based on per-connection buffer
                 occupancy improves fairness. The Fair Buffer Allocation
                 scheme further improves both throughput and fairness.",
}

@Article{Jain:1997:PTE,
  author =       "R. Jain and G. Babic",
  title =        "Performance Testing Effort at the {ATM} Forum: An
                 Overview",
  journal =      j-IEEE-COMM-MAG,
  volume =       "35",
  number =       "8",
  pages =        "110--116",
  month =        aug,
  year =         "1997",
  CODEN =        "ICOMD9",
  ISSN =         "0163-6804",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/perf_com.htm",
  abstract =     "The testing group at ATM Forum is working on
                 developing a specification for performance testing of
                 ATM switches and networks. The emphasis is on the user
                 perceived frame-level performance. This paper explains
                 what is different about this new effort and gives its
                 status.",
}

@InProceedings{Kalyanaraman:1997:DCV,
  author =       "Shiv Kalyanaraman and Raj Jain and Jianping Jiang and
                 Rohit Goyal and Sonia Fahmy and Pradeep Samudra",
  title =        "Design Considerations for the Virtual Source\slash
                 Virtual Destination ({VS\slash VD}) Feature in the
                 {ABR} Service of {ATM} Networks",
  crossref =     "IEEE:1998:PII",
  pages =        "21--??",
  year =         "1997",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/vsvd.htm",
  abstract =     "The Available Bit Rate (ABR) service in ATM networks
                 has been specified to allow fair and efficient support
                 of data applications over ATM utilizing capacity left
                 over after servicing higher priority classes. One of
                 the architectural features in the ABR specification
                 [tm4] is the Virtual Source/Virtual Destination (VS/VD)
                 option. This option allows a switch to divide an
                 end-to-end ABR connection into separately controlled
                 ABR segments by acting like a destination on one
                 segment, and like a source on the other. The coupling
                 in the VS/VD switch between the two ABR control
                 segments is implementation specific. In this paper, we
                 model a VS/VD ATM switch and study the issues in
                 designing coupling between ABR segments. We identify a
                 number of implementation options for the coupling. A
                 good choice significantly improves the stability and
                 transient performance of the system and reduces the
                 buffer requirements at the switches.",
}

@TechReport{Kalyanaraman:1997:ESA,
  author =       "Shivkumar Kalyanaraman and Raj Jain and Sonia Fahmy
                 and Rohit Goyal and Bobby Vandalore",
  title =        "The {ERICA} Switch Algorithm for {ABR} Traffic
                 Management in {ATM} Networks",
  institution =  "The Ohio State University, Department of Computer and
                 Information Science",
  address =      "Columbus, OH 43210-1277, USA",
  pages =        "32",
  month =        nov,
  year =         "1997",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/erica.htm",
  abstract =     "We propose an explicit rate indication scheme for
                 congestion avoidance in ATM networks. In this scheme,
                 the network switches monitor their load on each link,
                 determining a load factor, the available capacity, and
                 the number of currently active virtual channels. This
                 information is used to advise the sources about the
                 rates at which they should transmit. The algorithm is
                 designed to achieve efficiency, fairness, controlled
                 queueing delays, and fast transient response. The
                 algorithm present performance analysis of the scheme
                 using both analytical arguments and simulation results.
                 The scheme is being implemented by several ATM switch
                 manufacturers.",
}

@InProceedings{Kalyanaraman:1997:PTA,
  author =       "Shiv Kalyanaraman and Raj Jain and Sonia Fahmy and
                 Rohit Goyal and Jianping Jiang and Seong-Cheol Kim",
  title =        "Performance of {TCP} over {ABR} on {ATM} backbone and
                 with various {VBR} traffic patterns",
  crossref =     "IEEE:1997:IIC",
  pages =        "1035--1041",
  year =         "1997",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/tcp_vbr.htm",
  abstract =     "We extend our earlier studies of buffer requirements
                 of TCP over ABR in two directions. First, we study the
                 performance of TCP over ABR in an ATM backbone. On the
                 backbone, the TCP queues are at the edge router and not
                 inside the ATM network. The router requires buffer
                 equal to the sum of the receiver window sizes of the
                 participating TCP connections. Second, we introduce
                 various patterns of VBR background traffic. The VBR
                 background introduces variance in the ABR capacity and
                 the TCP traffic introduces variance in the ABR demand.
                 Some simple switch schemes are unable to keep up with
                 the combined effect of highly varying demands and
                 highly varying ABR capacity. We present our experiences
                 with refining the ERICA+ switch scheme to handle these
                 conditions.",
}

@TechReport{Kalyanaraman:1997:SUI,
  author =       "Shivkumar Kalyanaraman and Raj Jain and Rohit Goyal
                 and Sonia Fahmy",
  title =        "A Survey of the Use-It-Or-Lose-It Policies for the
                 {ABR} Service in {ATM} Networks",
  number =       "OSU-CISRC-1/97-TR02",
  institution =  "Ohio State University",
  address =      "Columbus, OH, USA",
  pages =        "??",
  month =        may,
  year =         "1997",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/tr_rule5.htm",
  abstract =     "The Available Bit Rate (ABR) service has been
                 developed to support data applications over
                 Asynchronous Transfer Mode (ATM). The ABR service uses
                 a closed-loop rate-based traffic management framework
                 where the network divides available bandwidth among
                 contending sources. The ATM Forum then worked on
                 incorporating open-loop control capabilities to make
                 the ABR service robust to temporary network failures
                 and source inactivity periods. One of the problems
                 addressed was whether rate allocations of sources
                 should be taken away if sources do not use them. The
                 proposed solutions, popularly known as the
                 Use-It-or-Lose-It (UILI) policies, have had significant
                 impact on the ABR service capabilities. In this paper
                 we survey the design, development, the final shape of
                 these policies and their impact on the ABR service.",
}

@PhdThesis{Kalyanaraman:1997:TMA,
  author =       "Shivkumar Kalyanaraman",
  title =        "Traffic Management for the Available Bit Rate ({ABR})
                 Service in Asynchronous Transfer Mode ({ATM})
                 Networks",
  school =       "The Ohio State University",
  address =      "Columbus, OH, USA",
  pages =        "xxiv + 429",
  year =         "1997",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/theses/shiv.htm",
  abstract =     "With the merger of telecommunication, entertainment
                 and computer industries, computer networking is
                 adopting a new paradigm called Asynchronous Transfer
                 Mode (ATM) networking. ATM networks have multiple
                 service classes allow audio, video and data to share
                 the same network. Of these, the Available Bit Rate
                 (ABR) service class is designed to efficiently support
                 data traffic.\par

                 Traffic management involves the design of a set of
                 mechanisms which ensure that the network bandwidth,
                 buffer and computational resources are efficiently
                 utilized while meeting the various Quality of Service
                 (QoS) guarantees given to sources as part of a traffic
                 contract. The general problem of network traffic
                 management involves all the available traffic classes.
                 In this dissertation, we address the problem of
                 designing traffic management mechanisms for one class -
                 the ABR service class in ATM networks.\par

                 We consider five aspects of this problem in this
                 dissertation. First, the ABR service requires a
                 mechanism to carry rate feedback from the network
                 switches to the sources. We design three switch
                 algorithms (the OSU scheme, the ERICA and ERICA+
                 schemes) which calculate the rate allocations to
                 satisfy different sets of goals. Second, we design a
                 set of source end system mechanisms which respond to
                 network feedback, and perform control in the case when
                 feedback is disrupted or is stale. Third, we validate
                 the performance of the service for various ABR and VBR
                 demand patterns. Specifically, we study the case of
                 Internet traffic over ATM-ABR. Fourth, we consider the
                 switch design issues for a specific ABR framework
                 option called the ``Virtual Source/Virtual
                 Destination'' option. Finally, we discuss
                 cost/performance issues pertaining to the
                 implementation of the service.\par

                 In summary, this dissertation work addresses
                 fundamental issues in ATM ABR traffic management, and
                 the techniques developed are applicable to a wider
                 class of high-speed packet networks.",
}

@InProceedings{Kota:1997:SAN,
  author =       "Sastri Kota and Rohit Goyal and Raj Jain",
  booktitle =    "Proceedings of the 3rd Ka Band Utilization Conference,
                 Sorrento, Italy, 1997",
  title =        "Satellite {ATM} Network Architectural Considerations
                 and {TCP\slash IP} Performance",
  publisher =    "Istituto Internazionale delle Comunicazioni",
  address =      "Genova, Italy",
  pages =        "481--488",
  year =         "1997",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/kaband.htm",
  abstract =     "In this paper, we have provided a summary of the
                 design options in Satellite-ATM technology. A satellite
                 ATM network consists of a space segment of satellites
                 connected by inter-satellite crosslinks, and a ground
                 segment of the various ATM networks. A satellite-ATM
                 interface module connects the satellite network to the
                 ATM networks and performs various call and control
                 functions. A network control center performs various
                 network management and resource allocation functions.
                 Several issues such as the ATM service model, media
                 access protocols, and traffic management issues must be
                 considered when designing a satellite ATM network to
                 effectively transport Internet traffic. We have
                 presented the buffer requirements for TCP/IP traffic
                 over ATM-UBR for satellite latencies. Our results are
                 based on TCP with selective acknowledgments and a
                 per-VC buffer management policy at the switches. A
                 buffer size of about 0.5 * RTT to 1 * RTT is sufficient
                 to provide over 98\% throughput to infinite TCP traffic
                 for long latency networks and a large number of
                 sources. This buffer requirement is independent of the
                 number of sources.The fairness is high for a large
                 numbers of sources because of the per-VC buffer
                 management performed at the switches and the nature of
                 TCP traffic.",
}

@InProceedings{Vandalore:1997:PBW,
  author =       "Bobby Vandalore and Shivkumar Kalyanaraman and Raj
                 Jain and Rohit Goyal and Sonia Fahmy and Seong-Cheol
                 Kim",
  booktitle =    "WebNet `97, Toronto, November 1997",
  title =        "Performance of Bursty {World Wide Web} ({WWW}) Sources
                 over {ABR}",
  publisher =    "????",
  address =      "????",
  pages =        "??--??",
  year =         "1997",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/webspec.htm",
  abstract =     "We model World Wide Web (WWW) servers and clients
                 running over an ATM network using the ABR (available
                 bit rate) service. The WWW servers are modeled using a
                 variant of the SPECweb96 benchmark, while the WWW
                 clients are based on a model by Mah. The traffic
                 generated by this application is typically bursty,
                 i.e., it has active and idle periods in transmission. A
                 timeout occurs after given amount of idle period.
                 During idle period the underlying TCP congestion
                 windows remain open until a timeout expires. These open
                 windows may be used to send data in a burst when the
                 application becomes active again. This raises the
                 possibility of large switch queues if the source rates
                 are not controlled by ABR. We study this problem and
                 show that ABR scales well with a large number of bursty
                 TCP sources in the system.",
}

@InProceedings{Fahmy:1998:DFB,
  author =       "Sonia Fahmy and Raj Jain and Shivkumar Kalyanaraman
                 and Rohit Goyal and Bobby Vandalore",
  booktitle =    "Proceedings of the IEEE International Conference on
                 Communications (ICC)",
  title =        "On Determining the Fair Bandwidth Share for {ABR}
                 Connections in {ATM} Networks",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "7",
  month =        jun,
  year =         "1998",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/neff.htm",
  abstract =     "The ABR service is designed to fairly allocate the
                 bandwidth unused by higher priority services. The
                 network indicates to the ABR sources the rates at which
                 they should transmit to minimize their cell loss.
                 Switches must constantly measure the demand and
                 available capacity, and divide the capacity fairly
                 among the contending connections. In order to compute
                 the fair and efficient allocation for each connection,
                 a switch needs to determine the effective number of
                 active connections. In this paper, we propose a method
                 for determining the number of active connections and
                 the fair bandwidth share for each. We prove the
                 efficiency and fairness of the proposed method
                 analytically, and simulate it by incorporating it into
                 the ERICA switch algorithm.",
  xxnote =       "Is this \cite{IEEE:1998:PII}??",
}

@InProceedings{Fahmy:1998:FCA,
  author =       "Sonia Fahmy and Raj Jain and Rohit Goyal and Bobby
                 Vandalore and Shivkumar Kalyanaraman and Sastri Kota
                 and Pradeep Samudra",
  title =        "Feedback Consolidation Algorithms for {ABR}
                 Point-to-Multipoint Connections in {ATM} Networks",
  crossref =     "IEEE:1998:PII",
  pages =        "1004--1013",
  year =         "1998",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/cnsldt.htm",
  abstract =     "ABR traffic management for point-to-multipoint
                 connections controls the source rate to the minimum
                 rate supported by all the branches of the multicast
                 tree. A number of algorithms have been developed for
                 extending ABR congestion avoidance algorithms to
                 perform feedback consolidation at the branch points.
                 This paper discusses various design options and
                 implementation alternatives for the consolidation
                 algorithms, and proposes a number of new algorithms.
                 The performance of the proposed algorithms and the
                 previous algorithms is compared under a variety of
                 conditions. Results indicate that the algorithms we
                 propose eliminate the consolidation noise (caused if
                 the feedback is returned before all branches respond),
                 while exhibiting a fast transient response.",
}

@InProceedings{Goyal:1998:DIP,
  author =       "Rohit Goyal and Raj Jain and Sonia Fahmy and Bobby
                 Vandalore and Shivkumar Kalyanaraman",
  title =        "Design Issues for providing Minimum Rate Guarantees to
                 the {ATM} Unspecified Bit Rate Service",
  crossref =     "IEEE:1998:PII",
  pages =        "169--175",
  year =         "1998",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/gfr.htm",
  abstract =     "Recent enhancements have been proposed to the ATM
                 Unspecified Bit Rate (UBR) service that guarantee a
                 minimum rate at the frame level to the UBR VCs. These
                 enhancements have been called Guaranteed Frame Rate
                 (GFR). In this paper, we discuss the motivation, design
                 and implementation issues for GFR. We present the
                 design of buffer management and policing mechanisms to
                 implement GFR. We study the effects of policing, per-VC
                 buffer allocation, and per-VC queuing on providing GFR
                 to TCP/IP traffic. We conclude that per-VC scheduling
                 is necessary to provide minimum rate guarantees to TCP
                 traffic. We examine the role of frame tagging in the
                 presence of scheduling and buffer management for
                 providing minumum rate guarantees. The use of GFR to
                 support the Internet Controlled Load Service is also
                 discussed.",
  xxnote =       "Original entry had month May; check??",
}

@Article{Kalyanaraman:1998:DCV,
  author =       "Shivkumar Kalyanaraman and Raj Jain and Jianping Jiang
                 and Rohit Goyal and Sonia Fahmy",
  title =        "Design considerations for the virtual source\slash
                 virtual destination ({VS\slash VD}) feature in the
                 {ABR} service of {ATM} networks",
  journal =      j-COMP-NET-ISDN,
  volume =       "30",
  number =       "19",
  pages =        "1811--1824",
  day =          "14",
  month =        oct,
  year =         "1998",
  CODEN =        "CNISE9",
  ISSN =         "0169-7552 (print), 1879-2324 (electronic)",
  bibdate =      "Fri Sep 24 20:22:25 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/cna/cas_free/browse/browse.cgi?year=1998&volume=30&issue=19;
                 http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.elsevier.com/cas/tree/store/comnet/sub/1998/30/19/1970.pdf",
  acknowledgement = ack-nhfb,
}

@InProceedings{Kalyanaraman:1998:PTA,
  author =       "Shivkumar Kalyanaraman and Bobby Vandalore and Raj
                 Jain and Rohit Goyal and Sonia Fahmy and Seong-Cheol
                 Kim and Sastri Kota",
  title =        "Performance of {TCP} over {ABR} with Long-Range
                 Dependent {VBR} Background Traffic over Terrestrial and
                 Satellite {ATM} networks",
  crossref =     "IEEE:1998:PII",
  pages =        "??--??",
  year =         "1998",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/mpeg.htm",
  abstract =     "We model VBR carrying Long-Range Dependent (LRD),
                 multiplexed video sources. We study the effect of such
                 VBR traffic on ABR carrying TCP traffic. Our model of
                 compressed video sources bears some similarity to an
                 MPEG-2 Transport Stream carrying video, i.e., it is
                 long-range dependent and generates traffic in a
                 piecewise-CBR fashion. The effect of such VBR traffic
                 is that the ABR capacity is highly variant. We find
                 that a proper switch algorithm like ERICA+ can tolerate
                 this variance in ABR capacity while maintaining high
                 throughput and low delay. We present simulation results
                 for terrestrial and satellite configurations.",
  xxnote =       "Original entry has month July, but Library of Congress
                 has March-April: check this?? Also, check year: 1997 or
                 1998??",
}

@Article{Kalyanaraman:1998:UIL,
  author =       "Shivkumar Kalyanaraman and Raj Jain and Rohit Goyal
                 and Sonia Fahmy and Pradeep Samudra",
  title =        "Use-it or Lose-it Policies for the Available Bit Rate
                 ({ABR}) Service in {ATM} Networks",
  journal =      j-COMP-NET-ISDN,
  volume =       "30",
  number =       "24",
  pages =        "2293--2308",
  day =          "14",
  month =        dec,
  year =         "1998",
  CODEN =        "CNISE9",
  ISSN =         "0169-7552 (print), 1879-2324 (electronic)",
  bibdate =      "Sat Sep 25 15:30:03 1999",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Bibnet/authors/j/jain-raj.bib;
                 http://www.elsevier.com/cgi-bin/cas/tree/store/cna/cas_free/browse/browse.cgi?year=1998&volume=30&issue=24;
                 http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/uili.htm;
                 http://www.elsevier.com/cas/tree/store/comnet/sub/1998/30/24/1964.pdf",
  abstract =     "The Available Bit Rate (ABR) service has been
                 developed to support 21st century data applications
                 over Asynchronous Transfer Mode (ATM). The ABR service
                 uses a closed-loop rate-based traffic management
                 framework where the network divides left-over bandwidth
                 among contending sources. The ATM Forum traffic
                 management group also incorporated open-loop control
                 capabilities to make the ABR service robust to
                 temporary network failures and source inactivity. An
                 important problem addressed was whether rate
                 allocations of sources should be taken away if sources
                 do not use them. The proposed solutions, popularly
                 known as the Use-It-or-Lose-It (UILI) policies, have
                 had significant impact on the ABR service capabilities.
                 In this paper we discuss the design, development, and
                 the final shape of these policies and their impact on
                 the ABR service. We compare the various alternatives
                 through a performance evaluation.",
  acknowledgement = ack-nhfb,
  annote =       "To appear.",
  xxauthor =     "Shivkumar Kalyanaraman and Raj Jain and Rohit Goyal
                 and Sonia Fahmy and Seong-Cheol Kim",
}

@Article{Vandalore:1999:DQC,
  author =       "Bobby Vandalore and Raj Jain and Rohit Goyal and Sonia
                 Fahmy",
  title =        "Dynamic queue control functions for {ATM ABR} switch
                 schemes: design and analysis",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "31",
  number =       "18",
  pages =        "1935--1949",
  day =          "17",
  month =        aug,
  year =         "1999",
  CODEN =        "????",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  bibdate =      "Fri Sep 24 19:43:33 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/cna/cas_free/browse/browse.cgi?year=1999&volume=31&issue=18;
                 http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.elsevier.com/cas/tree/store/comnet/sub/1999/31/18/2133.pdf",
  acknowledgement = ack-nhfb,
}

@TechReport{Jain:19xx:CHS,
  author =       "Raj Jain",
  title =        "A Comparison of Hashing Schemes for Address Lookup in
                 Computer Networks",
  number =       "DEC-TR-566",
  institution =  "Digital Equipment Corporation",
  pages =        "??",
  year =         "19xx",
  bibdate =      "Thu Jul 21 08:52:19 1994",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "jain%erlang.dec@decwrl.dec.com",
  abstract =     "The trend toward networks becoming larger and faster,
                 and addresses increasing in size, has impelled a need
                 to explore alternatives for fast address recognition.
                 Hashing is one such alternative which can help minimize
                 the address search time in adapters, bridges, routers,
                 gateways, and name servers. Using a trace of address
                 references, we compared the efficiency of several
                 different hashing functions and found that the cyclic
                 redundancy checking (CRC) polynomials provide excellent
                 hashing functions. For software implementation,
                 Fletcher checksum provides a good hashing function.
                 Straightforward folding of address octets using the
                 exclusive-or operation is also a good hashing function.
                 For some applications, bit extraction from the address
                 can be used.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jain:19xx:OSC,
  author =       "Raj Jain and Shiv Kalyanaraman and Ram Viswanathan",
  booktitle =    "Proceedings WATM'95 First Workshop on ATM Traffic
                 Management, Paris, France",
  title =        "The {OSU} Scheme for Congestion Avoidance in {ATM}
                 networks Using Explicit Rate Indication",
  publisher =    "????",
  address =      "????",
  pages =        "20",
  year =         "19xx",
  bibdate =      "Mon Aug 17 17:45:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.cis.ohio-state.edu/~jain/papers/osuc_con.htm",
  abstract =     "An explicit rate indication scheme for congestion
                 avoidance in computer and telecommunication networks is
                 proposed. The sources monitor their load and provide
                 the information periodically to the switches. The
                 switches, in turn, compute the load level and ask the
                 sources to adjust their rates up or down. The scheme
                 achieves high link utilization, fair allocation of
                 rates among contending sources and provides quick
                 convergence. A backward congestion notification option
                 is also provided. The conditions under which this
                 option is useful are indicated.",
}

@Article{Kalyanaraman:2000:ESA,
  author =       "Shivkumar Kalyanaraman and Raj Jain and Sonia Fahmy
                 and Rohit Goyal and Bobby Vandalore",
  title =        "The {ERICA} switch algorithm for {ABR} traffic
                 management in {ATM} networks",
  journal =      j-IEEE-TRANS-NETWORKING,
  volume =       "8",
  number =       "1",
  pages =        "87--98",
  month =        feb,
  year =         "2000",
  CODEN =        "IEANEP",
  ISSN =         "1063-6692 (print), 1558-2566 (electronic)",
  bibdate =      "Sat Oct 28 17:15:07 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/contents/journals/ton/;
                 http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/ton/2000-8-1/p87-kalyanaraman/",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE\slash ACM Transactions on Networking",
  keywords =     "ATM network; Internet",
}

@Article{Liu:2001:IEC,
  author =       "Chunlei Liu and Raj Jain",
  title =        "Improving explicit congestion notification with the
                 mark-front strategy",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "35",
  number =       "2--3",
  pages =        "185--201",
  day =          "??",
  month =        feb,
  year =         "2001",
  CODEN =        "????",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  bibdate =      "Thu Apr 19 08:38:52 MDT 2001",
  bibsource =    "http://www.elsevier.com/locate/issn/13891286;
                 http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/15/22/52/27/28/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/15/22/52/27/28/article.pdf",
  acknowledgement = ack-nhfb,
}

@Book{Hassan:2004:HPT,
  editor =       "Mahbub Hassan and Raj Jain",
  title =        "High performance {TCP\slash IP} networking: concepts,
                 issues, and solutions",
  publisher =    pub-PEARSON-PH,
  address =      pub-PEARSON-PH:adr,
  pages =        "xx + 383",
  year =         "2004",
  ISBN =         "0-13-064634-2",
  ISBN-13 =      "978-0-13-064634-7",
  LCCN =         "TK5105.585 .H54 2003",
  bibdate =      "Tue Dec 30 18:38:09 2003",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  price =        "US\$59.00",
  acknowledgement = ack-nhfb,
}

@InProceedings{AlTamimi:2010:MGA,
  author =       "Abdel Karim {Al Tamimi} and Raj Jain and Chakchai
                 So-In",
  booktitle =    "{MMSys '10: Proceedings of the first annual ACM SIGMM
                 conference on Multimedia systems, February 2010}",
  title =        "Modeling and generation of {AVC} and {SVC-TS} mobile
                 video traces for broadband access networks",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "89--98",
  year =         "2010",
  DOI =          "http://dx.doi.org/10.1145/1730836.1730848",
  ISBN =         "1-60558-914-4",
  ISBN-13 =      "978-1-60558-914-5",
  LCCN =         "????",
  bibdate =      "Wed Sep 28 16:54:13 2011",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  acknowledgement = ack-nhfb,
}

@Article{So-In:2011:VAU,
  author =       "Chakchai So-In and Raj Jain and Subharthi Paul and
                 Jianli Pan",
  title =        "Virtualization architecture using the {ID\slash
                 Locator} split concept for {Future Wireless Networks
                 (FWNs)}",
  journal =      j-COMP-NET-AMSTERDAM,
  volume =       "55",
  number =       "2",
  pages =        "415--430",
  day =          "1",
  month =        feb,
  year =         "2011",
  CODEN =        "????",
  ISSN =         "1389-1286 (print), 1872-7069 (electronic)",
  bibdate =      "Sat Apr 2 08:42:43 MDT 2011",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib;
                 http://www.sciencedirect.com/science/journal/13891286",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Networks",
}

%%% ====================================================================
%%% Cross-referenced entries must come last:

@Proceedings{Weatherbee:1978:CPE,
  editor =       "James E. Weatherbee",
  booktitle =    "Computer Performance Evaluation Users Group (CPEUG):
                 proceedings of the fourteenth meeting held at Boston,
                 Massachusetts, October 24--27, 1978",
  title =        "Computer Performance Evaluation Users Group ({CPEUG}):
                 proceedings of the fourteenth meeting held at Boston,
                 Massachusetts, October 24--27, 1978",
  volume =       "500-41",
  publisher =    pub-NBS,
  address =      pub-NBS:adr,
  pages =        "xii + 373",
  year =         "1978",
  LCCN =         "QC100 .U57 no. 500-41; QA76.9.E94",
  bibdate =      "Tue Aug 18 07:20:40 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  series =       "NBS special publication",
  acknowledgement = ack-nhfb,
}

@Proceedings{Wilson:1982:PCP,
  editor =       "Carol B. Wilson",
  booktitle =    "Proceedings of the Computer Performance Evaluation
                 Users Group (CPEUG) 18th meeting, Washington, DC,
                 October 25--28, 1982",
  title =        "Proceedings of the Computer Performance Evaluation
                 Users Group ({CPEUG}) 18th meeting, Washington, {DC},
                 October 25--28, 1982",
  volume =       "500-95",
  publisher =    pub-NBS,
  address =      pub-NBS:adr,
  pages =        "xiii + 448",
  year =         "1982",
  LCCN =         "QC100 .U57 no. 500-95; QA76.9.E94",
  bibdate =      "Tue Aug 18 07:23:21 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  series =       "NBS special publication",
  acknowledgement = ack-nhfb,
}

@Proceedings{ACM:1988:ASS,
  editor =       "{ACM}",
  booktitle =    "ACM SIGCOMM '88 Symposium (1988: Stanford, CA)",
  title =        "{ACM} {SIGCOMM} '88 Symposium (1988: Stanford, {CA})",
  volume =       "18(4)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "ix + 339",
  month =        aug,
  year =         "1988",
  ISBN =         "0-89791-279-9",
  ISBN-13 =      "978-0-89791-279-2",
  LCCN =         "TK 5105.5 C655 v.18 no.4 1988",
  bibdate =      "Tue Aug 18 07:42:28 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  series =       "Computer communications review",
  acknowledgement = ack-nhfb,
}

@Proceedings{IEEE:1988:CNS,
  editor =       "{IEEE}",
  booktitle =    "Computer Networking Symposium: proceedings, Sheraton
                 National Hotel, Washington, DC area, April 11--13,
                 1988",
  title =        "Computer Networking Symposium: proceedings, Sheraton
                 National Hotel, Washington, {DC} area, April 11--13,
                 1988",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "viii + 431",
  year =         "1988",
  ISBN =         "0-8186-0835-8 (paperback), 0-8186-8835-1 (case),
                 0-8186-4835-X (microfiche)",
  ISBN-13 =      "978-0-8186-0835-3 (paperback), 978-0-8186-8835-5
                 (case), 978-0-8186-4835-9 (microfiche)",
  LCCN =         "TK5105.5 .C6441 1988",
  bibdate =      "Tue Aug 18 07:40:23 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "IEEE catalog number 88CH2547-8. Computer Society order
                 number 835.",
  acknowledgement = ack-nhfb,
}

@Proceedings{Vuong:1994:PST,
  editor =       "Son T. Vuong and Samuel T. Chanson",
  booktitle =    "Protocol specification, testing and verification
                 {XIV}",
  title =        "Protocol specification, testing and verification
                 {XIV}",
  publisher =    "Chapman and Hall",
  address =      "New York, NY, USA",
  pages =        "402",
  year =         "1994",
  ISBN =         "0-412-63640-9",
  ISBN-13 =      "978-0-412-63640-0",
  LCCN =         "TK 5105.55 P76 1994",
  bibdate =      "Tue Aug 18 08:55:33 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "Papers from the PSTV '94 Symposium, organized under
                 the auspices of IFIP W.G. 6.1 and held in Vancouver,
                 BC, Canada, in August 1994.",
  acknowledgement = ack-nhfb,
}

@Proceedings{IEEE:1995:III,
  editor =       "{IEEE}",
  booktitle =    "ICC'95: IEEE International Conference on
                 Communications (1995 : Seattle, WA, USA)",
  title =        "{ICC}'95: {IEEE} International Conference on
                 Communications (1995 : Seattle, {WA}, {USA})",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xxviii + 1985",
  year =         "1995",
  ISBN =         "0-7803-2486-2, 0-7803-2487-0, 0-7803-2488-9",
  ISBN-13 =      "978-0-7803-2486-2, 978-0-7803-2487-9,
                 978-0-7803-2488-6",
  ISSN =         "0536-1486",
  LCCN =         "TK5101.A1 I244 1995",
  bibdate =      "Tue Aug 18 08:59:32 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "Three volumes.",
  acknowledgement = ack-nhfb,
}

@Proceedings{IEEE:1996:IGL,
  editor =       "{IEEE}",
  booktitle =    "IEEE GLOBECOM 1996: London, November 18--22, 1996:
                 communications: the key to global prosperity",
  title =        "{IEEE} {GLOBECOM} 1996: London, November 18--22, 1996:
                 communications: the key to global prosperity",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "x + 228",
  year =         "1996",
  ISBN =         "0-7803-3336-5 (softbound), 0-7803-3337-3 (casebound),
                 0-7803-3338-1 (microfiche)",
  ISBN-13 =      "978-0-7803-3336-9 (softbound), 978-0-7803-3337-6
                 (casebound), 978-0-7803-3338-3 (microfiche)",
  LCCN =         "TK 5101 A1 I146 1996a",
  bibdate =      "Tue Aug 18 07:51:23 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{IEEE:1997:FIE,
  editor =       "{IEEE}",
  booktitle =    "First IEEE Enterprise Networking Mini-Conference
                 (ENM-97) in conjunction with the ICC-97, June 11--12,
                 1997, Palais des Congr{\`e}s, Montr{\'e}al, Qu{\'e}bec,
                 Canada",
  title =        "First {IEEE} Enterprise Networking Mini-Conference
                 ({ENM}-97) in conjunction with the {ICC}-97, June
                 11--12, 1997, Palais des Congr{\`e}s, Montr{\'e}al,
                 Qu{\'e}bec, Canada",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xxxiv + 190",
  year =         "1997",
  ISBN =         "0-7803-4112-0 (softbound), 0-7803-4113-9
                 (microfiche)",
  ISBN-13 =      "978-0-7803-4112-8 (softbound), 978-0-7803-4113-5
                 (microfiche)",
  LCCN =         "TK5105.7.I3233 1997",
  bibdate =      "Tue Aug 18 07:53:37 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{IEEE:1997:IIC,
  editor =       "{IEEE}",
  booktitle =    "1997 IEEE International Conference on Communications:
                 towards the knowledge millennium: ICC '97, 8--12 June
                 1997, Montr{\'e}al, Qu{\'e}bec, Canada, conference
                 record",
  title =        "1997 {IEEE} International Conference on
                 Communications: towards the knowledge millennium: {ICC}
                 '97, 8--12 June 1997, Montr{\'e}al, Qu{\'e}bec, Canada,
                 conference record",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xxviii + 1743",
  year =         "1997",
  ISBN =         "0-7803-3925-8 (softbound), 0-7803-3926-6 (casebound),
                 0-7803-3927-4 (microfiche), 0-7803-3928-2 (CD-ROM)",
  ISBN-13 =      "978-0-7803-3925-5 (softbound), 978-0-7803-3926-2
                 (casebound), 978-0-7803-3927-9 (microfiche),
                 978-0-7803-3928-6 (CD-ROM)",
  LCCN =         "TK5101.A1 I16 1997",
  bibdate =      "Tue Aug 18 07:58:43 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "Three volumes",
  acknowledgement = ack-nhfb,
}

@Proceedings{Makki:1997:SIC,
  editor =       "Kia Makki and others",
  booktitle =    "Sixth International Conference on Computer
                 Communications and Networks, September 22--25, 1997,
                 Las Vegas, Nevada: proceedings",
  title =        "Sixth International Conference on Computer
                 Communications and Networks, September 22--25, 1997,
                 Las Vegas, Nevada: proceedings",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xviii + 551",
  year =         "1997",
  ISBN =         "0-8186-8186-1, 0-8186-8188-8 (microfiche)",
  ISBN-13 =      "978-0-8186-8186-8, 978-0-8186-8188-2 (microfiche)",
  LCCN =         "TK5105.5 .I5712 1997",
  bibdate =      "Tue Aug 18 07:33:06 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{IEEE:1998:PII,
  editor =       "{IEEE}",
  booktitle =    "Proceedings: IEEE INFOCOM'98: the conference on
                 computer communications: seventeenth annual joint
                 conference of the IEEE Computer and Communications
                 Societies: gateway to the 21st century, 29 March--2
                 April 1998, Hotel Nikko, San Francisco, CA, USA",
  title =        "Proceedings: {IEEE} {INFOCOM}'98: the conference on
                 computer communications: seventeenth annual joint
                 conference of the {IEEE} Computer and Communications
                 Societies: gateway to the 21st century, 29 March--2
                 April 1998, Hotel Nikko, San Francisco, {CA}, {USA}",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "various",
  year =         "1998",
  ISBN =         "0-7803-4383-2 (softbound), 0-7803-4384-0 (casebound),
                 0-7803-4385-9 (microfiche)",
  ISBN-13 =      "978-0-7803-4383-2 (softbound), 978-0-7803-4384-9
                 (casebound), 978-0-7803-4385-6 (microfiche)",
  LCCN =         "TK5105.5 .I33 1998",
  bibdate =      "Tue Aug 18 07:55:34 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib",
  note =         "Three volumes.",
  acknowledgement = ack-nhfb,
}

%% Last MathSciNet database search: Wed Sep 28 15:25:27 2011 [years 1970--2012]
%% [zero hits]
%% Last ACM Portal database search: Wed Sep 28 17:04:02 2011 [all years]