• ETRI Journal
• /
• 제24권5호
• /
• pp.360-372
• /
• 2002

In this paper, we propose the modified dynamic weighted round robin (MDWRR) cell scheduling algorithm, which guarantees the delay property of real-time traffic and also efficiently transmits non-real-time traffic. The proposed scheduling algorithm is a variation of the dynamic weighted round robin (DWRR) algorithm and guarantees the delay property of real-time traffic by adding a cell transmission procedure based on delay priority. It also uses a threshold to prevent the cell loss of non-real-time traffic that is due to the cell transmission procedure based on delay priority. Though the MDWRR scheduling algorithm may be more complex than the conventional DWRR scheme, considering delay priority minimizes cell delay and decreases the required size of the temporary buffer. The results of our performance study show that the proposed scheduling algorithm has better performance than the conventional DWRR scheme because of the delay guarantee of real-time traffic.

• 한국통신학회논문지
• /
• 제22권3호
• /
• pp.593-603
• /
• 1997

Connection admission decision in ATM networks requires decision made in real time using fast algorithm. It is difficult to construct a model of the multiplexed traffic and thus, approximation of the traffic load is necessary. In this paper, we propose a measurement-based dynamic CAC(Connection admission Control) in ATM(Asynchronous Transfer Mode) networks, which observes current traffic by the moving window and set the window size to the value which is computed from the measured cell loss amount. It is based on the measurements of the traffic load over an admission period that is load enough to reflect the current traffic behavior instead of analytic modeling. And, the dynamic reallocation of bandwidth for each class leads to effective bandwidth utilization. The performance of proposed method is analyzed through computer simulation. The performance of proposed method is analyzed by using SIMAN simulation package and FORTRAN language. As can be seen in the simulation result, cell loss performance and bandwidth utilization have been increased.

• 지능정보연구
• /
• 제6권1호
• /
• pp.113-128
• /
• 2000

This paper presents a first year report of an ongoing multi-year project to develop a systolic parallel simulation system for dynamic traffic assignment. The fundamental approach to the simulation is systolic parallel processing based on autonomous agent modeling. Agents continuously act on their own initiatives and access to database to get the status of the simulation world. Various agents are defined in order to populate the simulation world. In particular existing modls and algorithm were incorporated in designing the behavior of relevant agents such as car-following model headway distribution Frank-Wolf algorithm and so on. Simulation is based on predetermined routes between centroids that are computed off-line by a conventional optimal path-finding algorithm. Iterating the cycles of optimization-then-simulation the proposed system will provide a realistic and valuable traffic assignment. Gangnum-Gu district in Seoul is selected for the target are for the modeling. It is expected that realtime traffic assignment services can be provided on the internet within 3 years.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권8호
• /
• pp.2783-2804
• /
• 2021

In the network function virtualization environment, dynamic changes in network traffic will lead to the dynamic changes of service function chain resource demand, which entails timely dynamic adjustment of service function chain resource configuration. At present, most researches solve this problem through virtual network function migration and link rerouting, and there exist some problems such as long service interruption time, excessive network operation cost and high penalty. This paper proposes a dynamic adjustment method of service function chain resource configuration for the dynamic changes of network traffic. First, a dynamic adjustment request of service function chain is generated according to the prediction of network traffic. Second, a dynamic adjustment strategy of service function chain resource configuration is determined according to substrate network resources. Finally, the resource configuration of a service function chain is pre-adjusted according to the dynamic adjustment strategy. Virtual network functions combination and virtual machine reusing are fully considered in this process. The experimental results show that this method can reduce the influence of service function chain resource configuration dynamic adjustment on quality of service, reduce network operation cost and improve the revenue of service providers.

• 대한교통학회지
• /
• 제34권3호
• /
• pp.278-290
• /
• 2016

연속교통류 운영 및 설계에서는 최대통과교통류율에 따른 교통류 상태변화 분석이 중요하다. 최대통과교통류율은 연속교통류 운영상태를 평가함에 있어 기준이 되고 있으며, 병목현상과 같은 지 정체 발생시 최대통과교통류율이 급격히 감소하게 된다. 현재까지 이러한 연속교통류 운영과 관련된 다양한 연구들이 수행되었지만, 변화되는 교통량을 명확하게 식별하지 못하고 있다. 이에 본 연구에서는 교통운영 및 설계 등의 다양한 연구를 수행하는 데 있어 가장 중요한 실시간 교통량 변화 검지 방법론에 대한 연구를 실시한다. 이를 위하여 도시고속도로 자유로 구간의 24시간 레이더검지기의 시계열 자료를 이용하며, 교통류 상태 구분에는 통계적 기법의 일환인 터닝포인트 분석(Tunring Point Analysis, 이하 TPA)를 적용한다. TPA는 베이지안 접근법(bayesian approach)을 이용하며, 차량도착은 포아송 분포로 가정한다. 분석대상 구간에 대한 터닝포인트(Turning Point, 이하 TP)를 도출하였으며, 교통량이 변화되는 시점을 확인할 수 있었다. 또한 실시간 교통상태변화 검지를 위한 방법으로 TP지속시간을 설정하여 분석을 실시하였으며, 실시간으로 교통량의 변화를 검지하였다. 이는 기존의 직관적이고 경험적인 접근법의 한계를 극복할 수 있는 장점을 가지며, 실시간으로 교통량 변화를 식별할 수 있어 램프미터링(ramp-metering), 가변차로 등의 교통운영관리에 적용이 가능하다.

