• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.437-447
• /
• 2003

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection) algorithm. However, RED algorithm simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control such as UDP flow, but also short round-trip time TCP flows. In this paper, in order to solve this problem, we propose a simple fairness queue management scheme, called AFQM(Approximate Fair Queue Management) algorithm, that discriminate against the flows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy Since it is a small overhead and easy to implement, AFQM algorithm controls unresponsive or misbehaving flows with a minimum overhead.

• Journal of Intelligence and Information Systems
• /
• v.16 no.1
• /
• pp.57-69
• /
• 2010

The ubiquitous transportation system environments make it possible to collect each vehicle's position and velocity data and to perform more sophisticated traffic flow management at individual vehicle or platoon level through V2V and V2I communication. It is necessary to develop a new data processing methodology to take advantage of the ubiquitous transportation system environments. This paper proposed to build 3-dimension data profiles to maintain the detailed traffic flow information contained in the individual vehicles' data and at the same time to keep the profiles from the meaningless fluctuations. Also methods to build the platoon profile and the shock wave speed profile are proposed, which have not been possible under ITS(Intelligent Transportation System) environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5B
• /
• pp.443-450
• /
• 2011

The Internet has become an essential part in our modern life by providing useful information. So, the volume of Internet traffic has been increasing rapidly, which emphasizes the importance of network traffic analysis for effective network operation and management. Signature based analysis have been commonly used, but it is shown that the increase of signatures due to the increase of applications causes the performance degradation of real-time traffic analysis on high-speed network links. In this paper, we propose OS fingerprinting method for real-time traffic analysis. The previous problems can be solved by utilizing the OS information. The OS fingerprinting method for real-time traffic analysis, proposed in this paper, conducts under passive mode, and improves the limitation of a previous method such as low completeness and accuracy. In this paper, we enlarged an input data to improve completeness, and used the User-Agent field in HTTP packet to extract various OS signatures. Also, we changed an input data from packet to flow to improve accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4287-4306
• /
• 2016

Network resilience provides an effective way to overcome the problem of network failure and is crucial to Internet protocol (IP) network management. As one of the main challenges in network resilience, recovering from link failure is important to maintain the constancy of packets being transmitted. However, existing failure recovery approaches do not handle the traffic engineering problem (e.g., tuning the routing-protocol parameters to optimize the rerouting traffic flow), which may cause serious congestions. Moreover, as the lack of QoS (quality of service) restrictions may lead to invalid rerouting traffic, the QoS requirements (e.g., bandwidth and delay) should also be taken into account when recovering the failed links. In this paper, we first develop a probabilistically correlated failure model that can accurately reflect the correlation between link failures, with which we can choose reliable backup paths (BPs). Then we construct a mathematical model for the failure recovery problem, which takes maximum rerouting traffic as the optimizing objective and the QoS requirements as the constraints. Moreover, we propose a heuristic algorithm for link failure recovery, which adopts the improved k shortest path algorithm to splice the single BP and supplies more protection resources for the links with higher priority. We also prove the correctness of the proposed algorithm. Moreover, the time and space complexity are also analyzed. Simulation results under NS2 show that the proposed algorithm improves the link failure recovery rate and increases the QoS satisfaction rate significantly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3946-3965
• /
• 2018

Network anomaly detection in Software Defined Networking, especially the detection of DDoS attack, has been given great attention in recent years. It is convenient to build the Traffic Matrix from a global view in SDN. However, the monitoring and management of high-volume feature-rich traffic in large networks brings significant challenges. In this paper, we propose a moving window Principal Components Analysis based anomaly detection and mitigation approach to map data onto a low-dimensional subspace and keep monitoring the network state in real-time. Once the anomaly is detected, the controller will install the defense flow table rules onto the corresponding data plane switches to mitigate the attack. Furthermore, we evaluate our approach with experiments. The Receiver Operating Characteristic curves show that our approach performs well in both detection probability and false alarm probability compared with the entropy-based approach. In addition, the mitigation effect is impressive that our approach can prevent most of the attacking traffic. At last, we evaluate the overhead of the system, including the detection delay and utilization of CPU, which is not excessive. Our anomaly detection approach is lightweight and effective.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.20 no.4
• /
• pp.13-27
• /
• 2021

