Conference Paper

Data Broadcast Scheduling in Broadcast/UMTS Integrated Systems Using Mathematical Modeling and Computing Techniques.

DOI: 10.1109/WCNC.2008.561 Conference: WCNC 2008, IEEE Wireless Communications & Networking Conference, March 31 2008 - April 3 2008, Las Vegas, Nevada, USA, Conference Proceedings
Source: DBLP


Wireless broadcast systems provide the users with high bandwidth while 3G cellular systems provide complementary service to support personality and interactivity. In this paper, we develop a novel scheduling algorithm for the integrated Wireless Broadcast/3G system. The proposed algorithm combines Analytic hierarchy process (AHP) and Grey relational analysis (GRA). Simulation results are presented to demonstrate that the proposed algorithm could effectively support data dissemination with low response time, request drop rate, and the unfairness of request drop.

Download full-text


Available from: Ying Wang, Nov 13, 2014
25 Reads
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and deal with dynamic user access patterns. With the rapid growth of time-critical information services in emerging applications, there is an increasing need for the system to support timely data dissemination. This paper investigates online scheduling algorithms for time-critical on-demand data broadcast. We propose a novel scheduling algorithm called SIN-α that takes the urgency and number of outstanding requests into consideration. An efficient implementation of SIN-α is presented. We also analyze the theoretical bound of request drop rate when the request arrival rate rises toward infinity. Trace-driven experiments show that SIN-α significantly outperforms existing algorithms over a wide range of workloads and approaches the analytical bound at high request rates.
    IEEE Transactions on Parallel and Distributed Systems 02/2006; 17(1):3- 14. DOI:10.1109/TPDS.2006.14 · 2.17 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The dramatic improvements in global interconnectivity due to intranets, extranets, and the Internet has led to an explosion in the number and variety of new data-intensive applications. Along with the proliferation of these new applications have come increased problems of scale. This is demonstrated by frequent delays and service, disruptions when accessing networked data sources. Recently, push-based techniques have been proposed as a solution to scalability problems for distributed applications. This paper argues that push indeed has its place, but that it is just one aspect of a much larger design space for distributed information systems. We propose the notion of a Dissemination-Based Information System (DBIS) which integrates a variety of data delivery mechanisms and information broker hierarchies. We discuss the properties of such systems and provide some insight into the architectural imperatives that will influence their design. The DBIS framework can serve as the basis for development of a toolkit for constructing distributed information systems that better match the technology they employ to the characteristics of the applications they are intended to support.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper addresses two unresolved issues about web caching. The first issue is whether web requests from a fixed user community are distributed according to Zipf's law [22]. Several early studies have supported this claim [9], [5], while other recent studies have suggested otherwise [16], [2]. The ;econd issue relates to a number of recent studies on the characteristics of web proxy traces, which have shown that the hit-ratios and temporal locality of the traces exhibit certain asymptotic properties that are uniform across the different sets of the traces [43, [XO], [71, [XO], [XS]. In partlc- ular, the question is whether these properties are inherent to web accesses or whether they are simply an artifact of the traces. An answer to these unresolved issues will facili- tate both web cache resource planning and cache hierarchy design
    Proceedings - IEEE INFOCOM 10/1999; 1.
Show more