• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.2
• /
• pp.103-112
• /
• 2016

As supply chains are globalized, multinational companies are trying to optimize distribution networks using a hub and spoke structure. In this hub and spoke network structure, multinational companies locate regional distribution centers at hub airports, which serve demands in their corresponding regions. Especially when customers put higher priority on the service lead-time, hinterlands of international hub airports become ideal candidate locations for the regional hub distribution centers. By utilizing excellent airport and logistics services from hub airports, regional distribution centers in the hub airports can match supply with demand efficiently. In addition, regional hub distribution centers may increase air cargo volume of each airport, which is helpful in the current extremely competitive airport industry. In this paper, we classified locational preferences into three primary categories including demand, service and risk and applied the analytic hierarchy process methodology to prioritize factors of locational preferences. Primary preference factors include secondary factors. Demand factor contains access to current and prospect markets. Service factor comprises airport and logistics perspectives. Service factor in terms of airport operations includes secondary factors such as airport service and connectivity. Service factor in terms of logistics operations contains infrastructure and logistics operations efficiency. Risk factor consists of country and business risks. We also evaluated competitiveness of Asian hub airports in terms of candidate location for regional hub distribution centers. The candidate hub airports include Singapore, Hong Kong, Shanghai, Narita and Incheon. Based on the analytic hierarchy process analysis, we derived strategic implications for hub airports to attract multinational companies' regional hub distribution centers.

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.73-81
• /
• 2003

The controlled load service defined within the IETF's Integrated Services architecture for quality-of-service (QoS) in the Internet requires source nodes to regulate their traffic while the network, in combination with an admission control strategy, provides a guarantee of performance equivalent to that achieved in a lightly loaded network. Packets sent in violation of the traffic contract are marked so that the network may assign them a lower priority in the use of bandwidth and buffer resources. In this paper, we define the requirements of a scheduler serving packets belonging to the controlled load service and present a novel scheduler that exactly achieves these requirements. In this set of requirements, besides efficiency and throughput, we include an additional important requirement to bound the additional delay of unmarked packets caused due to the transmission of marked packets while dropping as few marked packets as possible. Without such a bound, unmarked packets that are in compliance with the traffic contract are not likely to experience delays consistent with that in al lightly loaded network. For any given desired bound ${\alpha}$ on this additional delay, we present the CL(${\alpha}$) scheduler which achieves the bound while also achieving a per-packet work complexity of O(1) with respect to the number of flows. We provide an analytical proof of these properties of the CL(${\alpha}$) scheduler, and we also verify this with simulation using real traces of video traffic. The scheduler presented here may be readily adapted for use in scheduling flows with multi-level priorities such as in some real-time video streams, as well as in other emerging service models of the Internet that mark packets to identify drop precedences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1104-1110
• /
• 2009

3D A/V services are expected to be a representative service of next generation because it can give more realistic feeling by providing dimensions to the 2D images. In terms of transmission part of 3D A/V systems, however, it is difficult to provide these services on real-time in the wireless OFDMA networks because it has to send large amount of traffic. To address this, we proposed a novel scheduling algorithm which separates a 3D traffic into base layer and enhancement layer, and provides different priority to them. From simulation results, we can show that the proposed algorithm can improve QoS.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.162-162
• /
• 2019

Water Distribution Network (WDN) is a critical infrastructure to be maintained ensuring proper water supply to wide-spread consumers. The WDN consists of pipes, valves, pumps and tanks, and these elements interact each other to provide adequate system performance. If elements fail by internal or external interruptions, it may result in adverse impact to water service with different degree depending on the failed element. To determine an appropriate maintenance priority, the critical elements need to be identified and mapped in the network. In order to identify and prioritize the critical elements in WDN, an element-based simulation approach is proposed, in which all the elements composing the WDN are reviewed one at a time. The element-based criticality is measured using several resilience indexes that are newly developed in this study. The proposed resilience indexes are used to quantify the impacts of element failure to water service degradation. Here, three resilience indexes are developed, such as User Demand Severity, Economic Value Loss and Water Age Degradation, each of which intends to measure different aspects of consequences, such as social, economic, and water quality, respectively. For demonstration, the proposed approach is applied to a benchmark water network to identify and prioritize the critical elements.

• Journal of KIISE:Information Networking
• /
• v.31 no.4
• /
• pp.414-428
• /
• 2004

