Scheduling and Flow-Related Problems in Networks: Algorithms and Complexity - Softcover

Hall, Alexander

Softcover

ISBN 10: 3639409779 ISBN 13: 9783639409772

Verlag: AV Akademikerverlag, 2012

Inhaltsangabe

Revision with unchanged content. Recently the number of applications in the Internet which use data broad­casts, such as pay-per-view services, has increased greatly. In broadcast scheduling one is interested in answering user requests in such services with as little bandwidth as possible by bundling the answers appropriately. Flows over time are an important notion arising in connection with various appli­cations in communication and transportation networks. One of the basic question here is how can demands in a given network be routed to their destinations as quickly as possible? Economic relationships in the Internet are of great interest, e.g., when investigating robustness issues. Since they are treated as trade secrets, it is a challenge to infer them form samples of routes taken by packets in the Internet. The author Alexander Hall gives intro­ductions and several novel results for these three problem areas. Some of the main results resolve the complexity of the major optimization problems encountered in the three areas. Thereby, important and in some cases long-standing open questions have been answered. From an algorithmic point of view, optimal and approximation algorithms for each of the three areas are proposed. This book is of interest to scientists in academia and industry working on research problems pertaining to communication and transportation net­works.

Über diesen Titel

Über die Autorin bzw. den Autor

Dr. Alexander HallReceived his PhD degree in the area of Theoretical Computer Science at the ETH Zurich and is currently a Software Engineer at Google, Switzerland.

Details zur Ausgabe

• Verlag: AV Akademikerverlag
• Erscheinungsdatum: 2012
• Sprache: Englisch
• ISBN 10: 3639409779
• ISBN 13: 9783639409772
• Einband: Taschenbuch
• Anzahl der Seiten: 160
• Kontakt zum Hersteller: Nicht verfügbar
• Verantwortliche Person: Nicht verfügbar