• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1071-1090
• /
• 2016

Most of scheduling methods in the Grid only consider one special attribute of the resource or one aspect of QoS (Quality of Service) of the job. In this paper, we focus on the problem that how to consider two aspects simultaneously. Based on the requirements of the jobs and the attributes of the resources, jobs are categorized into three kinds: CPU-overload, memory-overload, and bandwidth-overload jobs. One job may belong to different kinds according to different attributes. We schedule the jobs in different categories in different orders, and then propose a scheduling method-MTS (multiple attributes scheduling method) to schedule Grid resources. Based on the comparisons between our method, Min-min, ASJS (Adaptive Scoring Job Scheduling), and MRS (Multi-dimensional Scheduling) show: (1) MTS reduces the execution time more than 15% to other methods, (2) MTS improves the number of the finished jobs before the deadlines of the jobs, and (3) MTS enhances the file size of transmitted files (input files and output files) and improves the number of the instructions of the finished jobs.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.246-255
• /
• 2002

Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been recognized as one of the best algorithms for the CMST problem due to its excellent cost performance. This algorithm starts with a minimumdelay tree, and then iteratively uses a
-shortest-path (KSP) algorithm to search for a better path to replace a “superedge” in the existing tree, and consequently reduces the cost of the tree. The major drawback of BSMA is its high time complexity because of the use of the KSP algorithm. For this reason, we investigate in this paper the possibility of more efficient implementations of BSMA by using different methods to locate the target path for replacing a superedge. Our experimental results indicate that our methods can significantly reduce the time complexity of BSMA without deteriorating the cost performance.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.633-636
• /
• 1998

The next generation of wireless communication seems to be multimedia communications based on ATM and requires the efficient MAC(Medium Access Control) protocol to support multimedia traffic with the various characteristics of QoS(Quality of Service). A Proposed D-PRMA++ MAC protocol is operated dynamically by the retransmission probability and the number of reservation channel on the side of MS(Mobile Station) Also, On the side of BS(Base Station) it analyzes the parameters receive d from all MS and allocates the slots by priority in order to guarantee QoS.

• Journal of the Optical Society of Korea
• /
• v.19 no.4
• /
• pp.340-345
• /
• 2015

The Internet traffic is forecasted to grow at a compound annual rate of 21 % from 2013 to 2018, according to surveys carried out by Cisco [1]. Network resources are significantly over-provisioned in today's networks, and it is quite common to see link utilization in the 30-40% range [2]. Additionally, the multi-media services have widely divergent bandwidth and Quality of Experience (QoE) requirements. Unfortunately, the huge transmission capacity will increase the power consumption of network equipment [3]. Applications Coordinated with Transport, Internet Protocol and Optical Networks (ACTION) [4] has been proposed to realize a multi-QoE, application-centric, and highly energy-efficient network that leverages flexible elastic optical network technologies [5-7]. This paper provides key network technologies for realizing the ACTION, which are a virtual optical slice core network and a Time Division Multiplexing (TDM)-based deterministic active optical access network.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.553-556
• /
• 2000

This paper suggests the way to perform the handover by predicting the movement route of the mobile terminal by considering the movement pattern of the user. By considering the fact that the most users has the constant movement pattern, the channels needed fur the handover can be reserved, and the required quality of service (QoS) is maintained during handover. The suggested algorithm makes the channel allocation schemes more efficient.

• Annual Conference of KIPS
• /
• 2003.11a
• /
• pp.455-458
• /
• 2003