• 한국지리정보학회지
• /
• 제25권2호
• /
• pp.100-109
• /
• 2022

한국의 경제성장과 함께 인구와 차량의 대규모 도시 집중에 따라 심각한 도시교통 문제가 초래되고 있다. 혼잡통행료의 징수는 교통수요를 관리하기 위한 가장 효과적인 정책으로 평가받고 있지만 대부분 혼잡이 발생하는 지점이나 교통축을 중심으로 적용되어 그 효과가 제한적이다. 본 연구는 동적 혼잡통행료 징수 체계를 제안하기 위해 부산광역시 206개 교통 분석 존의 평균 통행속도를 이용하여 시공간 큐브 분석(Space-Time Cube Analysis)과 시공간 패턴 마이닝(Emerging Hot Spot Analysis) 기법으로 면적인 개념의 동적 혼잡구역을 도출하였다. 분석 결과, 비 첨두시간인 0시~7시에는 핫스팟이 형성되지 않고, 7시~24시에는 동적 핫스팟이 형성되는 것으로 나타났다. 특히, 특정 시간대(18시~20시)와 특정 지역(서면, 광복동)에 교통 혼잡이 집중하는 것을 확인할 수 있었다. 따라서, 동적 혼잡통행료의 징수를 위한 시공간의 분석을 통해 도심에서의 교통수요 관리의 효과가 극대화될 것으로 기대한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• 한국정보통신학회논문지
• /
• 제13권5호
• /
• pp.988-995
• /
• 2009

텔레매틱스 서비스 중 가장 보편적으로 사용되는 것이 출발지에서 목적지까지의 최단 경로 안내 서비스이다. 본 논문에서는 미래 시간에 대한 교통흐름 예측 결과를 바탕으로 한 동적 최단 경로 탐색 시스템을 개발하고 실시간교통정보를 이용한 다양한 실험을 수행하여 성능을 분석하였다. 교통흐름 예측은 베이지안 네트워크 (Bayesian network)를 이용한 예측 시스템을 사용하였다. 동일한 출발지와 목적지에 대해 동적 최단 경로와 정적 및 누적 최단 경로를 탐색하고 각 경로에 대한 통행 시간을 계산하여 실제 최단 경로의 통행시간과 비교하였다. 실험 결과 75% 이상의 비율로 동적 최단 경로의 통행시간이 정적이나 누적 최단 경로의 통행시간보다 실제 최단경로의 통행시간에 가깝게 나타났다. 따라서 중간 경유지에 도착 예정인 시간대의 교통 흐름을 예측하여 동적 최단 경로를 구하는 것이 출발시간의 교통흐름을 모든 구간에 적용하여 최단 경로를 구하는 정적 최단 경로에 비해 더 정확한 교통정보를 제공하여 텔레매틱스 서비스의 품질을 향상시킬 수 있음을 보여 주었다.

• 한국산업융합학회 논문집
• /
• 제5권1호
• /
• pp.53-64
• /
• 2002

The purpose of this study was to predict the future urban activities effectively and rationally. For the purpose, a simulation model, based on SD, was built by integrating economic activities, land use and traffic of a city and by dividing Daegu Metropolitan City into seven districts and one county. To identify the effect of the development of a new city in the Dalsung County area, the future population and traffic volume of the city were predicted, using the model. The results are summarized as follows. The future population according to the development of a new city in the Dalsung County area was predicted, and the effects before and after the development twenty years later were compared. The future population of the Dalsung County was found to have slightly increased, whereas that of the adjoining Dalsuh Metropolitan District was found to has slightly decreased. For the other districts, there were no changes of the future population. It was found, therefore, that the development of a new city would have no effect on other districts. Then, the traffic volume according to the development of a new city in the Dalsung County area was also predicted. It was found that in the initial stage the traffic volume would increase with the increase in population of Dalsung County. It was predicted that particularly,. the traffic volume for the purpose of business would greatly increase. The traffic volume of Dalsuh Metropolitan District showed a slight decrease, whereas for the other districts, there were no changes of the traffic volume.

• 정보보호학회논문지
• /
• 제27권3호
• /
• pp.579-589
• /
• 2017

클라우드 환경은 하이퍼바이저 기반으로 다수의 가상머신들이 상호 연결된 형태로 악성코드의 전파가 용이하기 때문에 다른 환경에 비해 악성코드에 감염될 경우 그 피해규모가 상대적으로 크다. 본 논문에서는 이러한 문제점을 해결하기 위해 안전한 클라우드 환경을 위한 악성트래픽 동적 분석 시스템을 제안한다. 제안하는 시스템은 클라우드 환경에서 발생하는 악성트래픽을 판별하여 악성행위를 격리된 가상네트워크 환경에서 지속적으로 모니터링 및 분석한다. 또한, 분석된 결과를 추후 발생하는 악성트래픽의 판별과 분석에 반영한다. 본 논문에서 제안하는 시스템은 클라우드 환경에서 발생하는 신 변종 악성트래픽 탐지 및 대응을 목적으로 클라우드 환경에서의 악성트래픽 분석환경을 구축함으로써 안전하고 효율적인 악성트래픽 동적 분석을 제공한다.