Mathematical Aspects of Network Routing Optimization
Mathematical Aspects of Network Routing Optimization provides a thorough introduction to the subject of algorithms for network routing and focuses on multicast and wireless ad hoc systems. The modern world is connected through large-scale, computational n
- PDF / 2,357,999 Bytes
- 220 Pages / 439.37 x 666.142 pts Page_size
- 111 Downloads / 180 Views
Aims and Scope Optimization has been expanding in all directions at an astonishing rate during the last few decades. New algorithmic and theoretical techniques have been developed, the diffusion into other disciplines has proceeded at a rapid pace, and our knowledge of all aspects of the field has grown even more profound. At the same time, one of the most striking trends in optimization is the constantly increasing emphasis on the interdisciplinary nature of the field. Optimization has been a basic tool in all areas of applied mathematics, engineering, medicine, economics, and other sciences. The series Springer Optimization and Its Applications series publishes undergraduate and graduate textbooks, monographs, and state-of-the-art expository work that focus on algorithms for solving optimization problems and also study applications involving such problems. Some of the topics covered include nonlinear optimization (convex and nonconvex), network flow problems, stochastic optimization, optimal control, discrete optimization, multi-objective programming, description of software packages, approximation techniques and heuristic approaches.
For further volumes: http://www.springer.com/series/7393
Carlos A.S. Oliveira
Panos M. Pardalos
Mathematical Aspects of Network Routing Optimization
123
Carlos A.S. Oliveira Research and Development Division Bloomberg LP New York, NY 10022 USA [email protected]
Panos M. Pardalos Department of Industrial and Systems Engineering University of Florida 303 Weil Hall Gainesville, FL 32611 USA [email protected]
ISSN 1931-6828 ISBN 978-1-4614-0310-4 e-ISBN 978-1-4614-0311-1 DOI 10.1007/978-1-4614-0311-1 Springer New York Dordrecht Heidelberg London Library of Congress Control Number: 2011933566 Mathematics Subject Classification (2010): 47N10, 65K10, 49M25, 90C27 c Springer Science+Business Media, LLC 2011 All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer Science+Business Media, LLC, 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
Contents
1
Unicast Routing Algorithms .. . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.1 Unicast Routing Concepts . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1.2 Flooding Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . .
Data Loading...
