• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.613-627
• /
• 2004

In this paper, we propose an Aggregate Fairness Maker (ARM) required for an Edge router to improve fairness of throughput among the flows of Assured Service in DiffServ with different round trip time (RTT) and we propose a user flow Three Color Marker (uf-TCM) as a flow marker that marks packets from the flow as green, yellow, or red. A yellow packet is the packet that consumes loss token in uf-TCM as well as that is demoted green packet in AM due to disobey the aggregate traffic profile. The proposed AFH promotes yellow packet to green packet or demotes green packet to yellow packet through the fair method without per-flow management, and it improves the feirness of throughput among the flows as well as link utilization. A yellow packet and a red packet have the same drop precedence at Core Router in our scheme. So we can use the RIO buffer management scheme. We evaluated the performance of our proposed AFM and the REDP Marker that was proposed to improve fairness without per-flow management. Simulation results show that, compared with the REDP marker, proposed AFM can improve performance of throughput fairness among the flows with different RTT and link utilization under the over-provisioning, exact-provisioning, and under-provisioning network environments at Multiple DiffServ domains as well as at Single DiffServ domain.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.9
• /
• pp.26-37
• /
• 2016

The core technologies of the current transport network are OAM and protection switching to meet the sub-50ms protection switching time via a path redundancy when a link or node failure occurs. The transport networks owned by public network operators, central/local governments, and major enterprises are individually configured and managed with service resiliency in each own protected sub-network. When such networks are cascaded, it is also important to provide a node resiliency between two protected sub-networks. However, the linear protection switching in packet transport networks, such as MPLS-TP and Carrier Ethernet, does not define a solution of dual node interconnection. Although Ethernet ring protection switching covers the dual node interconnection scheme, a large amount of duplicated data frames may be flooded when a failure occurs on an adjacent (sub) ring. In this paper, we suggest a dual node interconnection scheme with linear protection switching technology in multiple protected sub-networks. And we investigate how various protected sub-network combinations with a proposed linear or ring protection process impact the service resiliency of multiple protected sub-networks through extensive experiments on link and interconnected node failures.

• Journal of Korean Society of Transportation
• /
• v.18 no.6
• /
• pp.89-99
• /
• 2000

To cope with the limits of conventional O-D trip matrix collecting methods, several approaches have been developed. One of them is bilevel Programming method Proposed by Yang(1995), which uses Sensitivity Analysis Based(SAB) algorithm to solve Generalized Least Square(GLS) problem. However, the SAB a1gorithm has revealed two critical short-comings. The first is that when there exists a significant difference between target O-D matrix and true O-D matrix, SAB algorithm may not produce correct solution. This stems from the heavy dependance on the historical O-D information, in special when gravel Patterns are dramatically changed. The second is the assumption of iterative linear approximation to original Problem. Because of the approximation, SAB algorithm has difficulty in converging to Perfect Stackelberg game condition. So as to avoid the Problems. we need a more robust and stable solution method. The main purpose of this Paper is to show the problem of the dependency of Previous models and to Propose an alternative solution method to handle it. The Problem of O-D matrix estimation is intrinsically nonlinear and nonconvex. thus it has multiple solutions. Therefore it is necessary to require a method for searching globa1 solution. In this paper, we develop a solution algorithm combined with genetic algorithm(GA) , which is widely used as probabilistic global searching method To compare the efficiency of the algorithm, SAB algorithm suggested by Yang et al. (1992,1995) is used. From the results of numerical example, the Proposed algorithm is superior to SAB algorithm irrespective of travel patterns.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.4
• /
• pp.387-396
• /
• 2004

A scheme to evaluate the number of users and cell coverage of a WCDMA supporting multi-rate traffic is newly presented through calculation of the realizable Erlang capacity from a derived blocking probability and the path loss from the COST231 Walfisch-Ikegami(W) model. We evaluate the voice-data Erlang capacities at various data rates of 15 kbps to 960 kbps and it is shown that they have a linear relationship to each other. When the E$\_$b//N$\_$o/ is low from 4 ㏈ to 3 ㏈ in case of voice capacity of 50 Erlang at 8 kbps, the result shows the increase for the data capacity of 10 Erlang and the enlargement of 100 m for the cell coverage at low rate of 15 kbps, and the increase of 0.11 Erlang and the enlargement of 40 m at high rate of 960 kbps. The increase of the blocking probability results in the increase of the Erlang capacity, but not an effect on the cell coverage, and the increase of active users in a cell results in the decrease of the coverage.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.3
• /
• pp.78-88
• /
• 2014

