Springer Algorithms for Next Generation Networks (Computer Communications and Networks)

Data networking now plays a major role in everyday life and new applications continue to appear at a blinding pace. Yet we still do not have a sound foundation for designing, evaluating and managing these networks. This book covers topics at the intersection of algorithms and networking. It builds a complete picture of the current state of research on Next Generation Networks and the challenges for the years ahead. Particular focus is given to evolving research initiatives and the architecture they propose and implications for networking. Topics: Network design and provisioning, hardware issues, layer-3 algorithms and MPLS, BGP and Inter AS routing, packet processing for routing, security and network management, load balancing, oblivious routing and stochastic algorithms, network coding for multicast, overlay routing for P2P networking and content delivery. This timely volume will be of interest to a broad readership from graduate students to researchers looking to survey recent research its open questions. Review From the reviews: "Understanding the science behind the networks of today is the necessary foundation for making significant contributions to the rapid evolution of next generation networks. This timely book comprised of chapters from authoritative experts provides an excellent overview of algorithms that form the basis of next generation communication networks. It covers problems ranging in scope from physical layer issues to the design of next generation applications. I strongly recommend this valuable book as essential reading for students, practitioners and researchers who are actively engaged in creating the emerging next generation communication networks." Debasis Mitra, Bell Laboratories "A few months ago a colleague at Georgia Tech asked me ‘Which are the top-10 most significant algorithms that have been developed by networking research in the last decade?’ This book would provide an excellent answer. Covering a wide range of topics from the entire spectrum of networking research, this book is highly recommended for anyone that wants to become familiar with the ‘network algorithmics’ state-of-the-art of the evolving Internet." Constantine Dovrolis, Georgia Institute of Technology “This book addresses issues surrounding the evolution of the Internet as it matures in the early 21st century. … The focus on algorithms to augment and in some cases replace historical ad hoc designs is timely. … book should be useful to researchers in the field who seek to establish firm foundations for their work. … Each paper has extensive references, and the book has an adequate index. It mercifully steers clear of policy considerations such as Net neutrality.” (J. S. Edwards, ACM Computing Reviews, August, 2010) From the Back Cover With the dawn of this new century, we are now on the verge of expanding the notion of what we mean to communicate. A new generation of "netizens" are poised to leverage the Internet for a myriad different applications that we have not envisioned thus far. This will require that the Internet be flexible and adapt to accommodate the requirements of next generation applications. This important and timely volume presents a comprehensive survey of the algorithms and methodologies presently used in the design and deployment of the Internet. Issues of network design, network operations and management, and emerging applications are discussed by a collection of experts on the algorithmic foundations of the Internet. Covering topics at the intersection of algorithms and networking, the book builds a complete picture of the current state of research on next generation networks and the challenges for the years ahead. Topics and features * Contains a Foreword by Charles R. Kalmanek, and contributions from leading researchers in the field * Outlines the goals for optimization in network design, considering optimizability of protocols and the optimum placement of network functionality