• Management Science and Financial Engineering
• /
• 제12권2호
• /
• pp.37-62
• /
• 2006

This paper considers the problem of designing logical tunnels in virtual private networks considering QoS guarantee which restricts the number of tunnel hops for each traffic routing. The previous researches focused on the design of logical tunnel itself and Steiner-tree based solution algorithms were proposed. However, we show that for some objective settings it is not sufficient and is necessary to consider both physical and logical connectivity at the same time. Thereupon, the concept of the layered network is applied to the logical tunnel design problem in virtual private networks. The layered network approach considers the design of logical tunnel as well as its physical routing and we propose a modified branch-and-price algorithm which is known to solve layered network design problems effectively. To show the performance of the proposed algorithm, computational experiments have been done and the results show that the proposed algorithm solves the given problem efficiently and effectively.

• 대한산업공학회지
• /
• 제37권4호
• /
• pp.279-288
• /
• 2011

The past researches focused on the supply chain network that consists of factories, distribution centers and retailers for single product type. This research is required because the factory for single product type is advanced to reconfigurable type in order to produce various products, according to customers' various purchase forms and time. This research is also required because in the past researches, the material flows from factories to distribution centers and from distribution centers to retailers, but recently, there are material flows between distribution centers. The supply chain network in this research consists of reconfigurable manufacturing system, multi-layered distribution centers, and retailers. A simulator is developed to analyze the material flow on the supply chain network. The developed simulator is web-based designed by using Java Server Page and MS-SQL, so as to maximize the convenience for users.

• 한국경영과학회지
• /
• 제24권4호
• /
• pp.111-122
• /
• 1999

In this paper, we consider a queueing network model. where the population constraint within each subnetwork is controlled by a semaphore queue. The total number of customers that may be present in the subnetwork can not exceed a given value. Each node has a constant service time and the arrival process to the queueing network is an arbitrary distribution. A major characteristics of this model is that the lower layer flow is halted by the state of higher layer. We present some properties that the inter-change of nodes does not make any difference to customer's waiting time in the queueing network under a certain condition. The queueing network can be transformed into a simplified queueing network. A dramatic simplification of the queueing network is shown. It is interesting to see how the simplification developed for sliding window flow control, can be applied to multi-layered queueing network.

• 대한토목학회논문집
• /
• 제9권4호
• /
• pp.103-112
• /
• 1989

방사성 폐기물 처분장 주변의 지하수 유동 현상을 이해하기 위해 정상상태에서의 지하수 수치모델을 수립하였다. 지하수 수치모델은 절점과 부재로 구성된 network에 의해 균질, 비균질, 다층매질에서 지하수 흐름을 조사하는데 이용되었고 모델의 수치해는 해석해와 일치하는 결과를 가졌다. 또한 지하매질의 수리학적 특성과 균열지역의 영향에 의한 지하수 유동의 물리적 변화현상도 조사되었다. 처분장 주변의 지하매질에 대해 구성된 network과 계산된 지하수 속도의 방향을 이용하여 지하수의 가능한 이동경로를 산정하는 방법이 개발되어 방사성 폐기물 처분장에서 생태계로의 가능한 지하수의 이동속도 및 시간을 예측하였다.

• 로봇학회논문지
• /
• 제6권4호
• /
• pp.353-364
• /
• 2011

In ubiquitous computing environments, users want to receive the robot services regardless of various physical status or devices such as time, place, various sensors, and high-performance servers. Thus, the ubiquitous service robots have to provide users with automated services according to situational information that they properly recognize. Beyond these problems, robot software has to establish a foundation to support the functions with the network infrastructure that are not able to be solved by a single independent resource. On the basis of a robot middleware that is capable of minimizing dependencies among hierarchy structures, the robot software also has to provide execution environment to control the flow of robot application services. In this paper, we propose a layered architecture to provide users with automated services through ubiquitous robots. The proposed architecture is based on CAWL (Context-Aware Workflow Language) and RSEL (Robot Services Execution Language). CAWL easily represents the flow of robot services from user application service levels, and RSEL is able to support the composition and reusability of robot services through abstraction of robot device services. In our experiments, we applied the proposed architecture to an example of "booth guide robot service".

• 한국통신학회논문지
• /
• 제28권4C호
• /
• pp.343-355
• /
• 2003

