• 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.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.559-566
• /
• 2016

Software defined network (SDN) can effectively improve the performance of traffic engineering and will be widely used in backbone networks. Therefore, new energy-saving schemes must take SDN into consideration; this action is extremely important owing to the rapidly increasing energy consumption in telecom and Internet service provider (ISP) networks. Meanwhile, the introduction of SDN in current networks must be incremental in most cases, for technical and economic reasons. During this period, operators must manage hybrid networks in which SDN and traditional protocols coexist. In this study, we investigate the energy-efficient traffic engineering problem in hybrid SDN/Internet protocol (IP) networks. First, we formulate the mathematical optimization model considering the SDN/IP hybrid routing mode. The problem is NP-hard; therefore, we propose a fast heuristic algorithm named hybrid energy-aware traffic engineering (HEATE) as a solution. In our proposed HEATE algorithm, the IP routers perform shortest-path routing by using distributed open shortest path first (OSPF) link weight optimization. The SDNs perform multipath routing with traffic-flow splitting managed by the global SDN controller. The HEATE algorithm determines the optimal setting for the OSPF link weight and the splitting ratio of SDNs. Thus, the traffic flow is aggregated onto partial links, and the underutilized links can be turned off to save energy. Based on computer simulation results, we demonstrate that our algorithm achieves a significant improvement in energy efficiency in hybrid SDN/IP networks.

• Journal of Korean Port Research
• /
• v.6 no.1
• /
• pp.49-68
• /
• 1992

Recently changes in the technological environment of marine transportation and the increase of traffic volume have fostered a revolution in the design and operation of port and also playing a major role in the development of new types of port in Asian. These changes are dynamic and will continue to influence port physical distribution system. The port of Pusan has been hardly able to handle the traffic increases in recent years by expansion increased mechanization and other operational and institutional improvements but, further traffic increases bring about critical congestion and such congestion is an economic cost to the country in terms of cost of physical distribution. This paper treats the development of entirely new port of Pusan and related transportation system by considering the existing or expected need for improved port capacity and services. The western part of GADUK island is selected as the optimum port site through the detailed analysis of the physical requirement and careful consideration of regional development and since the lead time of the national development plan including the port project from initial planning to implementation is considered as long as 7 to 10 years the aggregated master plan for port development is made and implemented in the year of 2012.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7B
• /
• pp.489-498
• /
• 2005

A Denial of Sewice (DoS) attack attempts to prevent legitimate users of a sewice from being adequately served by monopolizing networks resources and, eventually, resulting in network or system congestion. This paper proposes a Minority First (MF) gateway, which is capable of guaranteeing the Quality of Service (QoS) of legitimate service traffic under DoS situations. A MF gateway can rapidly determine whether an aggregated flow is a congestion-inducer and can protect the QoS of legitimate traffic by providing high priority service to the legitimate as aggregate flows, and localize network congestion only upon attack traffic by providing low priority to aggregate flows regarded as congestion-inducer. We verify through simulation that the suggested mechanism possesses excellence in that it guarantees the QoS of legitimate traffic not only under a regular DoS occurrence, but also under a Distributed DoS (DDoS) attack which brings about multiple concurrent occurrences of network congestion.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.287-296
• /
• 2008

The IEEE 802.11 wireless standard uses the carrier sense multiple access with collision avoidance (CSMA/CA) as its MAC protocol (during the distributed coordination function period). This protocol is an adaptation of the CSMA/CD of the wired networks. CSMA/CA mechanism cannot guarantee quality of service (QoS) required by the application because orits random access method. In this study, we propose a new MAC protocol that considers different types of traffic (e.g., voice and data) and for each traffic type different priority levels are assigned. To improve the QoS of IEEE 802.11 MAC protocols over a multi-channel CSMA/CA, we have developed a new admission policy for both voice and data traffics. This protocol can be performed in direct sequence spread spectrum (DSSS) or frequency hopping spread spectrum (FHSS). For voice traffic we reserve a channel, while for data traffic the access is random using a CSMA/CA mechanism, and in this case a selective reject and push-out mechanism is added to meet the quality of service required by data traffic. To study the performance of the proposed protocol and to show the benefits of our design, a mathematical model is built based on Markov chains. The system could be represented by a Markov chain which is difficult to solve as the state-space is too large. This is due to the resource management and user mobility. Thus, we propose to build an aggregated Markov chain with a smaller state-space that allows performance measures to be computed easily. We have used stochastic comparisons of Markov chains to prove that the proposed access protocol (with selective reject and push-out mechanisms) gives less loss rates of high priority connections (data and voices) than the traditional one (without admission policy and selective reject and push-out mechanisms). We give numerical results to confirm mathematical proofs.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.6
• /
• pp.73-80
• /
• 2021

