A Scheduling Method on Selective Contents Delivery with Node Relay-based Webcast Considering Data Size

نویسندگان

  • Yusuke Gotoh
  • Tomoki Yoshihisa
  • Hideo Taniguchi
  • Masanori Kanazawa
چکیده

Due to the recent popularization of digital broadcasting systems, selective contents broadcasting depending on users' preferences have attracted great attention. Although the server can deliver programs reflecting users' preferences, clients have to wait until their selected contents start playing. Conventional methods reduce the waiting time by producing an effective broadcast schedule. Although the server can deliver programs that meet users' preferences, clients have to wait until their selected contents are delivered. In this paper, we propose a method to reduce the waiting time on selective contents delivery with node relay-based webcast that relay data among nodes. Our proposed method reduces the waiting time by scheduling contents considering available bandwidth of each node.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooperative Orthogonal Space-Time-Frequency Block Codes over a MIMO-OFDM Frequency Selective Channel

In this paper, a cooperative algorithm to improve the orthogonal space-timefrequency block codes (OSTFBC) in frequency selective channels for 2*1, 2*2, 4*1, 4*2 MIMO-OFDM systems, is presented. The algorithm of three node, a source node, a relay node and a destination node is formed, and is implemented in two stages. During the first stage, the destination and the relay antennas receive the sym...

متن کامل

A chance-constrained multi-objective model for final assembly scheduling in ATO systems with uncertain sub-assembly availability

A chance-constraint multi-objective model under uncertainty in the availability of subassemblies is proposed for scheduling in ATO systems. The on-time delivery of customer orders as well as reducing the company's cost is crucial; therefore, a three-objective model is proposed including the minimization of1) overtime, idletime, change-over, and setup costs, 2) total dispersion of items’ deliver...

متن کامل

A Scheduling Method for Bandwidth Reduction in Selective Contents Broadcasting

Due to the recent popularization of digital broadcasting systems, selective contents, i.e., users watch their selected contents, have attracted great attention. For example, in a quiz program, a user selects his/her answer and watches the video content corresponding to the answer. Although a server can deliver content according to users’ preferences, the necessary bandwidth to play the content ...

متن کامل

Relay Node Scheduling Model Based on Improved Discrete Markov Chain

This paper focuses on relay node scheduling method which is based on an improved discrete Markov chain. It presents a single relay node’s existing state, analyzes its access behavior, and summarizes various linear system design, according to our present balanced equations and form state transition probability, nodes are scheduled in relay network, the improved discrete time Markov chain is used...

متن کامل

Relay Scheduling and Cooperative Diversity for Delay-Sensitive and Bursty Traffic

This paper considers a problem of scheduling and cluster size with N i.i.d. source nodes trying to transmit data to a common destination node (e.g. a gateway or a processing center), with the help of some subset of nodes in the form of relays. The source nodes share the network in a TDM manner, using a round-robin scheduling scheme. There are two causes of bit errors in the system: channel deco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • AISS

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2010