• Journal of Korean Society of Transportation
• /
• v.27 no.1
• /
• pp.129-141
• /
• 2009

Intermodal freight transportation is defined as the movement of freight from origins to destinations by two or more transportation modes. When implemented in hub networks, it could enhance the efficiency of the networks because consolidated flows are transported by more suitable modes and technologies. In spite of this advantage, the intermodal hub network design problem has received limited attention in the literature partly because of the complex nature of the problem. This paper aims to develop an optimization model for designing intermodal hub networks with sin91e allocation strategy. The model takes into account various cost components of intermodal hub networks including transportation, stationary inventory, and service delay costs. Moreover, using transport frequency variables, it is capable of endogenously determining the transportation economies of scale achieved by consolidation of flows. As such, the model is able to realistically represent the characteristics of intermodal hub networks in practice. Since the model Is a complicated nonlinear integer programming problem, we perform model simplification based on the analytical study of the model, which could facilitate the development of solution algorithms in the future. We expect that this study contributes to the design of intermodal hub networks as well as to the assessment of existing logistics systems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.3
• /
• pp.341-349
• /
• 1999

본 논문은 실시간 통신을 위한 이중 TDMA 구현 이더넷의 구조를 제시하고 이 네트워크 상에서의 대역폭 할당 기법을 제안 및 평가한다. 대역폭 할당 기법은 사전에 알려진 스트림 집합의 주가, 전송시간등의 실시간 트래픽 특성분석에 의해 프레임 시간의 범위, 사용율.종료시한.프로토콜 제약조건을 구하고 이를 만족시키는 프레임 시간과 슬롯시간을 결정한다. 이 기법은 단일 TDMA 구현 이더넷의 대역폭 할당에 따르는 낭비 시간 분석에 기반하고 있으며 이중화의 특성을 이용하여 낭비시간을 감소시킴으로써 단순히 대역폭이 두 배로 확장된 네트워크보다 높은 스케쥴 가능성을 보인다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.163-165
• /
• 2017

최근 단일 모바일 기기에서 처리하기 어려운 모바일 컴퓨팅을 처리하는 연구가 진행되고 있다. 모바일 기기로 구성된 모바일 클라우드내에서는 멀티미디어, 소셜미디어 등의 다양한 모바일 컴퓨팅이 발생하기 때문에[1], 고성능 컴퓨팅(HPC) 보다는 대규모 컴퓨팅(HTC)이 필요하다[2]. 또한 모바일 컴퓨팅 작업이 모바일 기기의 컴퓨팅 리소스에 어떻게 할당하는지에 대한 상태 파악이 중요하다. 따라서 본 논문에서는 모바일 기기를 통합한 모바일 클라우드내 대규모 컴퓨팅을 위한 모바일 작업 할당 시뮬레이터(JAS-HTC)를 제안한다. JAS-HTC는 모바일 컴퓨팅의 작업 할당을 시각적으로 표현하여, 대규모 컴퓨팅 작업 처리의 상태를 파악할 수 있도록 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1441-1444
• /
• 2004

MPEG 비디오 스트림은 소요 대역폭의 변화가 심한 군집성(bursty) 트래픽으로 망의 고정된 대역폭을 효율적으로 사용하는 전송방식을 구현하기가 매우 어렵다. 최근 ATM 망과 같이 가변으로 대역할당이 가능한 전송기술이 등장함에 따라 가변대역의 MPEG 비디오를 효율적으로 전송할 수 있게 되었다. 본 연구에서는 사용자에게 최소한의 품질을 보장하면서도 망 자원의 효율적 이용을 위하여 2 계층 구조의 새로운 대역폭 할당 기법을 제안하였다. 사용자에게 최소한의 품질을 보장하면서 망에 대역폭의 여유가 있는 경우 보다 고품질의 서비스가 가능토록 하기 위하여 ATM 망의 CBR 서비스와 VBR 서비스를 복합적으로 사용하는 방법을 제안하였다. 이의 구현을 위하여 2 계층 구조의 MPEG 부호화기를 설계하였고 모의실험으로 기존의 CBR 만을 사용하는 단일계층 방식과 비교 평가하였다.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.4
• /
• pp.395-402
• /
• 2002