In this study, the impact of traffic flow on the market penetration rate of autonomous vehicles(AV) was analyzed using the data for the year 2020 of the Yongin IC~Yangji IC section of Yeongdong Expressway. For this analysis, a microscopic traffic simulation model VISSIM was utilized. To construct the longitudinal control of the AV, the Intelligent Driver Model(IDM) was built and applied, and the driving behavior was verified by comparison with a normal vehicle. An examination of the study results of mobility and safety according to the market penetration rate of the AV, showed that the network's mobility improves as the market penetration rate increases. However, from the point of view of safety, the network becomes unstable when normal vehicles and AVs are mixed, so there should be a focus on traffic management for ensuring safety in mixed traffic situations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.1999-2007
• /
• 2010

Proxy Mobile IPv6(PMIPv6) is a network-based mobility management protocol and it does not require mobile node's involving in mobility management. In PMIPv6, the Mobile Access Gateway (MAG) incurs a high signaling cost to update the location of a mobile node to the remote Local Mobility Anchor (LMA) if it moves frequently. It may cause excessive signaling traffic and increase a high traffic load on LMA. Therefore, we propose a new mobility management scheme in proxy mobile IPv6 networks with dynamic paging support. To minimize signaling overhead, in our proposal, the size of the paging area is determined dynamically according the changes of mobility and traffic patterns of the mobile node. An analytic model is applied to determine the optimal size of the paging area. The cost analysis using fluid flow model presented in this paper shows that our proposal can achieve performance superior that of PMIPv6 scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3260-3268
• /
• 1999

As the proliferation of multimedia traffic over High-speed Internet increases, ATM network will be vital to adopt as backbone network over various parts of Internet. In this paper, we investigate the performance of TCP/IP traffic flow over ABR and UBR of ATM service to study for the high throughput and good fairness by simulation technique. Although TCP is run in the transport layer, it is controlled by several methods, e.g, EPD, PPD, RED, EFCI, ER etc, in ATM layer when TCP uses the ABR/UBR service. Therefore, if one cell is discarded in ATM layer, a packet of TCp will be laost. And, also, along with the increasing of the number of VC among switches, the throughput and fairness will be degraded. In order to improve these degradations, we propose the effective parameter control operations of EFCI and ER on ABR service, and also suggest the buffer management methods on UBR service. Finally, through the simulation results, the improved throughput and fairness are shown.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.49-62
• /
• 1998

In the ring loading problem, traffic demands are given for each pair of nodes in an undirected ring network with n nodes and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the Problem is to minimize the maximum load on the ring. In the ring loading problem with integer demand splitting, each demand can be split between the two directions and the flow routed in each direction is restricted to integers. Recently, Vachani et al. ［INFORMS J. Computing 8 (1996) 235-242］ have developed an Ο(n$^3$) algorithm for solving this integer version of the ring loading problem and independently, Schrijver et al. ［to appear in SIAM J. Disc. Math.］ have presented an algorithm which solves the problem with ｛0,1｝ demands in Ο（n$^2$｜K｜ ) time where K denotes the index set of the origin-desㅇtination pairs of nodes having flow demands. In this paper, we develop an algorithm which solves the problem in Ο(n ｜K｜) time.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.191-201
• /
• 2008

It has been employed TRANSYT-7F and NETSIM to evaluate the validity and effectiveness of improvement on TSM(Transportation Systems Management). But T7F is hard to describe platoon compression and dispersion in actually, and NETSIM takes a long time for network coding, calibration and have difficulty in setting up saturation flow. While Shockwave Model have advantage which can describe platoon compression and dispersion in actually and shorten hours, convenience of application. But Shockwave Model apply unrealistic traffic flow relation ship(U-K curve) and simplify platoon because of difficulty in calculating shockwave's position and cross. For solving limitation of existing shockwave models, It develop new model with 2-regime linear model, New platoon model, Extended shockwave, etc. For verifying the validity of the proposed model, it was compared with delay of T7F and NETSIM by offset variation. In conclusion, it is thought that proposed model have outstanding performance to simulate traffic phenomenon.