• Journal of the Economic Geographical Society of Korea
• /
• v.14 no.2
• /
• pp.116-128
• /
• 2011

Some subway passengers may want to have their fresh vegetables purchased through internet at a service facility within the subway station of the Metropolitan Seoul subway system on the way to home, which raises further questions about which stations are chosen to locate service facilities and how many passengers can use the facilities. This problem is well known as the pickup problem, and it can be solved on a traffic network with traffic flows which should be identified from origin stations to destination stations. Since flows of the subway passengers can be found from the smart card transaction database of the Metropolitan Seoul smart card system, the pickup problem in the Metropolitan Seoul subway system is to select subway stations for the service facilities such that captured passenger flows are maximized. In this paper, we have formulated a model of the pickup problem on the Metropolitan Seoul subway system with subway passenger flows, and have proposed a fast heuristic algorithm to select pickup stations which can capture the most passenger flows in each step from an origin-destination matrix which represents the passenger flows. We have applied the heuristic algorithm to select the pickup stations from a large volume of traffic network, the Metropolitan Seoul subway system, with about 400 subway stations and five millions passenger transactions daily. We have obtained not only the experimental results in fast response time, but also displayed the top 10 pickup stations in a subway guide map. In addition, we have shown that the resulting solution is nearly optimal by a few more supplementary experiments.

• Journal of KIISE:Information Networking
• /
• v.36 no.2
• /
• pp.69-79
• /
• 2009

Today's Internet is one of the necessaries of our life. Anomalies of the Internet provoke social problems. For that reason, Internet Measurement which studies characteristics on Internet traffic attracts pubic attention. Recently, Traffic Dispersion Graph (TDG), a novel traffic analysis method, was proposed. The TDG is not a statistical analysis method but a graphical visualization method on interactions among network components. In this paper, we propose a new anomaly detection paradigm and its technique using TDG. The existing studies have focused on detecting anomalous packets of flows. On the other hand, we focus on detecting the sources of anomalous traffic. To realize our paradigm, we designed the TDG Clustering method. Through this method, we could classify anomalous hosts infected by various worm viruses. We obtained normal traffic through dropping traffic of the anomalous hosts. Especially, we expect that the TDG clustering method can be applied to real-time anomaly detection because calculations of the method are fast.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.53 no.3
• /
• pp.286-292
• /
• 2017

The Coastal VTS will be continuously constructed to prevent marine traffic accidents in the coastal waters of the Republic of Korea. In order to provide the best traffic information service to the ship operator, it is important to understand the navigation risk factor. In this study, we analyzed the navigational hazards of Gunsan coastal area where the coastal VTS will be constructed until 2020. For this purpose, major traffic flows of merchant ships and density of vessels engaged in fishing were analyzed. This study was conducted by Automatic Identification System (AIS) and Vessel Pass (V-PASS) data. The grid intervals are 10 minute ${\times}$ 10 minute (latitude ${\times}$ longitude) based on the section of the sea. A total of 30 sections were analyzed by constructing a grid. As a result of the analysis, the major traffic flows of the merchant vessels in the coastal area of Gunsan were surveyed from north to south toward Incheon, Pyeongtaek, Daesan, Yeosu, Pusan and Ulsan, and from east to west in the port of Gunsan Port, 173-3, 173-6, 173-8, 183-2, 183-5, 183-8, 183-3, 184-1 and 184-2. As a result of the study, the fishing boats in Gunsan coastal area mainly operated in spring and autumn. On the other hand, the main traffic flow of merchant ships and the distribution of fishing vessels continue to overlap from March to June, so special attention should be paid to the control during this period.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.1
• /
• pp.37-44
• /
• 2004