In the conventional public switched telephone network(PSTN), there are various types of modulation that can be used in ADSL to offer fast data communication, two of which are CAP(Carrierless Amplitude Phase) and DMT(Discrete MultiTone). As we consider the current situation, DMT is getting more predominant in the market than CAP. One of the reasons is that it gives high performance in spite of its high complexity Since DMT divides the full range of bandwidth into 256 sub-channels, it can be highly adaptive in the circumstances, where the problems of attenuation and noise caused by the propagation distance are very crucial. In this paper, a new bit loading algorithm for DMT modulation is proposed. The proposed algorithm can be efficiently implemented in a way that it requires less computation than the conventional modulation techniques. In contrast to the conventional algorithms which perform sorting processing, the proposed algorithm uses look-up tables to reduce the repetition of calculation. Consequently, it is shown that less processing time and lower complexity can be achieved.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.2
• /
• pp.7-18
• /
• 1998

In this paper, we develop three context-dependent resource allocation models to maximize user satisfaction in terms of software quality. Those models are formulated on the grounds that human resources are dominant In a software development project while taking into account managerial quality constraints of the system. The satisfaction function on exerted resources plays a key linking pin between the two sides, and its functioning forms bring about different solution methods. In addition to a basic linear model, an extension model is formulated so that it may be applicable to the situation of multiple-goal settings. Finally, non-linear model is given the solving optimization algorithm developed and proved in this paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2275-2282
• /
• 1999

In ATM networks, bandwidth allocation using available bandwidth is important to control ABR traffic efficiently. However, it is difficult to dynamically assign bandwidth on bursty traffic, because the tracking of the existing available bandwidth information uses statistical value. In this paper, we propose a output-bufferd ATM switch using Per-VC queueing scheme with timer and Controller. The controller determines whether each VC is in congestion state or not, and the timer can assign dynamically as determining the available bandwidth for the Present period by Backlogged time and total link capacity, and then transmitting the determined bandwidth to source. Instead of using statistical parameters, the proposed scheme can improve link efficiency as allocating the bandwidth of the next period, by use of measured bandwidth during the current period.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.57-60
• /
• 2001

In this paper, I will describe the trends of multicast address allocation mechanism. IP Multicast efficiently supports this type of transmission by enabling sources to send a single copy of a message to multiple recipients who explicitly want to receive the information. Generally, MAAs server or MADCAP servers are used to allocate multicast addresses. As the need of home networking and autoconfiguring network mechanism has been increased, not only automatic host IP configuration but also automatic multicast address generation mechanism was demanded. in this paper, I will explain the automatic multicast address mechanism in a host. management techniques and the trends of multicast address generation and allocation mechanism that is bong now discussed In IETF.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.9
• /
• pp.753-761
• /
• 2012

In this paper, we study a power allocation technique for Tomlinson-Harashima precoding (THP) in multi-user multiple input single output (MISO) downlink systems. In contrast to previous approaches, a mutual information based method is exploited for maximizing the sum rate of zero-forcing THP systems. Then, we propose a simple power allocation algorithm which assigns proper power level for modulo operated users. Simulation results show that the proposed scheme outperforms a conventional water-filling method, and it provides similar performance with near optimal method with much reduced complexity.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.189-200
• /
• 2001

This paper proposes a memory allocation model for Real-Time Linux. The proposed model allows users to create several continuous memory regions in an application, to specify an appropriate region allocation policy for each memory region, and to request memory blocks from a necessary memory region. Instead of using single memory management module in order to support the proposed model, we adopt two-layered structure that is consisted of region allocators implementing allocation policies and a region manager controlling regions and region allocator modules. This structure separates allocation policy from allocation mechanism, thus allows system developers to implement same allocation policy using different algorithms in case of need. IN addition, it enables them to implement new allocation policy using different algorithms in case of need. In addition, it enables them to implement new allocation policy easily as long as they preserver predefined internal interfaces, to add the implemented policy into the system, and to remove unnecessary allocation policies from the system, Because the proposed model provides various allocation policies implemented previously, system builders can also reconfigure the system by just selecting most appropriate policies for a specific application without implementing these policies from scratch.