Korst / Pronk | Multimedia Storage and Retrieval | Buch | 978-0-470-09103-6 | sack.de

Buch, Englisch, 272 Seiten, Format (B × H): 156 mm x 235 mm, Gewicht: 527 g

Korst / Pronk

Multimedia Storage and Retrieval

An Algorithmic Approach
1. Auflage 2005
ISBN: 978-0-470-09103-6
Verlag: Wiley

An Algorithmic Approach

Buch, Englisch, 272 Seiten, Format (B × H): 156 mm x 235 mm, Gewicht: 527 g

ISBN: 978-0-470-09103-6
Verlag: Wiley


The success of multimedia information systems to adequately meet the needs of accessing and presenting audio/video information from a large multimedia server depends heavily on the proper use of storage and retrieval algorithms suitable for this task.
Multimedia Storage and Retrieval describes various algorithms from simple to sophisticated: from single user to multiple users, from constant-bit-rate to variable-bit-rate streams, and from single disk to multiple disks. This book emphasizes storage and retrieval of video data using magnetic disk systems and its elementary, mathematical approach concentrates on the fundamental algorithms.
- Provides those new to the subject with the basic principles of the design and analysis of video-on-demand systems and guides the reader towards a thorough understanding of the field.
- Comprehensively covers disk scheduling algorithms, including round robin, double and triple buffering, grouped sweeping, and dual sweep.
- Extensively treats storage strategies, including contiguous and segmented storage, track pairing, striping, and random redundant storage.
- Concludes with further optimizations in the area of video transmission, covering bit-rate smoothing and near video-on-demand strategies.
Senior undergraduate and graduate students on computer science and electrical engineering courses will all find this book appealing. Researchers and those in industry will also find it an invaluable reference.

Korst / Pronk Multimedia Storage and Retrieval jetzt bestellen!

Autoren/Hrsg.


Weitere Infos & Material


Preface.
PART I: PRELIMINARIES.

1. Introduction.

2. Modeling Server and Streams.

PART II: DISK SCHEDULING.

3. Serving a Single CBR Stream.

4. Serving Multiple CBR Streams.

5. Serving Multiple VBR Streams.

PART III: STORAGE ON A SINGLE DISK.

6. File Allocation Strategies.

7. Using a Multi-Zone Disk.

PART IV: STORAGE ON MULTIPLE DISKS.

8. Striping.

9. Random Redundant Storage.

PART V: DATA TRANSMISSION.

10. Bit-Rate Smoothing Algorithms.

11. Near Video-on-Demand Strategies.

Bibliography.

Author Index.

Subject Index.


Jan Korst received his M.Sc. degree in mathematics from Delft University of Technology, and his Ph.D.degree from Eindhoven University of Technology, both in the Netherlands. Since 1985, he has been with the Philips Research Laboratories in Eindhoven. His research lies mainly in the areas of scheduling and resource management problems in the areas of IC design and multimedia systems.
Verus Pronk received his M.Sc. degree with distinction in mathematics from Eindhoven University of Technology, in the Netherlands. Since 1988, he has been with the Philips Research Laboratories in Eindhoven, where he has been active in the fields of fault-tolerant computing and communication, resource management in multimedia systems, contract negotiation and charging in ATM networks, and MAC protocols and scheduling in access networks. His current activities focus on performance issues and quality of service in access networks and in video-on-demand systems.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.