• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.293-298
• /
• 2010

The key of USN(Ubiquitous Sensor Network) technology is low power wireless communication technology and proper resource allocation technology for efficient routing. The distinguished resource allocation method is needed for efficient routing in sensor network. To solve this problems, we propose an algorithm that can be adopted in USN with making up for weak points of PQ and WRR in this paper. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class in sensor network. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.1-8
• /
• 2003

Scheduling technology is one of the most important elements required to support the Quality of service (QoS) in the Internet and a lot of scheduling algorithms have been developed. However, most of these algorithms ire not flexible to distribute the excess bandwidth. In order to provide flexibility for distributing the excess bandwidth, we proposed excess bandwidth fair queueing (EBFQ) algorithm with relatively low complexity. In this paper, we propose the new extension to this EBFQ algorithm for the hierarchical fair queueing system. This extension can be naturally applied to the existing hierarchical algorithm and simultaneously provide the same level of fairness. Through the simulation and analysis, we verify it.

• The Journal of the Korea Contents Association
• /
• v.2 no.4
• /
• pp.85-92
• /
• 2002

This paper proposes the cell scheduling algorithm proper to high-speed ATM switch. The proposed algorithm is the VRR(Variable weight Round Robin) combined the FRR to variant QLT. The FRR performs the cell service of the fixed weight by each buffer. So, FRR don't support the QoS of ATM service classes although it is easy to implement a high speed switch. VRR uses the method expaned to variable weight according to buffer state as well as schedules the cell according the Fixed weight based FRR. The simulation to evaluate the proposed algorithm was done by AweSim arid Visual C++. The result graphs show that the proposed algorithm is excellent, especially in the aspect of cell loss. This area is engaged by English Abstract.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.3
• /
• pp.105-112
• /
• 1997

The performance of a shared memory multiprocessor system is very sensitive to process scheduling. w can enhance the performance of a whole system as well as of an individual process by taking the multiprocessor characteristics into account in the design of the process scheduler. In this paper, we proposed a general purpose scheduler for a shared memory multiprocessor, called the Two-Level Multi-Scan (TLMS) process scheduler, that considers the processor affinity loosely and decreases the interference among multiple processors greatly. The TLMS scheduler is composed of a local scheduler at each processor and a semi-global scheduler that balances the load among processors. In particular, the semi-global scheduler tries to minimize priority inversion, which is an important factor of the system performance. The TLMS scheduler also tries to reduce the number of resources to be shared and improves the processor utilization. to meet these requirements, th semi-global scheduler interacts with the operation of the local scheduler when a need arises, thus the name is loose processor-affinity. We also show that the proposed scheduling technique can be extended for other types of resources making it a general purpose resource management queue.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.07a
• /
• pp.45-46
• /
• 2018

본 논문에서는 시간에 엄격한(Time critical) 산업용 IoT(Industrial IoT) 환경의 무선 센서 네트워크 시스템 상의 효율적인 패킷 전달과 정확도(Accuracy) 향상을 위해 강화학습과 EDF 알고리즘을 혼합한 스케쥴링 기법을 제안한다. 이 방식은 다중 대기열(Multiple queue) 환경에서 각 대기열의 요구 정확도(Accuracy Requirement)를 기준으로 최대한 패킷 처리를 미룸으로써 효율적인 CPU자원 분배와 패킷 손실율(Packet Loss)을 조절한다. 제안하는 기법은 무선 센서 네트워크 상의 가변적이고 예측 불가능한 환경에 대한 사전지식이 없이도 요구하는 서비스의 질(Quality of service)를 만족할 수 있도록 한다. 또한 정확도를 요구조건으로 제시하여 마감시간이 중요시되는 작업에서도 효율을 최대화한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.418-425
• /
• 2002

Bluetooth is an emerging technology expected to provide users with short range, low cost, pico-cellular wireless connectivity. The access to the medium for Bluetooth is based on a Master driven Time Division Duplexing (TDD) scheme. A slave transmits packets in the reverse slot only after the master polls the slave (or transmits a packet to the slave) in a forward slot. The master transmits packets to a slave in even slots while the slave transmits packets to the master in an odd slot. The way in which the master schedules packets transmission to slaves or polls them determines system performance. In this paper. we propose a traffic adaptive MAC scheduling scheme for Bluetooth. The proposed scheme adopts the ISAR (Intelligent Segmentation and Reassembly) policy, which adjusts the packet size to the traffic patterns, to adapt the polling frequency to the traffic conditions. Also for achieving fairness among master-slave connections our scheme includes a priority policy assinging prioritised service tlimes to each connection. By considering a scenario where a Bluetooth master is used as wireless access point to the Internet, we show that our scheme improve the system throughput and average queue delay with regard to a naive Round Robin (RR) scheme.

