Introduction to queueing networks
Author(s)
Bibliographic Information
Introduction to queueing networks
J. Wiley, c1998
2nd ed
- Other Title
-
Introduction aux réseaux de files d'attente
Available at 15 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references and index
Description and Table of Contents
Description
Introduction to Queueing Networks Second Edition Erol Gelenbe, Duke University, North Carolina, USA and Guy Pujolle, University of Versailles, France With new concepts emerging in recent literature, this is a timely update to a highly successful and well established first edition. Queueing networks are particularly important as digital communications continue to grow; this text provides a through and comprehensive introduction to the concept of applying mathematical queueing network theory to data communications. New additions: G-nets, i.e. generalized (or "Gelenbe") queueing networks which allow the analysis of on-line network control functions such as traffic re-routing, discrete time queueing networks with application to ATM networks As leading authorities in this area, the authors' focus on the practical approach where aspects of queueing theory are applied directly to communications systems and networks. Included is a series of exercises and examples at the end of each chapter as well as a fully annotated bibliography. This book is of particular interest to communications and computer engineers and is essential reading for network. managers and administrators.
It will also benefit students and researchers in the area of networks, as well as Web server administrators and personal computer users. Visit Our Web Page! http://www wiley.com/
Table of Contents
Queues with a Single Server. Jackson Networks. Extensions to Queues with a Single Server. Baskett, Chandy, Muntz and Palacios Networks. Approximate Methods. Flows in Networks. G-Networks: Positive and Negative Customers, Signals and Batch Removal. G-Networks with Multiple Classes of Signals and Positive Customers. Discrete-Time Queueing Systems. Bibliography. Appendix. Index.
by "Nielsen BookData"