Multimedia Storage and Retrieval: An Algorithmic Approach / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
$129.60
(Save 4%)
Used and New from Other Sellers
Used and New from Other Sellers
from $14.09
Usually ships in 1-2 business days
(Save 89%)
Other sellers (Hardcover)
  • All (17) from $14.09   
  • New (6) from $105.50   
  • Used (11) from $14.09   

Overview

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.
Read More Show Less

Editorial Reviews

From the Publisher

"This book will appeal to computer science and electrical engineering students interested in storage for multimedia systems." (CHOICE, June 2005)

Read More Show Less

Product Details

  • ISBN-13: 9780470091036
  • Publisher: Wiley, John & Sons, Incorporated
  • Publication date: 1/28/2005
  • Edition description: New Edition
  • Edition number: 1
  • Pages: 274
  • Product dimensions: 6.22 (w) x 9.41 (h) x 0.80 (d)

Meet the Author

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.

Read More Show Less

Table of Contents

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.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)