Now, UTIS collects and provides traffic information by building RSE 1,150(unit) and OBE about 51,000(vehicle). it's inevitable to enlarge traffic information sources which use to improve quality of UTIS traffic information for Stabilizing UTIS's service. but there are missing data sections. And, In this study as a way to overcome these problems, based on BIS(Bus information system) installed and operating in the capital area to develop normal vehicle's link transit time estimation model which is used realtime collecting BMS data, we'll utilize the model to provide missing data section's information. For these problem, we selected partial section of suwon-city, anyang-city followed by drive only way or not and conducted model estimating and verification each of BMS data and UTIS traffic information. Consequently, Case2,4,6,8 presented highly credibility between UTIS communication data and estimated value but In the Case 3,5 we determined to replace communication data of UTIS' missing data section too hard for large error. So we need to apply high credibility model formula adjusting road managing condition and the situation of object section.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.20 no.5
• /
• pp.186-201
• /
• 2021

As autonomous driving technology advances, the accuracy of the vehicle position is important for recognizing the environments around driving. Map-matching localization techniques based on high definition (HD) maps have been studied to improve localization accuracy. Because conventional map-matching techniques estimate the vehicle position based on an HD map reference dataset representing the center of the lane, the estimated position does not reflect the deviation of the lateral distance within the lane. Therefore, this paper proposes a localization system based on the reference lateral position dataset extracted using image processing and HD maps. Image processing extracts the driving lane number using inverse perspective mapping, multi-lane detection, and yellow central lane detection. The lane departure method estimates the lateral distance within the lane. To collect the lateral position reference dataset, this approach involves two processes: (i) the link and lane node is extracted based on the lane number obtained from image processing and position from GNSS/INS, and (ii) the lateral position is matched with the extracted link and lane node. Finally, the vehicle position is estimated by matching the GNSS/INS local trajectory and the reference lateral position dataset. The performance of the proposed method was evaluated by experiments carried out on a highway environment. It was confirmed that the proposed method improves accuracy by about 1.0m compared to GNSS / INS, and improves accuracy by about 0.04m~0.21m (7~30%) for each section when compared with the existing lane-level map matching method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.751-759
• /
• 2008

Carrier Ethernet backbone network integrates distributed layer-2 based metro networks. In this networks, Multiple Spanning Tree Protocol (MSTP) has been uscd as a main routing protocol that allows multiple spanning trees in a network. A better routing protocol called IEEE802.1aq - Shortest Path Bridging (SPB) is recently proposed, that generates the shortest spanning tree per a destination node. As SPB provides a routing path per a destination node, there is no way to adapt network traffic at normal condition. If we are free from the principle of "a spanning tree per a destination node", we can achieve adaptive routing. Based on this philosophy, we propose a new spanning tree based protocol - Edge Node Divided Spanning Tree (ENDIST). ENDIST divides an edge node into sub-nodes as many as connecting links from the node and each sub-node generates a single shortest path tree based on SPB. Depending on network or nodal status, ENDIST chooses a better routing path by flow-basis. This added traffic engineering ability contributes to enhanced throughput and reduced delay in backbone networks. The simulation informs us that ENDIST's throughput under heavy load performs about 3.4-5.8 and 1.5-2.0 times compared with STP's and SPB's one respectively. Also, we verified that ENDIST's throughput corresponds to the theoretical upper bound at half of cases we investigated. This means that the proposed ENDIST is a dramatically enhanced and the close-to-perfect spanning tree based routing schemes.

• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.265-274
• /
• 1998

