Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
|---|---|---|---|---|---|
Searching... | EB000236 | EB 000236 | Electronic Book | 1:EBOOK | Searching... |
On Order
Summary
Summary
This useful volume adopts a balanced approach between technology and mathematical modeling in computer networks, covering such topics as switching elements and fabrics, Ethernet, and ALOHA design. The discussion includes a variety of queueing models, routing, protocol verification and error codes and divisible load theory, a new modeling technique with applications to grids and parallel and distributed processing. Examples at the end of each chapter provide ample material for practice. This book can serve as an text for an undergraduate or graduate course on computer networks or performance evaluation in electrical and computer engineering or computer science.
Reviews 1
Choice Review
Robertazzi (Stony Brook Univ., NY) has written a powerful book on computational assessments of network grids and telecommunication systems. It provides a heady combination of technological and mathematical theories and is not for those without some advanced mathematical training. This reviewer found chapter 1 particularly enjoyable--it would serve as an excellent reference in any introductory computer network course. It starts with a quick tour of connectivity and progresses nicely through multiplexing, circuit and packet switching, layered protocols, and Ethernet. Chapter 2 is a study of stochastic models including Bernoulli and Poisson processes, teletraffic modeling, and switching elements. Chapter 3 offers insightful, intriguing methods and solutions related to queueing theory and stochastic Petri network theory. Chapter 4 studies fundamental deterministic algorithms, although they are often found in stochastic environments. It includes a close look at Dijkstra's and Ford-Fulkerson's algorithms and ends with a treatise on protocol verification with error, parity, and CRC codes. The fifth and last chapter looks at divisible load modeling for grids using linear programming and related recursive means. Each chapter has an abundance of challenging problems. Summing Up: Highly recommended. Graduate students, professionals. M. Connell SUNY College at Cortland
