Advanced

Routing, flow, and capacity design in communication and computer networks

Pioro, Michal LU and Medhi, Deepankar (2004) In The Morgan Kaufmann Series in Networking
Abstract
In network design, the gap between theory and practice is woefully broad. This book narrows it, comprehensively and critically examining current network design models and methods. You will learn where mathematical modeling and algorithmic optimization have been under-utilized. At the opposite extreme, you will learn where they tend to fail to contribute to the twin goals of network efficiency and cost-savings. Most of all, you will learn precisely how to tailor theoretical models to make them as useful as possible in practice.



Throughout, the authors focus on the traffic demands encountered in the real world of network design. Their generic approach, however, allows problem formulations and solutions to be applied across... (More)
In network design, the gap between theory and practice is woefully broad. This book narrows it, comprehensively and critically examining current network design models and methods. You will learn where mathematical modeling and algorithmic optimization have been under-utilized. At the opposite extreme, you will learn where they tend to fail to contribute to the twin goals of network efficiency and cost-savings. Most of all, you will learn precisely how to tailor theoretical models to make them as useful as possible in practice.



Throughout, the authors focus on the traffic demands encountered in the real world of network design. Their generic approach, however, allows problem formulations and solutions to be applied across the board to virtually any type of backbone communication or computer network. For beginners, this book is an excellent introduction. For seasoned professionals, it provides immediate solutions and a strong foundation for further advances in the use of mathematical modeling for network design. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Book/Report
publication status
published
subject
keywords
computer networks, communication networks, network design, integer programming, optimization, multi-commodity flows
in
The Morgan Kaufmann Series in Networking
pages
765 pages
publisher
Morgan Kaufmann Publishers
ISBN
0-12-557189-5
language
English
LU publication?
yes
id
8490f1c5-eac5-4129-b509-b1ac248dc37a (old id 939189)
date added to LUP
2008-01-21 11:45:35
date last changed
2016-04-16 08:46:32
@misc{8490f1c5-eac5-4129-b509-b1ac248dc37a,
  abstract     = {In network design, the gap between theory and practice is woefully broad. This book narrows it, comprehensively and critically examining current network design models and methods. You will learn where mathematical modeling and algorithmic optimization have been under-utilized. At the opposite extreme, you will learn where they tend to fail to contribute to the twin goals of network efficiency and cost-savings. Most of all, you will learn precisely how to tailor theoretical models to make them as useful as possible in practice.<br/><br>
<br/><br>
Throughout, the authors focus on the traffic demands encountered in the real world of network design. Their generic approach, however, allows problem formulations and solutions to be applied across the board to virtually any type of backbone communication or computer network. For beginners, this book is an excellent introduction. For seasoned professionals, it provides immediate solutions and a strong foundation for further advances in the use of mathematical modeling for network design.},
  author       = {Pioro, Michal and Medhi, Deepankar},
  isbn         = {0-12-557189-5},
  keyword      = {computer networks,communication networks,network design,integer programming,optimization,multi-commodity flows},
  language     = {eng},
  pages        = {765},
  publisher    = {ARRAY(0x80cfbc0)},
  series       = {The Morgan Kaufmann Series in Networking},
  title        = {Routing, flow, and capacity design in communication and computer networks},
  year         = {2004},
}