• Journal of Korea Multimedia Society
• /
• v.18 no.2
• /
• pp.189-198
• /
• 2015

Despite the fact that traffic engineering techniques have been comprehensively utilized in the past to enhance the performance of communication networks, the distinctive characteristics of Software Defined Networking (SDN) demand new traffic engineering techniques for better traffic control and management. Considering the behavior of traffic, large flows normally carry out transfers of large blocks of data and are naturally packet latency insensitive. However, small flows are often latency-sensitive. Without intelligent traffic engineering, these small flows may be blocked in the same queue behind megabytes of file transfer traffic. So it is very important to identify large flows for different applications. In the scope of this paper, we present an approach to detect large flows in real-time without even a short delay. After the detection of large flows, the next problem is how to control these large flows effectively and prevent network jam. In order to address this issue, we propose an approach in which when the controller is enabled, the large flow is mitigated the moment it hits the predefined threshold value in the control application. This real-time detection, marking, and controlling of large flows will assure an optimize usage of an overall network.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.239-244
• /
• 2007

In the telematics system, a reasonable path search time should be guaranteed from a great number of user's queries, even though the optimal path with minimized travel time might be continuously changed by the traffic flows. Thus, the path search method should consider traffic flows of the roads and the search time as well. However, the existing path search methods are not able to cope efficiently with the change of the traffic flows and to search rapidly paths simultaneously. This paper proposes a new path search method for fast computation. It also reflects the traffic flows efficiently. Especially, in order to simplify the computation of variable heuristic values, it employs a simplification method for estimating values of traffic-adaptable heuristics. The experiments are carried out with the $A^*$ algorithm and the proposed method in terms of the execution time, the number of node accesses and the accuracy. The results obtained from the experiments show that the method achieves very fast execution time and the reasonable accuracy as well.

• Journal of Information Processing Systems
• /
• v.6 no.3
• /
• pp.307-322
• /
• 2010

Traffic classification is an essential task for network management. Many researchers have paid attention to initial sub-flow features based classifiers for traffic classification. However, the existing classifiers cannot classify traffic effectively in mobile IP networks. The classifiers depend on initial sub-flows, but they cannot always capture the sub-flows at a point of attachment for a variety of elements because of seamless mobility. Thus the ideal classifier should be capable of traffic classification based on not only initial sub-flows but also various types of sub-flows. In this paper, we propose a classifiable sub-flow selection method to realize the ideal classifier. The experimental results are so far promising for this research direction, even though they are derived from a reduced set of general applications and under relatively simplifying assumptions. Altogether, the significant contribution is indicating the feasibility of the ideal classifier by selecting not only initial sub-flows but also transition sub-flows.

• Management Science and Financial Engineering
• /
• v.15 no.1
• /
• pp.51-69
• /
• 2009

A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.

• ETRI Journal
• /
• v.5 no.2
• /
• pp.17-28
• /
• 1983

This paper deals with the problem of optimally controlling traffic flows in urban transportation traffic networks. For this, a nonlinear discrete-time model of urban traffic network is first suggested in order to handle the phenomenon of traffic flows such as oversaturatedness and/or undersaturatedness. Then an optimal control problem is formulated and a hierarchical optimization technique is applied, which is based upon a prediction-type two-level method of Hirvonen and Hakkala.

• Journal of the Economic Geographical Society of Korea
• /
• v.10 no.4
• /
• pp.427-443
• /
• 2007

The purpose of this study is to investigate spacio-temporal structures of traffic flows on the subway network in the Metropolitan Seoul, and the relationships between topological structures of traffic flows and land use patterns. In particular we analyze in the topological structures of traffic flows on the subway network in time dimension as well as in spatial dimension. For the purpose, this study utilizes data mining techniques to the one day T-card transaction data of the last four years, which has developed for exploring the characteristics of traffic flows from large scale trip-transaction databases. The topological structures of traffic flows on the subway network has changed considerably during the last four years. The volumes of traffic flows, the travel time and stops per trip have increased until 2006 and decreased again in 2007. The results are visualized by utilizing GIS and analyzed, and thus the spatial patterns of traffic flows are analyzed. The spatial distribution patterns of trip origins and destinations show substantial differences among time zones during a day. We analyze the relationships between traffic flows at subway stops and the geographical variables reflecting land use around them. We obtain 6 log-linear functions from stepwise multiple regression analysis. We test multicollinearity among the variables and autocollelation for the residuals.