• Journal of Korea Multimedia Society
• /
• v.24 no.1
• /
• pp.95-105
• /
• 2021

In the case of laptops and tablet PC's that replace desktop, it uses the Windows operating system to provide various functions depending on operating system dependency, the Windows operating system does not support real-time processing because it uses multi-level feedback queue scheduling that extends round-robin scheduling. Also, since the initial value of Local APIC Counter can not be obtained from the Windows 8, the real-time processing function provided through the existing RTiK does not work. In this paper, we calculate Local APIC Counter value by using MSR_FSB_FREQ register to support real-time processing function on tablet PC's. We designed and implemented RTiK+, which provides real-time processing function to guarantee the periodicity by calculating the operation time of accurate timer. In order to verify and evaluate the performance of the implemented the RTiK+, the period was measured by using the Read Time-Stamp Counter(RDTSC) instruction and it was confirmed that it operates normally at 1ms and 0.1ms period.

• 전자공학회논문지 IE
• /
• v.45 no.1
• /
• pp.50-57
• /
• 2008

It is applying the various teaming contents to improve learner's studying desire and effect in E-Learning system. In this learning contents, there are text animation, sound and picture etc. But, multimedia teaming contents which has big file size need much transmission service times. In this paper, I proposed a scheduling technique of LMS to be faster and service efficiently the multimedia learning contents which was managed and processed it in LMS. for this purpose, I used message and scheduler at LMS. While loaming was processed, it saved the result information of learning contents request to LMS. In this case, if the learner request loaming contents request, it could be possible to support the learning contents efficiently to use learning contents information in LMS without connecting to LCMS. As application result of this techniques, at the first learning course, existent techniques displayed faster learning contents service than proposal techniques. But the more learning process, proposal technique is faster service than existent.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.859-866
• /
• 2003

In this paper, we designed the bandwidth allocation scheme with priority consideration for upstream channel access of EthernetPON. The objective of our scheme is to control the multi services in more effective way according to their CoS(Class of Service) or QoS(Quality of Service). The designed scheme considers transmission priority in the both side of OLT and ONU. In the OLT's view, the Two-step scheduling algorithm is applied with which we can support multiple bandwidth allocation policies simultaneously, i.e. SBA for the time-sensitive, constant rate transmission services and DBA for the best-effort services. This Two-step scheduling algorithm reduces the scheduling complexity by separating the process of transmission start time decision from the process of grant generation. In the ONU's view, the proposed scheme controls 8 priority queues of the 802.1d recommended 8 service classes. Higher priority queue is serviced in prior during the allowed GATE time from OLT. The OPNET modeling and simulation result compares the performance of each bandwidth allocation policy with SBA or DBA only approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4754-4773
• /
• 2018

In sensor medium access control (SMAC) protocol, sensor nodes can only access the channel in the scheduling and listening period. However, this fixed working method may generate data latency and high conflict. To solve those problems, scheduling duty in the original SMAC protocol is divided into multiple small scheduling duties (micro duty MD). By applying different micro-dispersed contention channel, sensor nodes can reduce the collision probability of the data and thereby save energy. Based on the given micro-duty, this paper presents an adaptive duty cycle (DC) and back-off algorithm, aiming at detecting the fixed duty cycle in SMAC protocol. According to the given buffer queue length, sensor nodes dynamically change the duty cycle. In the context of low duty cycle and low flow, fair binary exponential back-off (F-BEB) algorithm is applied to reduce data latency. In the context of high duty cycle and high flow, capture avoidance binary exponential back-off (CA-BEB) algorithm is used to further reduce the conflict probability for saving energy consumption. Based on the above two contexts, we propose an improved SMAC protocol, micro duty adaptive SMAC protocol (MDA-SMAC). Comparing the performance between MDA-SMAC protocol and SMAC protocol on the NS-2 simulation platform, the results show that, MDA-SMAC protocol performs better in terms of energy consumption, latency and effective throughput than SMAC protocol, especially in the condition of more crowded network traffic and more sensor nodes.