Entry Gall:1990:PTE from compnetisdn.bib

Last update: Fri Jan 5 02:05:58 MST 2018                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Gall:1990:PTE,
  author =       "P. Le Gall",
  title =        "Packetized Traffic Engineering for New Services",
  journal =      j-COMP-NET-ISDN,
  volume =       "20",
  number =       "1--5",
  pages =        "425--433",
  year =         "1990",
  CODEN =        "CNISE9",
  ISSN =         "0169-7552 (print), 1879-2324 (electronic)",
  ISSN-L =       "0169-7552",
  bibdate =      "Sat Sep 25 15:30:02 1999",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1990.bib;
                 http://www.math.utah.edu/pub/tex/bib/compnetisdn.bib",
  note =         "ITC Specialist Seminar, 25--29 September 1989,
                 Adelaide, Australia.",
  abstract =     "New telecommunications services will make extensive
                 use of packet switching: packet switched data networks,
                 B-ISDN, CCSN. In order to define traffic engineering
                 rules, we examine how the local waiting time for a link
                 depends on the size of packets and, especially, on the
                 possible interference between traffic streams on
                 several successive links. We give a simple formula
                 characterizing this dependence. ANNOTE: Queueing
                 theory. Input is",
  acknowledgement = ack-nhfb,
  date =         "00/00/00",
  descriptors =  "Queueing network; packet switching; traffic
                 engineering; B-ISDN",
  enum =         "8798",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01697552",
  language =     "English",
  references =   "0",
  revision =     "25/04/94",
}

Related entries