• Journal of the Economic Geographical Society of Korea
• /
• v.12 no.4
• /
• pp.521-539
• /
• 2009

This study investigates the time-space characteristics of the road traffic flows in Seoul and the relationship with land use patterns. For the purpose, we analyze the road traffic data collected at 118 observation sites over Seoul City area since 1993. We examine the time-trend of the annual average traffic flows per day during the last fourteen years. Three different trends are revealed: rapid increase during the time period between 1993 and 1997, maintenance same level after sharp decrease between year 1997 and 1998, and gradual decrease after sharp decrease between year 2003 and 2004. The spatial distribution patterns of road traffic flows have also been changed significantly during the period. The traffic flows in the urban center have been declined gradually, while the traffic flows in the boundary area and southern CBDs have increased dramatically. In order to examine the relationship with the changes in the land-use patterns and road traffic flows, we analyze the changes in the spatial distribution patterns of population and industries. We developed three multiple linear regression models to test the relationships between the changes in the land-use variables and road traffic flows.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.575-596
• /
• 2009

Facing limited network resources such as bandwidth and processing capability, the Internet will have congestion from time to time. In this paper, we propose a scheme to maximize the total utility offered by the network to the end user during congested times. We believe the only way to achieve our goal is to make the scheme application-aware, that is, to take advantage of the characteristics of the application. To make our scheme scalable, it is designed to be class-based. Traffic from applications with similar characteristics is classified into the same class. We adopted the RED queue management mechanism to adaptively control the traffic belonging to the same class. To achieve the optimal utility, the traffic belonging to different classes should be controlled differently. By adjusting link bandwidth assignments of different classes, the scheme can achieve the goal and adapt to the changes of dynamical incoming traffic. We use the control theoretical approach to analyze our scheme. In this paper, we focus on optimizing the control on two types of traffic flows: TCP and Simple UDP (SUDP, modeling audio or video applications based on UDP). We derive the differential equations to model the dynamics of SUDP traffic flows and drive stability conditions for the system with both SUDP and TCP traffic flows. In our study, we also find analytical results on the TCP traffic stable point are not accurate, so we derived new formulas on the TCP traffic stable point. We verified the proposed scheme with extensive NS2 simulations.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.652-653
• /
• 2015

This study investigates the effect of real-time traffic information on the traffic flows in Korea. Recently, the development of smartphones has made it easier to use the route guidance service based on real-time traffic information. By the Big Data analysis in the study, it was found that the number of postings on the web community sites increased sharply in 2010 and 2011 when the smartphones spread widely. In the analysis of the traffic speeds by time, the average traffic speeds for morning and evening rush hours on weekdays from 2009 to 2014 of the 142 sections in the 6 national highways in Gyeonggi-do, Korea were used. From the results of the analysis, it was found that the percentage of the number of sections with the improved traffic flows increased greatly in 2012 compared to 2011. The findings of the study indicate the effect of the real-time traffic information on improving traffic flows.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.324-333
• /
• 2001

The Differentiated Services (Diffserv) framework has been proposed by the IETF as a simple service structure that can provide different Quality of Service (QoS) to different classes of packets in IP networks. IP packets are classified into one of a limited number of service classes, and are marked in the packet header for easy classification and differentiated treatments when transferred within a Diffserv domain. The Diffserv framework defines simple and efficient QoS differentiation mechanisms for the Internet. However, the original Diffserv concept does not provide a complete QoS management framework. Since traffic flows in IP networks are unidirectional from one network point to the other and routing paths and traffic demand get dynamically altered, it is important to monitor end-to-end traffic status, as well as traffic status in a single node. This paper suggests a distributed QoS monitoring method that collects the statistical data of each service class in every Diffserv router and calculates edge-to-edge QoS of the aggregated IP flows by combining routing topology and traffic status. A format modeling of edge-to-edge Diffserv flows and algorithms for aggregating edge-to-edge QoS is presented. Also an SNMP-based QoS management prototype system for Diffserv networks is presented, which validates our QoS management framework and demonstrates useful service management functionality.