• The KIPS Transactions:PartB
• /
• v.15B no.5
• /
• pp.413-420
• /
• 2008

Network bandwidth is one of the major factors that impact the cost of a video service. In this paper we propose approaches to reducing the bandwidth requirement for transporting MPEG-4 video traffic over wireless LANs while guaranteeing a required level of quality of service(QoS). To support high quality video playbacks, video frames must be transported to the client prior to their playback times. A real-time transmission scheduling is used for this purpose, which transmits each frame assigned with a priority according to its importance. It addresses the challenge for a scheduling algorithm that efficiently handles the changing workloads of MPEG-4 video traffic. The goal of our research is to maximize the number of frames that are transported within their deadlines while minimizing the tardiness of frames that missed their deadlines. The performance of the proposed method is compared with that of similar service mechanisms through extensive simulation experiments.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.7
• /
• pp.304-318
• /
• 2007

Grid computing is a service that share geographically distributed computing resources through high speed network. In this paper, we propose hybrid scheduling scheme which considers not only meta-scheduling scheme to distribute the job between the nodes of grid computing system but also the job scheduling to distribute the job within the local nodes. According to the number of processors needed and expected execution time, the job with high priority is allocated to job queue while the one with low priority and remote job are allocated to backfill queue. We evaluate the proposing scheme through the various experiments and the results show that the utilization of grid computing system increases and the job slowdown decreases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10B
• /
• pp.1665-1674
• /
• 2000

This paper treats the interworking of LAN-based networks like TCP over the ATM protocol stack in an ATM multicast session. Multicast connection will cause CIP since multicast group members form a connection tree by some tree methods and share the connected tree. The paper solve the CIP problem through a block-by-block transmission using ABT/IT method. ABT/IT RM cell is modified and block scheduling algorithm considering the traffic types is applied to each ATM switch using the enhanced RM cell. Block scheduling algorithm will avoid the indiscriminate discard of UBR traffic when congestion occurs and it can provide an efficient and fair service. The paper builds a block scheduler system and suggests the block scheduling algorithm for a multicast session in an ATM switch. UBR traffics arriving at the switch trough each VC is classified by the traffic type and stored at class buffer and thereafter indisciminately transmitted. When block scheduling algorithm is applied it will improve the UBR traffic performance such as end-to-end delay cell block loss ration etc. This paper evaluated the performance of block scheduling algorithm through the simulation using the C language and data structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.261-270
• /
• 2007

The Delay Threshold-based Priority Queueing (DTPQ) scheme has been shown useful for scheduling both real-time (RT) and non-real-time (NRT) service traffic in mobile broadband wireless access (MBWA) systems. The overall system capacity can be maximized subject to their QoS requirement by the DTPQ scheme, which takes the urgency of the RT service into account only when their head-of-line (HOL) packet delays exceed a given delay threshold. In practice, the optimum delay threshold must be configured under the varying service scenarios and a corresponding traffic load, e.g., the number of RT and NRTusers in the system. In this paper, we propose an adaptive version of DTPQ scheme, which updates the delay threshold by taking the urgency and channel conditions of RT service users into account. By evaluating the proposed approach in an orthogonal frequency division multiple access/time division duplex (OFDM/TDD)-based broadband mobile access system, it has been found that our adaptive scheme significantly improves the system capacity as compared to the existing DTPQ scheme with a fixed delay threshold.

• Journal of Digital Contents Society
• /
• v.3 no.1
• /
• pp.47-57
• /
• 2002

Recently, wireless networks have been pursuing multimedia data service as voice, data, image, video and various form of data according to development of information communication technology. It guarantees cell delivery delay of real time data in efficient real time multimedia data transfer. Also, it minimizes cell loss rate of non-real time multimedia data. In the wireless ATM, there are based on Asynchronous Transfer Mode(ATM). It implies that there are various service with difficult transmission rates and qualities in the wireless communication network. As a result, it is important to find out the ways to guarantee the Quality of Service(QoS) for each kind of traffic in wireless network. In this thesis, we propose an improved TCRM scheduling algorithms for transmission real-time multimedia data service in wireless ATM Networks. We appear real time multimedia scheduling policy that apply each different method to uplink and downlik to wireless ATM network. It can guarantee QoS requirements for each real time data and non-real time data. It also deals the fairness problem for sharing the scarce wireless resources. We solve fault of TCRM as inefficient problem of non-real data by using arbitrary transmission speed and RB(Reservation Buffer) through VC(Virtual Control) and BS(Base Station).

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.57-60
• /
• 2003

