• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.613-619
• /
• 2003

Bluetooth is a communication technology enabling short-range devices to be wirelessly connected. A master and one or more slave devices are connected to form a piconet, and piconets are joined to form a scatternet. The units participating in two or more piconets in a scatternet, is called bridge or gateway nodes. In order to operate the scatternet efficiently, both piconet scheduling for the master and slaves of a piconet, and scatternet scheduling for the bridge nodes are playing important roles. In this paper, we propose a traffic-adaptive dynamic scatternet scheduling algorithm based on rendezvous points and rendezvous windows. The performance of the proposed algorithm is compared and analyzed with that of a static scheduling algorithm via simulations. Simulation results show that our algorithm can distribute wireless resources efficiently to bridge nodes depending on the traffic characteristics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.7
• /
• pp.980-988
• /
• 1993

In this paper, performance of 8-ISDN traffic for the buffer size which is requested of important parameters in switch/multiplexer of B-ISDN with multimedia traffic is analyzed. Multimedia traffic is modeled as a traffic, which is composed of poisson distribution traffic and burst traffic with exponential/geometric ON time duration(Burst duration) Performance of traffic which is modeled as a multimedia traffic is analysed and buffer size, can provide the high quality service, is presented for the cell loss probability. It is simulated using event scheduling approach method which is provided by simulation package, PC SIMSCRIPT II.5. Simulation program is composed of PREAMBLE, MAIN, INITIAL, ARRIVAL, DEPARTURE and STOP·SIM modules. Specially, in case of mixed traffic simulation, ARRIVAL module is composed of ARRIVAL I and ARRIVAL II, and cells are generated independently by each module.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.1
• /
• pp.22-32
• /
• 2003

Many of multimedia applications in distributed environments generate the packets which have the real-time characteristics for continuous audio/video data and transmit them according to the teal-time task scheduling theories. In this paper, we model the traffic for continuous media in the distributed multimedia applications based on the high-bandwidth networks and introduce the PDMA algorithm which is the hard real-time task scheduling theory for guaranteeing QoS requested by the clients. Furthermore, we propose the admission control to control the new request not to interfere the current services for maintaining the high quality of services of the applications. Since the proposed admission control is sufficient for the PDMA algorithm, the PDMA algorithm is always able to find the feasible schedule for the set of messages which satisfies it. Therefore, if the set of messages including the new request to generate the new traffic. Otherwise, it rejects the new request. In final, we present the simulation results for showing that the scheduling with the proposed admission control is of practical use.

• The KIPS Transactions:PartC
• /
• v.18C no.6
• /
• pp.433-440
• /
• 2011

In this paper, we propose a new scheduling method that can guarantee reliable jitter by minimizing the queue length variation in the streaming service provisioning such as IPTV and VoD. The amount of traffic to be delivered within a certain time is very fluid because MPEG-4 and H.264 encoders use VBR(Variable Bit Rate) for delivering video streaming traffic. This VBR characteristic increases the end-to-end propagation delay variation when existing scheduling methods are used for delivering video frames. Therefore, we propose the new scheduling method that can minimize change rate of queue length by adaptively controling service rate taking into account the size of bulk incoming packets and arrival rate for bulk streaming traffic. Video frames can be more reliably transmitted through the minimization of the queue length variation using the proposed method. We use the queueing model and also carry out OPNET simulation to validate the proposed method.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.3
• /
• pp.54-64
• /
• 1998

In this paper, a cell scheduling algorithm is proposed to satisfy the service requirements of CBR, VBR traffics. Particularly, inthe proposed algorithm an ABR traffic which is not included in the conventional cell schedulaing algorithm is treated as one kind of traffic types. The algorithm of RT-VBR and NRT-VBR traffic such that the service requrements of RT-VBR and NRT-VBR traffic are satisfied. The proposed algorithm dynamically schedules cells in a real time by considerin the current traffic conditions. The simulation of the proposed algorithms such as WRR or DWRR in terms of the mean delay time and the maximum queue length.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3594-3610
• /
• 2015

Recent advancements in broadband wireless communication technologies enable mobile users to receive video streaming services with various smart devices. The long term evolution (LTE) network provides high bandwidth and low latency for several emerging mobile applications. This paper proposes the buffer aware scheduling (BAS) approach to schedule the downlink video traffic in LTE network. The proposed BAS scheme applies the weighting function to heuristically adjust the scheduling priority by considering the buffer status and channel condition of UE so as to reduce the time that UE stays in the connected state without receiving data. Both of 1080P and 2160P resolution video streaming sources were applied for exhaustive simulations to examine the performance of the proposed scheme by comparing to that of the fair bandwidth (FB) and the best channel quality indicator (CQI) schemes. The simulation results indicate that the proposed BAS scheme not only achieves better performance in power saving, streaming delivery time, and throughput than the FB scheme while maintaining the similar performance as the best CQI scheme in light traffic load. Specifically, the proposed scheme reduces streaming delivery time and generates less signaling overhead than the best CQI scheme when the traffic load is heavy.

• Convergence Security Journal
• /
• v.7 no.2
• /
• pp.39-47
• /
• 2007

The scheduling algorithms to provide quality of service (QoS) in broadband convergence network (BcN) are compared and analysed. The main QoS management methods such as traffic classification, traffic processing in the input queue and weighted queueing are first analysed, and then the major scheduling algorithms of round robin, priority and weighted round robin under recently considering for BcN to supply real time multimedia communications are analysed. The simulation results by NS-2 show that the scheduling algorithm with proper weights for each traffic class outperforms the priority algorithm.

• 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 Korean Society for Aviation and Aeronautics
• /
• v.25 no.3
• /
• pp.44-50
• /
• 2017

This paper proposes arrival scheduling and advisory generation algorithms which can be used in the terminal airspace with Point-Merge procedures. The proposed scheduling algorithm consists of two steps. In the first step, the algorithm computes aircraft schedules at the entrance of the Point-Merge sequencing legs based on First-Come First-Served(FCFS) strategy. Then, in the second step, optimal sequence and schedules of all aircraft at the runway are computed using Multi-Objective Dynamic Programming(MODP) method. Finally, the advisories that have to be provided to the air traffic controllers are generated. To demonstrate the proposed algorithms, the simulation was conducted based on Jeju International Airport environments.

• ETRI Journal
• /
• v.26 no.1
• /
• pp.48-52
• /
• 2004

In this letter, we consider a new packet scheduling algorithm for an orthogonal frequency division multiplexing access/frequency division duplex (OFDMA/FDD)-based system, e.g., mobile broadband wireless access or high-speed portable internet systems, in which the radio resources of both time and frequency slots are dynamically shared by all users under a proper scheduling policy. Our design objective is to increase the number of non-realtime service (e.g., WWW) users that can be supported in the system, especially when the minimum bit rate requirement is imposed on them. The simulation results show that our proposed algorithm can provide a significant improvement in the average outage probability performance for the NRT service, i.e., significantly increasing the number of NRT users without much compromising of the cell throughput.