Many portable devices are coming to be commercially successful and provide useful services to mobile users. Mobile devices may request a variety of data types, including text and multimedia data, thanks to the rich content of the Internet. Different types of data and/or different classes of users may need to be treated with different qualities of service. The implementation of service differentiation in wireless networks is very difficult because of device mobility and wireless channel contention when the backoff algorithm is used to resolve contention. Modification of the t)mary exponential backoff algorithm is one possibility to allow the design of several classes of data traffic flows. We present a study of modifications to the backoff algorithm to support three classes of flows: sold, silver, and bronze. For example, the gold c]ass flows are the highest priority and should satisfy their required target bandwidth, whereas the silver class flows should receive reasonably high bandwidth compared to the bronze class flows. The mixture of the two different transport protocols, UDP and TCP, in ad hoc networks raises significant challenges when defining backoff algorithm modifications. Due to the different characteristics of UDP and TCP, different backoff algorithm modifications are applied to each class of packets from the two transport protocols. Nevertheless, we show by means of simulation that our approach of backoff algorithm modification clearly differentiates service between different flows of classes regardless of the type of transport protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.72-84
• /
• 2005

Optical burst switching networks usually employ one-way reservation by sending a burst control packet with a specific offset time, before transmitting each data burst Same. Due to such a Property, burst-contentions occur when multiple bursts contend for the same wavelength in the same output link simultaneously in a node, leading to burst losses, eventually degrading the quality of service. Therefore, in this paper, we propose a dynamic routing algorithm using minimum local state information in order to decrease burst-contentions. In this proposed scheme, if burst loss rate exceeds a threshold value at a certain node, a new alternative routing path is chosen according to burst priority and location of burst generation, which enables the contending bursts to detour around the congested link. Moreover, for reducing the effect of sending bursts on the primary path due to the alternative path, we also apply a minimum path-cost based routing on link-cost concept. Our simulation results show that proposed scheme improves the network performance in terms of burst loss probability and throughput by comparing with conventional one.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.325-328
• /
• 2013

Recently, the national carrier of the next-generation growth engine of M2M (machine to Machine) is attracting attention. Therefore, its uses and utilization of the various disciplines is getting wider, and the increasing number of terminals to be used compared to the existing communication of the information that is sent in every object may have increased. Each data transfer from the bulk terminal to a mobile network, if the traffic situation reaches this limit does not facilitate the processing of M2M communication services, this situation can occur. This study measures the mobile networks will be used in M2M communications when it reaches the breaking point for the smooth processing of M2M services are presented. Things grows increasingly smaller the further development of M2M technology, the explosion in mobile communication network, the data traffic will reach the limitations of these methods will be used in determining the ranking of the M2M communication services should be treated as a priority, to beM2M services to mobile networks will help to facilitate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9B
• /
• pp.838-847
• /
• 2006

In order to support multiple multimedia streaming services in home networks, many critical issues must be considered. In addition, handling the shortage of network bandwidth is one of the most significant and complicated issues. In this paper, real-time bandwidth management service is suggested as a solution to the problem regarding the IEEE1394-based home network. In order to handle the shortage of network bandwidth and to enhance the bus utilization rate, the proposed service combines two methods. First, the bus bandwidth management function determines the state of the network bandwidth and restores the residual bandwidth, which is excessively occupied by a streaming service, to the available free bandwidth. Second, the Isochronous Streaming (IS) Scheduler manages all streaming services according to priority. In order to test the proposed service, we implemented a prototype steaming management middleware and evaluated it by using the IEEE1394 network test-bed.

• Journal of Advanced Navigation Technology
• /
• v.19 no.4
• /
• pp.318-322
• /
• 2015

In wireless communication networks, most of the prediction techniques are used for predicting the amount of resource required by user's calls for improving their demanding quality of service. However, we propose a channel allocation scheme based on predicting the resources of white spectrum holes for improving the QoS of rental user's spectrum handoff calls for cognitive radio networks in this paper. This method is supported by Wiener predictor to predict the amount of white spectrum holes of license user's free spectrum resources. We classify rental user's calls into initial calls and spectrum handoff calls, and some portion of predicted spectrum-hole resources is reserved for spectrum handoff calls' priority allocation. Simulations show that the performance of the proposed scheme outperforms in spectrum handoff call's dropping rate than an existing method without spectrum hole prediction(11% average improvement in 50% reservation).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1A
• /
• pp.44-53
• /
• 2010

This paper proposes a traffic management policy for delay control in the wireless networks. The so-called EDD(Earliest Due Date) scheme is adopted as the packet scheduling policy, so that the service provision is performed in the order of the transmission urgency of the backlogged packets. In addition, we derive a formula to determine the contention window, one of the MAC parameters, with the goal of minimizing the non-work conserving characteristics of the traditional MAC scheme. This method eliminates the burden of the class-wise parameter settings which is typically required for the priority control. Simulations are performed to show the validity of the proposed scheme in comparison with the policy that adopts the class-level queue management such as the IEEE 802.11e standard. Smaller delays and higher rates of delay guarantees are observed throughout the experiments.