본 논문은 도로를 주행하는 차량의 지점속도에 대하여 단기간(short-term)으로 예측하는 네 가지의 모형들에 대한 개발 및 결과의 비교하고 평가했다. 사용된 기법들로는 다중회귀분석, 시계열분석(ARIMA), 인공 신경망, 칼만필터링 등이며, 모형의 구출을 위하여 다수의 독립변수 및 입력변수가 요구되는 다중회귀분석과 인공 신경망에서는 연속방정식에서 고려되는 변수들간의 단순상관계수 및 편상관계수의 계산을 통해서 입력변수가 설정이 되었으며, 시계열분석(ARIMA)과 칼만필터링 등 단일 입력 변수만을 요하는 모형에서는 바로 전 시간대와 현재시간대의간격동안 속도의 변화량을 입력변수로 설정하였다. 속도를 비롯해서 교통 데이터는 현장자료를 사용하였는데, 이는 서울의 한강 옆에 위치한 올림픽대로 중 한강대로에 위치한 검지기 3개를 통해서 천호동 방면으로 이동하는 교통류에 대해서 17시간 (00시~17시)동안 수집했다. 17시간 수집했는데 그중에 검지된 속도는 14km/h에서 98km/h까지 변하는 등, 수집된 자료에는 다양한 교통상태가 포함되어 있는데 이는 각 모형들의 정확한 예측력과 적응성을 평가하기 위함이었다. 각 모형은 예측하고자 하는 시점으로부터 1, 5, 10, 15분 후의 속도를 예측하는 것으로 총 4가지의 예측시간간격으로 각각 실험되었다. 결과는 전반적으로 신뢰성 있게 나왔으나 그중에서도 정확성면에서는 인공신경망과 칼만필터링이 우수했고 적응성면에서는 칼만필터리딩 탁월했다. 또한 1분 후의 속도를 예측하는 결과들은 모형들간에 거의 비슷한 정확도를 보여주었는데 이는 입력변수의 설정이 중요한 것임을 보여주는 것이라 판단된다. 있는 기법이다.적으로 세부적 차종분류로 접근한다.의 영향들을 고려함으로써 가로망 설계 과정에서 가로망의 상반된 역할인 이동성과 접근성의 비교가 가능한 보다 현실적인 가로망 설계 모형을 구축하고자 한다. 지금까지 소개된 가로망 설계모형들은 용량변화에 대한 설계변수의 형태에 따라 이산적 가로망 설계 모형과 연속적 가로망 설계모형으로 나뉘어지게 된다. 본 논문의 경우, 계산속도의 향상 측면에서는 연속적 가로망 설계 모형을 도입할 수 있지만, 이때 요구되는 도로용량이 이산적인 변수(차선 수)로 결정되어야만 신호제어 변수를 결정할 수 있기 때문에, 이산적 가로망 설계 모형이 사용된다. 하지만, 이산적 설계모형의 경우 조합최적화 문제이므로 정확한 최적해를 구하기 위해서는 상당한 시간이 소요되며, 경우에 따라서는 국부 최적해에 빠지게 된다. 이러한 문제를 극복하기 위해, 우선 이상적 모형의 근사화, 혹은 조합최적화문제를 위해 개발된 Simulated Annealing기법의 적용, 연속적 모형의 변수를 이산화하는 방법 등 다양한 모형들을 고려해 본 뒤, 적절한 모형을 적용할 것이다. 가로망 설계 모형에서 신호제어를 고려하기 위해서는 주어진 가로망에 대한 통행 배정과정에서 고려되는 통행시간을 링크통행시간과 교차로 지체시간을 동시에 고려해야 하는데, 이러한 문제의 해결을 위해서 최근 활발히 논의되고 있는 교차로에서의 신호제어에 대응하는 통행배정 모형을 도입하여 고려하고자 한다. 이를 위해서 지금까지 연구되어온 Global Solution Approach와 Iterative Approach를 비교, 검토한 뒤 모형에 보다 알맞은 방법을 선택한다. 차량의

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1565-1573
• /
• 2011

In this paper, we present a MIMO-OFDM broadband power line communication (BPLC) for Smart Grid and its associated applications and analyze its performance over the 3-phase 4-wire power line channels. For practical BPLC system simulation, we adopt the statistical power line fading channel model instead of the existing deterministic fading channel models (Zimmermann model, MTL model, and so on). In this paper, we implement $2{\times}2$ and $3{\times}3$ MIMO schemes using 3-phase 4-wire power lines. We investigate the capacity loss and BER performance of the proposed MIMO system by considering the effect of cross-talk between antenna paths. We choose space-frequency coding in order to reduce frequency interference between subcarriers and employ maximum ratio combining (MRC) that achieves both multiple antenna path diversity gain and multiple fading path diversity gain. We evaluate the proposed system performance through computer simulation in terms of the impulse noise index and the capacity loss ratio and compare the different signal combining schemes including MRC, equal gain combing (EGC), and selection combining (SC).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.612-622
• /
• 2013

In this paper, we propose a coding packet group-based ARQ scheme (rNC) for file delivery in wireless networks. rNC assumes multiple network coding points between the source and the destination. Each network coding point gathers and codes a group of packets according to the queue polling system. A queue polling system makes a few or several packets available for coding in a queue while polling the other queues in the system. Thus, we assuem a queue polling system at each network coding point. We call this group of packets as coded packet group. Each coding point acknowledges the reception of every code packet group to its previous coding point for reliable delivery. Thus, the intermediate coding points including the source can release its buffer before the packet is delivered to the destination. To guarantee the ultimate file delivery to the destination, the destination sends acknowledgement to the sender. We evaluate our proposed scheme using ns-2 and compare the performance with CodeCast. The results show that rNC works better than CodeCast in terms of packet delivery ratio and control overhead in unreliable wireless networks.