Differentiated services network (DiffServ) aims to provide the same service to a group of connections that have similar Quality of Service requirements. One of the essential function to realize DiffServ is the traffic conditioning mechanism. The paper proposes the enhanced traffic conditioning mechanism which can assure the reserved rates of TCP and UDP flows and support fair distribution of excess bandwidth. The simulation results show that the new mechanism is rather insensitive of the effect of UDP against TCP throughput, and performs better both in terms of throughput assurance and fair distribution of excess bandwidth in case of well-provisioned and over-provisioned network environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4205-4227
• /
• 2018

Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.69-79
• /
• 2014

The scheduling scheme in packet switching networks is one of the most critical features that can affect the performance of the network. Hence, many scheduling algorithms have been suggested and some indices, such as fairness and latency, have been proposed for the comparison of their performances. While the nature of Internet traffic is bursty, traditional scheduling algorithms try to smooth the traffic and serve the users based on this smoothed traffic. As a result, the fairness index mainly considers this smoothed traffic and the service rate as the main parameter to differentiate among different sessions or flows. This work uses burstiness as a differentiating factor to evaluate scheduling algorithms proposed in the literature. To achieve this goal, a new index that evaluates the performance of a scheduler with bursty traffic is introduced. Additionally, this paper introduces a new scheduler that not only uses arrival rates but also considers burstiness parameters in its scheduling algorithms.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.94-97
• /
• 1999

In this paper, a new real-time neural network connection admission controller is proposed. The proposed controller measures traffic flows, cell loss rate and cell delay periodically each classes. The Neural network learns the relation between those measured information and service quality by real-time. Also the proposed controller uses the DWRR multiplexer with buffer dedicated to every traffic source in order to measure the delay that cells experience in buffer. Experimental result shows that the proposed method can control effectively heterogeneous traffic sources with diverse QoS requirement.

• Journal of the Korean Regional Science Association
• /
• v.15 no.2
• /
• pp.39-73
• /
• 1999

An examination is made of container movements, air cargo/passengers and telecommunications traffic in Northeast Asia during 1995. A drawback to studying flows between major cities is that information on telecommunications traffic is only available between countries. Also container traffic data are restricted to individual ports. Consequently, most attention is paid to movements of passenger aircraft between major cities derived from analysing timetables, particularly as they can be related to regional development concepts applied in Europe such as the 'blue banana' and 'bunches of grapes' concepts. A 'peas in a pod' may be a more appropriate movements are examined again in 1998 to gauge the impact of the Asian crisis.

• Journal of Korean Society of Transportation
• /
• v.17 no.2
• /
• pp.115-126
• /
• 1999

Past nears many Studies have been described for present state and forecasted for the future phenomena in various areas. Many theories and methodologies in transportation have been developed and applied by researchers and planners. On the other hand, many theories and methodologies had disappeared caused by their critical limitations. One of this cause that was discovered of the Chaos in traffic flows. The occurrence of Chaos in traffic flows has affected to the traffic volume and decreased significancy of a simulation result of a specific traffic flow. According to this fact, long-term forecast of traffic flow is difficult, moreover a butterfly effect impedes development and establishment of transportation model. A methodology to solve Chaos character in traffic flow can be able to provide more effective transport planning. This study tackles to enhance and revise the existing theories for the traffic flow applying Chaos theory to estimating travel time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.5
• /
• pp.988-995
• /
• 2009

One of the most popular services of Telematics is a shortest path finding from a starting point to a destination. In this paper, a dynamic shortest path finding system with forecasting result of traffic flow in the future was developed and various experiments to verify the performance of our system using real-time traffic information has been conducted. Traffic forecasting has been done by a prediction system using Bayesian network. It searched a dynamic shortest path, a static shortest path and an accumulated shortest path for the same starting point and destination and calculated their travel time to compare with one of its real shortest path. From the experiment, over 75%, the travel time of dynamic shortest paths is the closest to one of their real shortest paths than one of static shortest paths and accumulated shortest paths. Therefore, it is proved that finding a dynamic shortest path by applying traffic flows in the future for intermediated intersections can give more accurate traffic information and improve the quality of services of Telematics than finding a static shortest path applying by traffic flows of the starting time for intermediated intersections.