네트워크 사용자의 급속한 증가로 네트워크 내의 부하를 감당하기에는 많은 어려움을 가져왔다. 이와 같은 이유로 기존의 TCP/IP 에서 세션을 통하여 노드들 간의 통신을 연결하는 방식에서 현재는 하나의 채널을 통해 고속의 I/O 가 가능하도록 하는 기술의 많이 연구되고 있다. 그 대표적인 것으로 인피니밴드가 있다. 인피니밴드는 프로세싱 노드와 입출력 장치 사이의 통신, 프로세스간 통신에 대한 산업 표준이 되고 있고 프로세싱 노드와 입출력 장치를 연결하기 위해 스위치 기반의 상호 연결은 전통적인 버스 입출력을 대체하는 새로운 입출력 방식을 사용한다. 또한 인피니밴드는 서버 시스템에서 요구하는 여러 특징 중에서 어플리케이션에게 QoS (Quality of Service)을 보장할 수 있는 메커니즘을 포함하고 있다. 본 논문에서는 어플리케이션에서 요구하는 각 트레픽의 요구 대역폭 크기에 따라 구분하여 효율적인 중재 테이블의 구성을 통해 데이터 전송에 있어 QoS 에 합당하게 출력포트를 통해 나갈 수 있도록 중재 테이블을 관리하는 기법을 제안하고 이를 NS-2 (Network Simulator)을 이용하여 성능 평가를 했다. 특히 기존 인피니밴드에서의 중재 테이블을 이용한 패킷 처리량과 본 논문에서 제안한 중재 테이블 구성 방식을 이용한 패킷 처리량을 비교했으며 성능평가 결과는 기존의 인피니밴드에서의 패킷 처리량에 비해 약 19% 향상된 결과를 나타냈다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1876-1889
• /
• 2013

Packet-based mobile multimedia services for the Internet differ with respect to their resource requirements, performance objectives, and resource usage efficiencies. Nonetheless, each mobile terminal should support a variety of multimedia services, sometimes even simultaneously. This paper proposes a sub-channel allocation scheme based on multi-level priority for supporting mobile multimedia services in an Orthogonal Frequency Division Multiple Access (OFDMA) system. We attempt to optimize the system for satisfying the Quality of Service (QoS) requirements of users and maximize the capacity of the system at the same time. In order to achieve this goal, the proposed scheme considers the Signal-to-Interference-plus-Noise Ratio (SINR) of co-sub-channels in adjacent cells, the Signal-to-Noise Ratio (SNR) grade of each sub-channel in the local cell on a per-user basis, and the characteristics of the individual services before allocating sub-channels. We used a simulation to evaluate our scheme with the performance measure of the outage probabilities, delays, and throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.550-564
• /
• 2012

In this work we propose a new pricing scheme for the wireless Internet services over WiMAX system. First, let us review the characteristics of wireless network which is based on multi-hop relay WiMAX system. Next, we show why usage-based and QoS-aware pricing scheme is needed in the wireless Internet. After that, we propose a theoretical model for the price of multimedia services called a DAP (DiffServ-aware pricing) scheme for the WiMAX multimedia network which takes into account the consumed radio resource of WiMAX system as well as the supported QoS in the IP backbone network. Finally, we present explicit formulae for the packet price, price of consumed radio resource, and price of consumed bytes.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.10
• /
• pp.849-858
• /
• 2001

One of the important problems which should be solved in the telecontroller control is the time delay problem. In this paper, we propose a method of solving a random time delay problem using QoS(quality of service), and we show not only how to solve an unpredictable time delay problem but also how to compute a maximum time delay that could satisfy a basic assumption of many telecontroller methods. Using our proposed method, it is find that we can offer more stable time delay in telecontroller than using TCP and UDP.

• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.341-346
• /
• 2011

Wireless sensor networks (WSNs) are formed by a great quantity of sensor nodes, which are consisted of battery-powered and some tiny devices. In WSN, both efficient energy management and Quality of Service (QoS) are important issues for some applications. Real-time services are usually employed to satisfy QoS requirements in critical environment. This paper proposes a real-time MAC (Medium Access Control) protocol with extended backoff scheme for wireless sensor networks. The basic idea of the proposed protocol employs (m,k)-firm constraint scheduling which is to adjust the contention window (CW) around the optimal value for decreasing the dynamic failure and reducing collisions DBP (Distant Based Priority). In the proposed protocol, the scheduling algorithm dynamically assigns uniform transmitting opportunities to each node. Numerical results reveal the effect of the proposed backoff mechanism.