• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.543-550
• /
• 2002

This paper proposes the dynamic slot allocation method for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed method is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed method guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2369-2373
• /
• 2001

Usually the static scheduling algorithms such as DMS (Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm haying a solution to the priority inversion. In the proposed algorithm, the available bandwidth of network media can be checked dynamically by all nodes. Through the algorithm, arbitration delay causing the miss of their deadline can be avoided in advance. Also non real-time messages can be processed with their bandwidth allocation. The proposed algorithm can achieve full network utilization and enhance aperiodic responsiveness, still guaranteeing the transmission of periodic messages.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2940-2947
• /
• 2000

In the wireless ATM networks, a Medium Access Control (MAC) protocol is required to support an integrated mix of multimedia traffic services. The MAC protocol should be designed in a way that the limited wireless bandwidth can be efficiently utilized maximizing the Quality of Service (QoS) guarantees for various traffic service classes. In this paper, a Dynamic Resource Allocation-based MAC protocol, which satisfies QoS of each traffic service class in the wireless ATM environment, is proposed. The proposed MAC protocol adopts the dynamic channel allocation schemes for a mix of different traffic service classes. The suggested MAC protocol is designed to provide the QoS guarantees for Constant Bit Rate (CBR) or real-time Variable Bit Rate (VBR) traffic through fixed or dynamic reservation. For Available Bit Rate (ABH) traffic, which has the lowest priority among the traffic classes, large improvement in delay by reserving the minimum bandwidth is shown. And for real-time VBR traffic, increase in throughput of transmission is demonstrated because of bandwidth, which is allocated through contention at the initial phase and without contention thereafter.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.226-228
• /
• 1998

PBMA_DP 프로토콜은 우선순위에 따른 수락 확률을 변화시켜준다. 수락 확률수치는 요구슬롯(R-slot)의 개수에 영향을 받는다. 따라서 부하가 많아지면 R-slot의 개수를 줄이고, 부하가 적어지면R-slot의 개수를 늘려 성능의 향상을 꾀할 수 있다. 따라서 본 논문에서는 동적으로 R-slot의 개수를 바꾸어주는 알고리즘 두 가지를 제안한다. R-slot위치는 고정시키고 개수만 변화시키는 방식과 R-slot 위치를 변화시키면서 개수도 변화시키는 방식이다. 또한 단말의 개수를 예측하는 방법에 대해 간단히 설명한다. 위의 두 방식에 대한 모의 실험을 시행하여 성능분석을 행한다.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.69-72
• /
• 2003

This paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network.

• Journal of information and communication convergence engineering
• /
• v.1 no.3
• /
• pp.109-114
• /
• 2003

There is an emergence of Internet applications that have real-time requirements. These applications require IP to support guaranteed capacity, higher priority and lower packet loss rate. To address this, the Internet Engineering Task Force (IETF) is developing a set of protocols and standards for Integrated Services on the Internet. Using RSVP and policies to manage the allocation of network resources in order to provide different levels of service is a topic of great interest to service providers. Currently, it is not possible to dynamically reallocate resources during an application's session. This paper discusses how policies in conjunction with new service class can provide a more enhanced network resource allocation by allowing for this dynamic reallocation.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.5
• /
• pp.283-289
• /
• 2003

This paper proposes an expert system which can determine automatically the shunting routes corresponding to the given shunting works by considering totally the train operating environments in the station. The expert system proposes the multiple shunting routes with priority of selection based on heuristic search strategy. Accordingly, system operator can select a shunting route with the safety and efficiency among the those shunting routes. The expert system consists of a main inference engine and a sub inference engine. The main inference engine determines the shunting routes with selection priority using the segment routes obtained from the sub inference engine. The heuristic rules are extracted from operating knowledges of the veteran route operator and station topology. It is implemented in C computer language for the purpose of the implementation of the inference engine using the dynamic memory allocation technique. And, the validity of the builted expert system is proved by a test case for the model station.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.11-17
• /
• 2003

In this paper, we presented the dynamic random access channel allocation method under the priority based scheduling policy in order to improve the system performance of HIPERLAN/2 standardized by ETSI According to the scheduling policy, AP scheduler primarily allocates the resource to the collision MT This scheduling policy bring about decreasing the transmission delay of collision MT Dynamic RCH(random access channel) allocation method decreases the collision probability by increasing the number of RCH slots in case of low traffic. While it increases the maximum throughput by increasing the number of the data transmission slots in case of high traffic Therefore dynamic allocation method of RCH slots decreases the scheduling delay and increases the throughput When we evaluate the performance of presented method based on standards, we saw that the presented method improve the performance of the MAC protocol in terms of throughput and transmission delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1210-1220
• /
• 2016

As modern warfare has changed into network centered, the ability to share situational awareness among allies become a core competency for performing operational missions. In an airborne environment, it uses a tactical data link such as Link-16 for shared situational awareness. There exist problems when it shares situational awareness over the existing data link that can not allocate slots dynamically or that can not change the number of a slot to be allocated. In addition, there was a problem that can not share this failure so that failed to improves situation awareness because of finite time slot resources. In this paper, we accommodate dynamic slot allocation and changes of slot allocation with mixed structure of TDMA (time division multiple access) and random access. We propose a technique that can be used when available slots are exhausted, and a load balancing method to prevent slot allocation delay when slot requesting or message sending is concentrated on a single subframe.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.1035-1046
• /
• 2005

This paper analyzes the channel assignment techniques and their performance in the On Board Processing (OBP) satellite communication system. It suggests the new Continuous Rate Assignment (CRA) and Dynamic Rare Assignment (DRA) for improving the efficiency of channel assignment at the OBP switch. Mathematical analysis and simulation are given to evaluate the system performance. Aggregate real-time and non-real-time services are considered as different classes. Higher priority is given to voice and video real-time services to avoid delay variation. Onboard scheduler uses CRA and DRA ways to arrange the capacity allocation dynamically. An improved algorithm is given to make the channel more efficient by doing some evaluation of the switching matrix.