Generalized Network Design Problems

Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem c

Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory.

An issue in engineering design is a system's design lifetime. Economists study durability choice problems for consumer goods but seldom address lifetime problem(s) of complex engineering systems. The issues for engineering systems are complex and multidisciplinary and require an understanding of the 'technicalities of durability' and the economic implications of the marginal cost of durability and value maximization. Commonly the design lifetime for an infrastructure is set between 30 and 70 years. Satellite lifetimes are also assigned arbitrarily or with limited analysis. This book provides a systemic qualitative and quantitative approach to these problems addressing, first, the technicality of durability, second, the marginal cost of durability, and third, the durability choice problem for complex engineering systems with network externalities (competition and market uncertainty) and obsolescence effects (technology evolution). Since the analyses are system-specific, a satellite exam

The advent of fiber optic transmission systems and wavelength division multiplexing (WDM) have led to a dramatic increase in the usable bandwidth of single fiber systems. This book provides detailed coverage of survivability (dealing with the risk of losing large volumes of traffic data due to a failure of a node or a single fiber span) and traffic grooming (managing the increased complexity of smaller user requests over high capacity data pipes), both of which are key issues in modern optical networks. A framework is developed to deal with these problems in wide-area networks, where the topology used to service various high-bandwidth (but still small in relation to the capacity of the fiber) systems evolves toward making use of a general mesh. Effective solutions, exploiting complex optimization techniques, and heuristic methods are presented to keep network problems tractable. Newer networking technologies and efficient design methodologies are also described.

Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also considered. With vital algorithms, numerous illustrations, examples and homework problems, this textbook is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science. Practitioner

Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems to circuit design, network optimization,

Constrained motion is of paramount importance in the design and analysis of mechanical systems and central to the study of analytical dynamics. The problem of constrained motion was first posed over two hundred years ago, and it has been worked on vigorously ever since. This book offers a fresh approach to the subject. Eminently readable, it is written as an introduction to analytical dynamics, with emphasis on fundamental concepts in mechanics. The connection between generalized inverses of matrices and constrained motion is a central theme. The book begins with a description of the motion of a particle subjected to holonomic and nonholonomic constraints and presents explicit equations of motion. Examples are provided throughout the book, and carefully formulated problems at the end of each chapter reinforce the material covered. This computationally appealing approach will be useful to students in engineering and the applied sciences.