- We will send in 10–14 business days.
/images/books/13174446/9783639093636.jpg)
- Author: Prabhu Manyem
- Publisher: VDM Verlag
- ISBN-10: 3639093631
- ISBN-13: 9783639093636
- Format: 15.2 x 22.9 x 0.6 cm, softcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
Demand for network services such as video conferencing has grown by leaps and bounds over the last several years. Muticasting is a vital part of the communication architecture. It takes into account users dropping in and out of the network in a dynamic fashion (for example, in a live social interaction setting such as internet chat rooms). Hence there is a need to quickly compute effective routing. This book presents efficient routing algorithms that are easy to implement. In addition, intractability results are presented; these describe the best possible solution that we can hope to obtain within a reasonable amount of time. This book will be useful to industry professionals in the data communication industry, who can start with the heuristics described here and develop a better approach; and to graduate students in Data Networking, Combinatorial Optimization, Approximation Algorithms and Computational Complexity. It should serve as a handy reference to academics in these fields.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 20d.17:04:31
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Prabhu Manyem
- Publisher: VDM Verlag
- ISBN-10: 3639093631
- ISBN-13: 9783639093636
- Format: 15.2 x 22.9 x 0.6 cm, softcover
- Language: English English
Demand for network services such as video conferencing has grown by leaps and bounds over the last several years. Muticasting is a vital part of the communication architecture. It takes into account users dropping in and out of the network in a dynamic fashion (for example, in a live social interaction setting such as internet chat rooms). Hence there is a need to quickly compute effective routing. This book presents efficient routing algorithms that are easy to implement. In addition, intractability results are presented; these describe the best possible solution that we can hope to obtain within a reasonable amount of time. This book will be useful to industry professionals in the data communication industry, who can start with the heuristics described here and develop a better approach; and to graduate students in Data Networking, Combinatorial Optimization, Approximation Algorithms and Computational Complexity. It should serve as a handy reference to academics in these fields.
Reviews