In this paper, we propose a packet processing method capable of handling large-capacity traffic over 20Gbps using multi-core and huge page memory approaches. As ICT technology advances, the global average monthly traffic is expected to reach 396 exabytes by 2022. With the increase in network traffic, cyber threats are also increasing, increasing the importance of traffic analysis. Traffic analyzed as an existing high-cost foreign product simply stores statistical data and visually shows it. Network administrators introduce and analyze many traffic analysis systems to analyze traffic in various sections, but they cannot check the aggregated traffic of the entire network. In addition, since most of the existing equipment is of the 10Gbps class, it cannot handle the increasing traffic every year at a fast speed. In this paper, as a method of processing large-capacity traffic over 20Gbps, the process of processing raw packets without copying from single-core and basic SMA memory approaches to high-performance packet reception, packet detection, and statistics using multi-core and NUMA memory approaches suggest When using the proposed method, it was confirmed that more than 50% of the traffic was processed compared to the existing equipment.

• Journal of Korean Society for Geospatial Information Science
• /
• v.3 no.1 s.5
• /
• pp.91-104
• /
• 1995

The spatial aggregation of data, in transportation and other planning processes, is an important theoretical consideration because the results of any analysis are not entirely independent of the delineation of zones. Moreover, using a different spatial aggregation may lead to different, and sometimes contradictory conclusions. Two criteria have been considered as important in designing zone systems. They are scale and aggregation. The scale problem arises because of uncertainty about the number of zones needed for a study and the aggregation problem arises because of uncertainty about how the data are to be aggregated to from a given scale problem. In a transportation study, especially in the design of traffic analysis zone(TAZ), the scale problem is directly related to the number dof zones and the aggregation problem involves spatial clustering, meeting the general requirements of forming the zones system such as equal traffic generation, convexity, and the consistency with the political boundary. In this study, first, the comparative study of delineating spatial units has been given. Second, a FORTRAN-based heuristic algorithm for designing TAZ based on socio-economic data has been developed and applied to the Korean peninsula containing 132 micro parcels. The vector type ARC/INFO GIS topological data mosel has been used to provise the adjacency information between parcels. The results, however, leave some to be desired in order to overcome such problems as non-convexity of the agglomerated TAZ system and/or uneven traffic phenomenon for each TAZ.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.4
• /
• pp.344-365
• /
• 2009

The performance of a tracking system is greatly increased if multiple types of sensors are combined to achieve the objective of the tracking instead of relying on single type of sensor. To conduct the multi-modal tracking, we have previously developed a multi-modal sensor-based tracking model where acoustic sensors mainly track the objects and visual sensors compensate the tracking errors [1]. In this paper, we find a network synchronization problem appearing in the developed tracking system. The problem is caused by the different location and traffic characteristics of multi-modal sensors and non-synchronized arrival of the captured sensor data at a processing server. To effectively deliver the sensor data, we propose a time-based packet aggregation algorithm where the acoustic sensor data are aggregated based on the sampling time and sent to the server. The delivered acoustic sensor data is then compensated by visual images to correct the tracking errors and such a compensation process improves the tracking accuracy in ideal case. However, in real situations, the tracking improvement from visual compensation can be severely degraded due to the aforementioned network synchronization problem, the impact of which is analyzed by simulations in this paper. To resolve the network synchronization problem, we differentiate the service level of sensor traffic based on Weight Round Robin (WRR) scheduling at the routers. The weighting factor allocated to each queue is calculated by a proposed Delay-based Weight Allocation (DWA) algorithm. From the simulations, we show the traffic differentiation model can mitigate the non-synchronization of sensor data. Finally, we analyze expected traffic behaviors of the tracking system in terms of acoustic sampling interval and visual image size.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.83-90
• /
• 2009

Since traffic is aggregated to a MPP that acts as an Internet gateway, if traffic load is not balanced among the MPPs in a WMN, the overall performance of a WMN becomes poor even though the total traffic load is far below the capacity of the WMN. Therefore, in this paper, we propose a stochastic load balancing scheme where each MP (Mesh Point) probabilistically selects its serving MPP according to the congestion levels of MPPs. Through extensive simulations using ns-2, we have verified that our scheme can stabilize a WMN fast when congestion occurs and reduce packet loss rate by distributing traffic load of a congested MPP to multiple MPPs in the inverse proportional to their congestion levels. Compared to queue-based load balancing scheme, our method can decrease network stabilization time by 34 seconds, and reduce packet loss rate by 7.6%. Since the proposed scheme can reduce network stabilization time by efficiently using network resource, it is expected to contribute to the reliable operation of a WMN.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.457-465
• /
• 2007

Native information provider(IP) anycast suffers from routing scalability issues and the lack of stateful communication support. For this reason, we propose architecture for scalable and transparent anycast services(ASTAS), a proxy-based architecture that provides support for stateful anycast communications, while retaining the transparency offered by native anycast. Dynamic resource assignment for each initiated session guarantees that a connection is established with the most suitable target server, based on network and server conditions. Traffic engineering in the overlay can be realized in an effective way due to the dissemination of aggregated state information in the anycast overlay. To minimize the total deployment cost for ASTAS architectures, we propose optimized proxy placement and path finding heuristics based on look-ahead information gathered in network nodes. Contrary to a regular integer linear program(ILP) formulation, these heuristics allow to optimize proxy placement in large networks. A use case on a European reference network illustrates that lower proxy costs enable proxy deployment closer to the end-users, resulting in a reduced network load.