IEEE 802.16 Wireless MAN standard specifies the air interface of fixed point-to-multipoint broadband wireless access systems providing multiple service. Among the service classes supported by the wireless MAN, the BE class is ranked on the lowest position in priority and is usually deployed by multicast and broadcast polling MAC scheme. In provisioning such BE service, the delay performance is influenced by a number of components including restrictions on resource request per SS, the number of request opportunities in upward frame, scheduling requests at BS, and contention resolution method. As candidate components of MAC function for BE service, we propose single and multiple request schemes (for controling the number of requests per SS), exhaustive and limited request schemes (for regulating the amount of grant per request) and FCFS, H-SMF, pure SMF, SS-wise Round Robin, and pure Round Robin (for scheduling requests at BS). Then, we construct MAC schemes by combining the above components and evaluate the delay performance exhibited by each MAC scheme using a simulation method. From numerical results, we investigate the effect of MAC components on average delay and delay variation and observe the dissonance on collision reduction in a resource - limited environment.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.4
• /
• pp.238-247
• /
• 2018

This paper considers the problem of scheduling loading and unloading operations of a crane in a railway terminal motivated from rail-road container transshipment operations at Uiwang Inland Container Depot (ICD). Unlike previous studies only considering the total handling time of containers, this paper considers a bi-criteria objective of minimizing the weighted sum of the total handling time and tenant service time. The tenant service time is an important criterion in terms of terminal tenants who are private logistics companies in charge of moving containers from/to the terminal using their trucks. In the rail-road container shipment yard, the tenant service time of a tenant can be defined by a time difference between beginning and finishing loading and unloading operations of a crane. Thus, finding a set of sequences and time of the crane operations becomes a crucial decision issue in the problem. The problem is formulated as a nonlinear program which is improved by linearizing a nonlinear constraint in the model. This paper develops a genetic algorithm to solve the problem and performs a case study on the Uiwang ICD terminal. Computational experiment results show that the genetic algorithm shows better performance than commercial optimization solvers. Operational implications in terms of tenants are drawn through sensitivity analyses.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.6
• /
• pp.311-318
• /
• 2013

In this paper, we consider a new packet scheduling algorithm for real-time traffic in the HSDPA system that has been introduced for the WCDMA system, in order to provide high transmission rates. The objective of the design is to meet the maximum tolerable delay and consider channel assignment based on the received SIR for real-time traffic users. The proposed scheduling algorithm shows that the users are ranked by the ratios of the bits in the buffer to the residual time for transmission as priority order; then the ranked users are assigned certain number of channels based on the SIR value table. The simulation results show that the proposed algorithm can provide a lower packet drop rate, and satisfy real time quality of service (QoS) requirements.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.2
• /
• pp.233-240
• /
• 2005

The concept of ubiquitous computing has changed the way we look at computing. In the ubiquitous computing, the service depends on the contexts. The existing scheduling management systems require the contexts, but does not consider various contexts. In this paper, we design and implement new web-based scheduling management system adaptive to contexts. We implemented our system by using user, time, season, location. The results show that our system suggests a good scheduling.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.401-409
• /
• 2006

Orthogonal frequency division multiplexing (OFDM) and multiple input multiple output (MIMO) technologies provide additional dimensions of freedom with spectral and spatial resources for radio resource management. Multi-dimensional radio resource management has recently been identified to exploit the full dimensions of freedom for more flexible and efficient utilization of scarce radio spectrum while provide diverse quality of service (QoS) guarantees. In this work, a multi-dimensional radio resource scheduling scheme is proposed to achieve above goals in hybrid orthogonal frequency division multiple access (OFDMA) and space division multiple access (SDMA) systems. Cochannel interference (CCI) introduced by frequency reuse under SDMA is eliminated by frequency division and time division between highly interfered users. This scheme maximizes system throughput subjected to the minimum data rate guarantee. for heterogeneous users and transmit power constraint. By numerical examples, system throughput and fairness superiority of the our scheduling scheme are verified.