• The KIPS Transactions:PartC
• /
• v.18C no.6
• /
• pp.441-444
• /
• 2011

In this study, we present a method for efficiently aggregating network state information. It is especially useful for aggregating links that have both delay and bandwidth in an asymmetric network. Proposed method reduces the information distortion of logical link by integration process after similar measure and grouping of logical links in multi-level topology transformation to reduce the space complexity. It is applied to transform the full mesh topology whose Service Boundary Line (SBL) serves as its logical link into a spanning tree topology. Simulation results show that aggregated information accuracy and query response accuracy are higher than that of other known method.

• Journal of Korean Society of Transportation
• /
• v.24 no.5 s.91
• /
• pp.7-18
• /
• 2006

Data for travel information Provision are regularly aggregated to Provide travel time information in a reliable and convenient manner and to manage traffic data and information efficiently. In most of practices in Korea, the GPS based travel time data are mainly aggregated every 5 minutes As a result, some probes can't pass by a link within aggregation interval and thereby create uncompleted link passing data. But these data are mostly generated during the congested times and therefore a method that uses such uncompleted link passing data are required. This study estimated queue dissipation length, green time and cycle that use GPS spot speed and developed a link travel time estimation method using such uncompleted link passing data. It also presents method and the overall process of using such data to estimate link travel time in a more accurate manner. As a result, MAPE 1.98% and MAE 4.75 sec of link travel time accuracy improvement has been reported, which is not much different from the real link travel time. The method Proposed here would be an alternative to increase the amount of GPS probe data, especially in congested urban arterial case.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.109-120
• /
• 2004

Since the late of 1990, there have been number of studies on the required number of probe vehicles and/or optimal aggregation interval sizes for travel time estimation and forecasting. However, in general one to five minutes are used as aggregation intervals for the travel time estimation intervals for the travel time estimation and/or forecasting of loop detector system without a reasonable validation. The objective of this study is to deveop models for identifying optimal aggregation interval sizes of loop detector data for travel time estimation and prediction. This study developed Cross Valiated Mean Square Error (CVMSE) model for the link and route travel time forecasting, The developed models were applied to the loop detector data of Kyeongbu expressway. It was found that the optimal aggregation sizes for the travel time estimation and forecasting are three to five minutes and ten to twenty minutes, respectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.171-173
• /
• 2000

본 논문에서는 ATM PNNI(Private Network-Network Interface) 망에서 경로 배정을 위해 필요로 하는 링크 상태 정보(link state information)를 효율적으로 집단화(aggregation)하는 두 가지 방법을 제시한다. 이 방법들은 집단화할 동료 집단(peer group)의 경계노드(border node)들을 셔플넷(shufflenet)이나 de Bruijn 그래프의 노드들로 사상시킴으로써 표현해야 할 링크의 수를 완전 그물망 방법(full-mesh approach)의 N2에서 aN(a는 정수, N은 경계노드 수)으로 줄인다. 이는 공간 복잡도가 0(N)인 신장 트리(apanning tree) 방법에서 필요로 하는 링크의 수와 비슷하지만, 신장 트리 방법과는 달리 비대칭망(asymmetric network)에서 사용할 수 있다는 것이 큰 장점이다. 모의 실험 결과 셔플넷 방법은 aN개의 링크만을 표현하면서도 상태 정보의 정확성은 완전 그물망 방법에 근접함을 알 수 있었고, de Bruijn 방법은 정보의 정확성에서는 셔플넷 방법에 못 미치지만 가장 널리 사용되고 있는 별모양 방법(star approach) 방법보다는 훨씬 정확하며, 계산 복잡도 면에서 셔플넷 방법보다 효율적이었다.

• Journal of Multimedia Information System
• /
• v.3 no.2
• /
• pp.21-26
• /
• 2016

Our networked world has been growing exponentially fast. The explosion in volume of machine-to-machine (M2M) transactions threatens to exceed the transport capacity of the networks that link them. Therefore, it is quite essential to reconsider the tradeoff between using many data sets versus using good data sets. We focus on this tradeoff in the context of the quality of information aggregated from many sensors in a noisy environment. We start with a basic theoretical model considered in the famous "CEO problem'' in the field of information theory. From a point of view of large deviations, we successfully find a simple statement for the optimal strategies under the limited network capacity condition. Moreover, we propose an open problem for a sensor network scenario and report a numerical result.

• Journal of Korean Society of Transportation
• /
• v.25 no.2 s.95
• /
• pp.145-155
• /
• 2007

The objectives of this study aye to develop an on-line departure time-based travel time estimation method and to determine an optimal link length for the estimation. This study developed a link-based rolling horizon logic as the travel time estimation method. In order to determine an optimal link length, the information error of the travel time provision from the user's perspective was defined and employed as a selection criterion. It was found that, when the travel time aggregation size was set as five minutes, a link length of four kilometers gave the most accurate result.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1995.10a
• /
• pp.19-24
• /
• 1995

Most difficulties in inducing high flowability of general strength concrete arise from the segregation of aggregates due to the shortage of cementatious binders. To solve the problem, our research team has concentrated on finding the binders to link a gap between coarse and fine aggregates, under the condition not to influence a concrete strength. As a result of using stone powder or a middle class of aggregate size mostly used for asphalt pavement(Max. dia 13mm), we found that flowability of concrete increased significantly without aggregation and decrease of compressive strength.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.10 s.340
• /
• pp.9-16
• /
• 2005

The growth of the Internet over the last several years has placed a tremendous strain on the high bandwidth Hence, the amount of internet traffic has risen sharply and it has demanded to use the limited resource. MPLS (Multiprotocol Label Switching) is regarded as a core technology for migrating to the next generation Internet. It is important to reduce the number of labels and LSP(Label Switched Path)s for network resource management. In this thesis, we considered an MPLS multicast mechanism in the current Internet. The scalability problem due to lack of labels and multicast property is one of the serious problems in MPLS multicast mechanism, we proposed a Label Aggregation algorithm that the multicast packets on same link in MPLS allocates the same label for the scalability problem. In order to support the proposed algorithm we defined a new LDP(Label Distribution Protocol) multicast field and multicast packet is copied and transmitted for multicast group links of next node in LSR(label Switch Router).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.571-573
• /
• 2018

Wireless sensor networks have unbalanced energy consumption due to the convergence structure in which data is concentrated to sink nodes. To solve this problem, in the previous research, the relay node was placed between the source node and the sink node to merge the data before being concentrated to the sink node. However, selecting a relay node that does not consider the link quality causes packet loss according to the link quality of the reconfigured routing path. Therefore, in this paper, we propose a link cost calculation method for data reliability in routing path reconfiguration for relay node selection. We propose a link cost estimation formula considering the number of hops and RSSI as the routing metric value and select the RSSI threshold value through the packet transmission experiment between the sensor modules.