라우터에서 공평 대역 할당은 네트워크 폭주 상황에 반응하여 흐름을 제어하는 트래픽을 그렇지 않은 트래픽으로부터 보호한다. 그러나 Weighted Fair Queueing, Flow Random Early Drop 등의 전통적인 공평 대역 할당 방법은 상태 관리나 버퍼 관리, 스케쥴링 등을 흐름 단위로 수행하므로 초고속 네트워크의 백본에서 사용되는 경우 구현의 복잡성 뿐 아니라 흐름의 증가에 따른 네트위크의 확장성과 견고성을 확보하기 위해 코어 라우터에서의 흐름단위 관리를 배제하는 Core-stateless 메커니즘들이 제안되었다. Core-Stateless Fair Queueing 과 Rainbow Fair Queueing 등은 Core-Stateless 네트워크에서 근접한 공평 대역 할당 메커니즘들에 비해 단순해진 패킷 레이블 할당 방법과 패킷 폐기 방법을 사용하여 실제 구현 가능성을 높인 새로운 Core-stateless 알고리즘인 Simple Layered Fair Queueing (SLFQ) 를 제안하고 몇가지 형태의 시뮬레이션과 그 결과를 다른 메커니즘의 결과와 비교하면서 대역 공평성 보장 정도를 확인한다. 마지막으로 제안된 알고리즘의 향후 응용 가능성을 제시한다.

• Journal of Communications and Networks
• /
• 제14권5호
• /
• pp.554-565
• /
• 2012

In this paper, we study a cross-layer and end-to-end optimization problem for the integrated wireless and wireline network that consists of one wireline core network and multiple wireless access networks. We consider joint end-to-end flow control/distribution at the transport and network layers and opportunistic scheduling at the data link and physical layers. We formulate a single stochastic optimization problem and solve it by using a dual approach and a stochastic sub-gradient algorithm. The developed algorithm can be implemented in a distributed way, vertically among communication layers and horizontally among all entities in the network, clearly showing what should be done at each layer and each entity and what parameters should be exchanged between layers and between entities. Numerical results show that our cross-layer and end-to-end optimization approach provides more efficient resource allocation than the conventional layered and separated optimization approach.

• Journal of Electrical Engineering and Technology
• /
• 제10권4호
• /
• pp.1480-1491
• /
• 2015

In new deregulated electricity market, short-term price forecasting is key information for all market players. A better forecast of market-clearing price (MCP) helps market participants to strategically set up their bidding strategies for energy markets in the short-term. This paper presents a new prediction strategy to improve the need for more accurate short-term price forecasting tool at spot market using an artificial neural networks (ANNs). To build the forecasting ANN model, a three-layered feedforward neural network trained by the improved Levenberg-marquardt (LM) algorithm is used to forecast the locational marginal prices (LMPs). To accurately predict LMPs, actual power generation and load are considered as the input sets, and then the difference is used to predict price differences in the spot market. The proposed ANN model generalizes the relationship between the LMP in each area and the unconstrained MCP during the same period of time. The LMP calculation is iterated so that the capacity between the areas is maximized and the mechanism itself helps to relieve grid congestion. The addition of flow between the areas gives the LMPs a new equilibrium point, which is balanced when taking the transfer capacity into account, LMP forecasting is then possible. The proposed forecasting strategy is tested on the spot market of the Nord Pool. The validity, the efficiency, and effectiveness of the proposed approach are shown by comparing with time-series models

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제36권11호
• /
• pp.875-890
• /
• 2009

대사체학은 대사 경로 네트워크를 통해 생명 활동을 이해하고자 하는 분야로서, 대사 경로 내의 흐름을 한 눈에 알 수 있도록 가시화하여 보여 주는 도구가 반드시 필요하다. 이러한 가시화 도구의 경우 노드수가 증가할수록 에지 교차가 기하급수적으로 증가하는 문제가 있다. 따라서 유전체 수준의 대사경로를 연구하기 위해서는 대사 경로 그래프 레이아웃 상에 나타나는 에지 교차를 줄이는 것이 시각화의 매우 중요한 부분이다. 본 논문에서는 대사 경로의 구조적인 특징에 기반한 3차원 공간 상에 대사 경로 그래프를 레이아웃해 주는 모듈을 설계, 구현하였다. 2-계층 레이아웃을 이용하여 대사 경로 그래프를 계층적으로 레이아웃함으로써 표현영역을, 3차원으로 확장시키고 기존의 2차원 레이아웃 알고리즘 적용시 번번히 나타나는 에지 교차의 수를 감소시키는 결과를 얻었다.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2014년도 춘계학술대회
• /
• pp.211-214
• /
• 2014

제조 생산 기업에서 도입하고 있는 MES (제조실행시스템: Manufacturing Execution System) 역시 이러한 시장 변화에 부응하기 위해 스마트화 및 IT융합화를 실현해야하는 현실에 놓여있다. 더욱이 최근 비즈니스 환경이 글로벌화(globalization) 됨에 따라 지역적으로 하나의 공장에서 제한적으로 생산되는 제품들이 다국적이고 분산적으로 생산하게 된다. 따라서 하나의 공장 운용 시스템을 관장하던 로컬(local) MES가 글로벌(global) MES 솔루션으로 확장되는 동시에, 로컬 MES간 생산 자원(production resource)을 상호 공유하는 시스템으로 변화되어야 한다.