Roy / Saxena Data Scheduling and Transmission Strategies in Asymmetric Telecommunication Environments

Erscheinungsjahr 2008
ISBN: 978-1-4200-4656-4
Verlag: Taylor & Francis
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)

E-Book, Englisch, 160 Seiten

Recent advancement and increased growth in Web technologies have resulted in an even greater need for more efficient scheduling and data transmission strategies. An increased reliance on wireless communications devices, with their constraint issues, has further complicated the problem. While both push and pull strategies provide certain solutions, each has limitations that compromise performance. What is becoming clear is that any optimal solutions will require novel push-pull hybrid approaches. Data Scheduling and Transmission Strategies in Asymmetric Telecommunications Environments helps systems architects and engineers take on this challenge by providing a thorough discussion of major data and scheduling and transmission strategies. Written by two highly respected pioneering researchers, this work takes a comparative and practical approach that incorporates much of the authors’ original research. They discuss basic push and pull strategies and examine the challenges posed by customer requests and behavior, before defining ideal hybrid strategies. Exceptionally thorough in this practical approach, they demonstrate the value of separating clients by class and introduce the concept of an importance factor to properly prioritize a system. They also look at a new on-line hybrid solutions for multichannel broadcast problems and go on to address future problems that are likely to remain open. For those seeking to extract the best performance out of data transmission schemes in asymmetric environments, this invaluable resource is unparalleled in its depth of coverage and innovation.

Zielgruppe

Researchers, graduate students, system architects, and engineers.

Autoren/Hrsg.

Roy, Abhishek

Saxena, Navrati

Fachgebiete

• Technische Wissenschaften Elektronik | Nachrichtentechnik Nachrichten- und Kommunikationstechnik

Inhaltsverzeichnis

Introduction

Asymmetric Communication Environments

Unicast Versus Broadcast

Push Scheduling Systems

Pull Scheduling Systems

Disadvantages: Push and Pull Systems

Hybrid Scheduling Systems

Client’s Impatience

Service Classification and Differentiated QoS

Multichannel Scheduling

Contribution and Scope of the Work

Organization of the Book

Related Work in Push-Pull Scheduling

Push-based Systems

Broadcast Disks for Asymmetric Communication

Paging in Broadcast Disks

Polynomial Approximation Scheme for Data Broadcast

Packet Fair Scheduling

Broadcasting Multiple Data Items

Broadcasting Data Items with Dependencies

Broadcast Schedule with Polynomial Cost Functions

Jitter Approximation Strategies in Periodic Scheduling

Dynamic Levelling for Adaptive Data Broadcasting

Pull-based Systems

On-Demand Data Dissemination

RxW Scheduling

Data Staging for On-Demand Broadcast

Pull Scheduling with Timing Constraints

Scheduling with Largest Delay Cost First

Both Push and Pull

Lazy Data Request for On-Demand Broadcasting

Hybrid Scheduling

Balancing Push and Pull

On-Demand Broadcast for Efficient Data Dissemination

Channel Allocation for Data Dissemination

Wireless Hierarchical Data Dissemination System

Adaptive Hybrid Data Delivery

Adaptive Realtime Bandwidth Allocation

Adaptive Dissemination in Time-Critical Environments

Adaptive Scheduling with Loan-Based Feedback Control

Framework for Scalable Dissemination-Based Systems

Guaranteed Consistency and Currency in Read-Only Data

Broadcast in Wireless Networks With User Retrials

Hybrid Push-Pull Scheduling

Hybrid Scheduling for Unit-length Items

Assumptions and Motivations

The Basic Hybrid Push-Pull Algorithm

Simulation Experiments

Dynamic Hybrid Scheduling with Heterogeneous Items

Heterogeneous Hybrid Scheduling Algorithm

Modeling the System

Experimental Results

Adaptive Push-Pull Algorithm with Performance Guarantee

Adaptive Dynamic Hybrid Scheduling Algorithm

Analytical Underpinnings

Simulation Experiments

Performance Guarantee in Hybrid Scheduling

Hybrid Scheduling with Client’s Impatience

Hybrid Scheduling Algorithm

Hybrid Scheduling with Clients’ Departure

Hybrid Scheduling with Anomalies

Performance Modeling and Analysis

Assumptions

Client’s Departure from the System

Anomalies from Spurious Requests

Simulation Experiments

Hybrid Scheduling with Client’s Departure

Hybrid Scheduling with Anomalies

Dynamic Hybrid Scheduling with Request Repetition

Repeat-Attempt Hybrid Scheduling Scheme

Performance Analysis of the Hybrid Repeat Attempt System

Simulation Experiments

Service Classification in Hybrid Scheduling for Differentiated QoS

Hybrid Scheduling with Service Classification

Delay and Blocking in Differentiated QoS

Average Number of Elements in the System

Priority-Based Service Classification

Simulation Experiments

Assumptions

Results

Online Hybrid Scheduling over Multiple Channels

Preliminaries: Definitions and Metrics

A New Multi-Channel Hybrid Scheduling

Balanced K Channel Allocation with Flat Broadcast Per Channel

On-Line Balanced K Channel Allocation with Hybrid Broadcast Per Channel

Simulation Results

Results

Conclusions and Future Works