✦ LIBER ✦

A data request scheduling policy for PCS networks

✍ Scribed by Wen-Nung Tsai; Yi-Bing Lin

Book ID: 110322971
Publisher: Springer US
Year: 1997
Tongue: English
Weight: 272 KB
Volume: 2
Category: Article
ISSN: 1383-469X
DOI: 10.1023/a:1013620314242

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Equal resource sharing scheduling for PC

Equal resource sharing scheduling for PCS data services

✍ Jeu-Yih Jeng; Yi-Bing Lin 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 356 KB

Heuristics for Scheduling Data Requests

Heuristics for Scheduling Data Requests Using Collective Communications in a Distributed Communication Network

✍ Mitchell D. Theys; Howard Jay Siegel; Edwin K.P. Chong 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 369 KB

The collective communication process studied here involves the ability of users to request information from diverse sources (both in terms of locality and data type) and receive this information before the users' deadlines expire. A model has been developed and examined for the case when the network

A Request for Data.

✍ Symington, Frank W. 📂 Article 📅 1991 🏛 Nature Publishing Group 🌐 English ⚖ 626 KB

Capacity scheduling for data services ov

Capacity scheduling for data services over digital networks

✍ Wim F. J. Verhaegh 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 308 KB

In this paper we present the problem of scheduling the playout of data services over a digital video network. First, we develop a mathematical model of it and analyse its computational complexity. Next, we propose to tackle it by means of local search. To this end, we develop a linear programming ap

Multiuser diversity based opportunistic

Multiuser diversity based opportunistic scheduling for wireless data networks

✍ Gyasi-Agyei, A. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 238 KB

A new random walk model for PCS networks

✍ Akyildiz, I.F.; Yi-Bing Lin; Wei-Ru Lai; Rong-Jaye Chen 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 215 KB