Abstract

Broadcasting mechanisms have been widely used to transfer information to a large number of clients. Information is transferred by broadcast servers (satellites or base stations) downstream with a wide bandwidth. Most of the broadcast schemes try to minimize the average “access time”. This paper presents a real-time broadcast algorithm that transfers many information items including one with timing constraint. Our real-time broadcast algorithm attempts to meet the deadline for real-time information as well as to minimize the average access time for non-real-time information. Simulation results show that our algorithm can reduce the average access time for the non-real-time information while meeting the deadline for the real-time information.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.