• Journal of Information Technology Services
• /
• v.8 no.1
• /
• pp.179-192
• /
• 2009

In wireless environments, it is very effective to introduce a data broadcast system for providing a number of clients with mobile data services. In particular, an efficient broadcast scheduling and a caching strategy are very important for performance of data broadcast systems in wireless environments which have such inherent restrictions as low bandwidth, frequent disconnections, and short battery life. In this paper, we present a data broadcast scheduling strategy using bit vectors to cope with dynamic request patterns of clients. In addition, we also propose an efficient caching strategy, 2FWT, that takes characteristics of the broadcast scheduling strategy into account. Finally, we evaluate performance of the data broadcast system. According to the results, the proposed system generally shows better performance than others.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.17-27
• /
• 2012

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. This paper explores the issue of designing proper data allocation on multiple broadcast channels to reduce this wait time, and proposes a new data allocation scheme named near optimal data allocation(NODA). The proposed scheme first partitions all data items in K group based on the theoretical lower-bound of the average expected delay to determine data items which each broadcast channel has to broadcast. Then, NODA further partitions each group of data items in B groups using extended dynamic programming algorithm to broadcast data items allocated on the same broadcast channel in different frequencies. The proposed scheme is capable of minimizing the average expected delay time since it can broadcast data items allocated on the same channel reflecting their popularities.

• The Journal of Information Technology
• /
• v.7 no.1
• /
• pp.57-67
• /
• 2004

Data broadcast has attracted a lot of attention as an efficient way of disseminating data to very large client populations. The main motivation of data broadcast systems is that the number of clients that they serve can grow arbitrarily large without any effect on their performance. The performance of broadcast system depends mainly on client caching strategies and on data broadcast scheduling mechanisms. This paper addresses the latter issue and proposes a new broadcast scheduling scheme, named RxW$^{\alpha}$, that is suitable to data broadcast systems. This paper also evaluates the performance of RxW$^{\alpha}$ on the basis of a simulation model. The performance results indicate that RxW$^{\alpha}$ is capable of improving the performance in the variance of response time significantly, showing a reasonable performance in the response time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.131-140
• /
• 2018

A broadcast scheduling scheme is an essential technique to improve the performance of data broadcast systems. This paper explores the problem of data broadcast over multiple channels to reduce query response time, and proposes a new hybrid data broadcast scheduling scheme named HDAMA. The proposed scheme employs the strategy that combines the advantages of push-based broadcast and pull-based broadcast. HDAMA could enhance the performance of query response time since it is capable of controlling the influence of access probability properly reflecting the characteristics of multi-data queries and broadcasting pull data items relatively on time. Simulation is performed to evaluate the performance of the proposed scheme. The simulation results show that the performance of HDAMA is superior to other schemes in terms of the average response time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.63-72
• /
• 2011

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. With the objective of minimizing this wait time, this paper explores the problem of data broadcast over multiple channels. In traditional approaches, data items are partitioned based on their access probabilities and allocated on multiple channels, assuming flat data scheduling per channel. If the data items allocated on the same channel are broadcast in different frequencies based on their access probabilities, the performance will be enhanced further. In this respect, this paper proposes a new broadcast scheduling scheme named two level dynamic programming(TLDP) which can reflect a variation of access probabilities among data items allocated on the same channel.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.394-404
• /
• 2005

Battery capacity of mobile clients in wireless mobile computing environments is one of the important resources that determine the availability of mobile clients. So, data broadcast techniques in mobile computing environments need not only rapid delivery of requested data but also efficient data delivery mechanisms which can reduce battery consumption of mobile clients. This paper proposes organization of an index and broadcast data for on-demand data broadcast. It organizes an index containing broadcast time of each data using some of high-priority data in a broadcast server. By sending such index information prior to the corresponding data, the proposed approach reduces tuning time of mobile clients. It also includes when the next index information will be broadcasted in each data broadcast. This can reduce tuning time of mobile clients waiting for an index to be broadcasted. Experiments show that the proposed approach effectively reduces tuning time of mobile clients.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.61-69
• /
• 2021

On-demand broadcast is an effective data dissemination technique in mobile computing environments. This paper explores the issues for scheduling multi-data queries in on-demand broadcast environments, and proposes a new broadcast scheduling scheme named CASS. The proposed scheme prioritizes queries by reflecting the characteristics of multi-data queries, and selects the data that has not been broadcast in the query for the longest time as the broadcast data according to the query priority. Simulation is performed to evaluate the performance of CASS. The simulation results show that the proposed scheme outperforms other schemes in terms of the average response time since it can show highly desirable characteristics in the aspects of query data adjacency and data conflict rate.

• Broadcasting and Media Magazine
• /
• v.4 no.1
• /
• pp.43-53
• /
• 1999

Data Broadcast는 디지털TV에 PC가 가질 수 있는 멀티미디어 대화형 서비스 기술을 부여한 것으로 Interactive 디지털TV라고 할 수 있다. 대화형 서비스를 제공하기 위한 컨텐츠, 방송, 통신, 단말에 이르는 시스템에 대한 기술 규격을 정의하고 실제로 이를 구현하여 시험하는 것을 목적으로 하고 있다. 이 문서에서는 미국 규격을 중심으로 Data Broadcast Service관련 기술의 동향을 기술한다.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.37-52
• /
• 2004

Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile units over a single or multiple channels. Since the mobile units have limited battery power, the minimization of the access time for the broadcast data is an important problem. There have been many research efforts that focus on the improvement if the broadcast techniques by providing indexes on the broadcast data. In this paper, we studied an efficient index allocation method for the broadcast data over multiple physical channels, which cannot be coalesced into a single high bandwidth channel. Previously proposed index allocation techniques either require the equal size of index and data or have a performance degradation problem when the number of given physical channels is not enough. These two problems will result in the increased average access time for the broadcast data. To cope with these problems, we propose an efficient tree- structured index allocation method for the broadcast data with different access frequencies over multiple physical channels. Our method minimizes the average access time for the broadcast data by broadcasting the hot data and their indexes more often than the less hot data and their indexes. We present an in-0e0th experimental and theoretical analysis of our method by comparing it with other similar techniques. Our performance analysis shows that it significantly decrease the average access time for the broadcast data over existing methods.

• International journal of advanced smart convergence
• /
• v.13 no.1
• /
• pp.12-22
• /
• 2024

Software applications have a huge and inseparable impact on our lives. The complexity of the applications increases rapidly to support high performance and multifunction. Accordingly, the cost model for applications is increasingly important. Line of Code (LOC) and Man-Month (M/M) as the cost model measure the quantitative sides of the applications. Unlike them, Function Point (FP) measures the functionalities of the application. FP is efficient for estimating qualitative characteristics, but it is restricted to measuring the cost of an application using the wireless data broadcast which can support any number of clients. In this paper, we propose, a Function Point model for Information services using wireles data Broadcast (FPIB) to measure the development cost of an application that serves using the wireless data broadcast environment. FPIB adopts critical parameters of the wireless broadcast environment and the complexity of them to measure effectively the cost developing the application. Through the evaluation comparing the proposed FPIB with FP, we reveal the effectiveness of the proposed FPIB.