• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.464-472
• /
• 2009

In this paper, we propose a packet scheduling algorithm for cellular relay networks by considering relay selection, variation of channel quality, and packet delay. In the networks, mobile users are equipped with not only cellular but also user relaying radio interfaces, where base station exploits adaptive high speed downlink channel. Our proposed algorithm selects a user with good cellular channel condition as a relay station for other users with bad cellular channel condition but can get access to relay link with good quality. This can achieve flexible packet scheduling by adjusting transmission rates of cellular link. Packets are scheduled for transmission depending on scheduling indexes which are calculated based on user's achieved transmission rate, packet utility, and proportional fairness of their throughput. The performance results obtained by using computer simulation show that the proposed scheduling algorithm is able to achieve high network capacity, low packet loss, and good fairness in terms of received throughput of mobile users.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.391-396
• /
• 2004

In this paper, we propose a packet scheduling discipline called packet loss fair scheduling, in which the packet loss of each user from different real-time traffic is fairly distributed according to the quality of service requirements. We consider an orthogonal frequency division multiple access (OFDMA) system. The basic frame structure of the system is for the downlink in a cellular packet network, where the time axis is divided into a finite number of slots within a frame, and the frequency axis is segmented into subchannels that consist of multiple subcarriers. In addition, to compensate for fast and slow channel variation, we employ a link adaptation technique such as adaptive modulation and coding. From the simulation results, our proposed packet scheduling scheme can support QoS differentiations while guaranteeing short-term fairness as well as long-term fairness for various real-time traffic.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.39-41
• /
• 2004

In this paper, I propose a thread scheduling policy for faster packet processing on the network processors with multithreaded multiprocessor architecture. To implement the proposed policy, I derived several basic parameters related to the thread scheduling and included a new parameter representing the packet contents and the features of the multithreaded architecture. Through the empirical study using a network processor, I proved the proposed scheduling ploicy provides better throughput and load balancing compared to the generally used thread scheduling policy.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.1
• /
• pp.59-65
• /
• 2007

HPI (High-speed Portable Internet) system which provides high speed internet services is going to be commercialized soon. Since HPI provides simultaneously four different service types such as UGS (Unsolicited Grant Service), rtPS (real time Polling Service), nrtPS(non-real time Polling Service), and BE (Best Effort) under different QoS (Quality of Service) requirements and limited wireless channel resources, efficient packet scheduling mechanisms are necessary to increase the utilization of channels as well as to satisfy the various QoS requirements. This study regards the traffic data to be served as time series and proposes a new packet scheduling algorithm based on the nonparametric statistical test. The performance of the newly proposed algorithm is evaluated through the simulation analysis using a simulator that can evaluate the performance of packet scheduling mechanisms under various values of system parameters and measures such as packet delay time, data transmission rate, number of loss packets, and channel utilization.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.777-787
• /
• 2005

In this paper, we propose an urgency- and efficiency-based wireless packet scheduling (UEPS) algorithm that is able to schedule real-time (RT) and non-real-time (NRT) traffics at the same time while supporting multiple users simultaneously at any given scheduling time instant. The UEPS algorithm is designed to support wireless downlink packet scheduling in an orthogonal frequency division multiple access (OFDMA) system, which is a strong candidate as a wireless access method for the next generation of wireless communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics while satisfying quality-of-service (QoS) requirements of RT traffics. The simulation study shows that the UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF), while satisfying the QoS requirements of RT traffics such as average delay and packet loss rate under various traffic loads.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3A
• /
• pp.244-257
• /
• 2009

We analysed the opportunistic scheduling method in MMR proposed by Samsung Electronic Cooperation and confirmed the efficiency by simulation. We also investigated the relationship between the throughput and fairness under the proposed method. The main objective of this study is to propose an opportunistic packet scheduling method in MMR, which considers the QoS requirement of user. Using the simulation the performance of the proposed method is compared with those of i) pure opportunistic packet scheduling method which doesn't consider QoS requirement and ii) packet scheduling method which only consider the QoS requirement, but does not utilize opportunistic packet scheduling.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1151-1168
• /
• 2009

Improving packet loss does not necessarily coincide with the improvement in user perceivable QoS because each frame carries different degree of importance. We propose Significance-aware packet scheduling (SAPS) to maximize user perceivable QoS. SAPS carries out two fundamental issues of packet scheduling: "What to transmit" and "When to transmit?" To adapt to the available bandwidth, it is necessarily to transmit the subset of the data packets if the entire set of packets can not be transmitted. "Packet Significance" quantifies the importance of the frame by elaborately incorporating frames' dependency. Greedy approach is used in selecting packets and transmission schedule is determined based on the Packet Significance. The proposed scheme is tested using publicly available MPEG-4 video clips. Decoding engine is embedded in the simulation software and user perceivable QoS is exposeed in termstermiSNR. Throughout the simulation based experiment, the performance of the proposed scheme is compared two other schemes: Size-based packet scheduling and Bit-rate based best effort packet scheduling. SAPS successfully incorporates the semantics of a packet and improves user perceivable QoS significantly. It successfully provides unequal protection to more important packets.

• Journal of Communications and Networks
• /
• v.8 no.3
• /
• pp.297-305
• /
• 2006

High-rate wireless personal area network (HR-WPAN) has been standardized by the IEEE 802.15.3 task group (TG). To support multimedia services, the IEEE 802.15.3 TG adopts a time-slotted medium access control (MAC) protocol controlled by a central device. In the time division multiple access (TDMA)-based wireless packet networks, the packet scheduling algorithm plays a key role in quality of service (QoS) provisioning for multimedia services. In this paper, we propose an adaptive cross-layer packet scheduling method for the TDMA-based HR-WPAN. Physical channel conditions, MAC protocol, link layer status, random traffic arrival, and QoS requirement are taken into consideration by the proposed packet scheduling method. Performance evaluations are carried out through extensive simulations and significant performance enhancements are observed. Furthermore, the performance of the proposed scheme remains stable regardless of the variable system parameters such as the number of devices (DEVs) and delay bound.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.11
• /
• pp.2124-2126
• /
• 2008

In the wireless communication systems, the demand of multimedia services is also increased. Unlike typical data packets, realtime service such as VoIP packets have delay bound and low loss rate requirement. In this paper we propose a new scheduling algorithm that be able to allocate resources to the different kinds of services such as VoIP and data packet. The proposed algorithm considers both time delay and channel condition toe determine the priority. Simulation results show that the proposed algorithm works more efficiently than the conventional algorithms.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1721-1723
• /
• 2002

In 3rd-generation mobile communication systems providing packet service, optimal scheduling algorithms we needed to increase service efficiency. In this paper, three scheduling algorithms (SP, EDF, and RPQ) which have been studied in the field of computer networks are applied with transmit power constraint to an interference-limited CDMA system, proving to be efficient.