ATM Network Performance describes a unified approach to ATM network management. The focus is on satisfying quality-of-service requirements for individual B-ISDN connections. For an ATM network of output-buffer switches, the author describes how the basic network resources (switch buffer memory and link transmission bandwidth) should be allocated to achieve the required quality-of-service connections. The performance of proposed bandwidth scheduling policies is evaluated. Both single node and end-to-end performance results are given. In particular, these results are applied to resource provisioning problems for prerecorded (stored) video and video teleconferencing. The flow control problem for available bit rate traffic is also described. This book is intended for a one-term course in performance of Broadband Integrated-Services Digital Networks (B-ISDNs) based on a type of packet-switched communication network called Asynchronous Transfer Mode (ATM). The level of presentation is at the first year of graduate studies and for professionals working in the field, but it may be accessible to senior undergraduates as well. Some familiarity with ATM standards is assumed as such standards are only briefly outlined. All of the required background in discrete-time queueing theory is supplied. Exercises are given at the end of chapters. Solutions and/or hints to selected exercises are given in an Appendix.

ATM Network Performance describes a unified approach to ATM network management. The focus is on satisfying quality-of-service requirements for individual B-ISDN connections. For an ATM network of output-buffer switches, the author describes how the basic network resources (switch buffer memory and link transmission bandwidth) should be allocated to achieve the required quality-of-service connections. The performance of proposed bandwidth scheduling policies is evaluated. Both single node and end-to-end performance results are given. In particular, these results are applied to resource provisioning problems for prerecorded (stored) video and video teleconferencing. The flow control problem for available bit rate traffic is also described. This book is intended for a one-term course in performance of Broadband Integrated-Services Digital Networks (B-ISDNs) based on a type of packet-switched communication network called Asynchronous Transfer Mode (ATM). The level of presentation is at the first year of graduate studies and for professionals working in the field, but it may be accessible to senior undergraduates as well. Some familiarity with ATM standards is assumed as such standards are only briefly outlined. All of the required background in discrete-time queueing theory is supplied. Exercises are given at the end of chapters. Solutions and/or hints to selected exercises are given in an Appendix.

ATM Network Performance describes a unified approach to ATM network management. The focus is on satisfying quality-of-service requirements for individual B-ISDN connections. For an ATM network of output-buffer switches, the author describes how the basic network resources (switch buffer memory and link transmission bandwidth) should be allocated to achieve the required quality-of-service connections. The performance of proposed bandwidth scheduling policies is evaluated. Both single node and end-to-end performance results are given. In particular, these results are applied to resource provisioning problems for prerecorded (stored) video and video teleconferencing. The flow control problem for available bit rate traffic is also described. This book is intended for a one-term course in performance of Broadband Integrated-Services Digital Networks (B-ISDNs) based on a type of packet-switched communication network called Asynchronous Transfer Mode (ATM). The level of presentation is at the first year of graduate studies and for professionals working in the field, but it may be accessible to senior undergraduates as well. Some familiarity with ATM standards is assumed as such standards are only briefly outlined. All of the required background in discrete-time queueing theory is supplied. Exercises are given at the end of chapters. Solutions and/or hints to selected exercises are given in an Appendix.