• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.710-721
• /
• 1999

In this paper, we have designed and implemented a parameter extraction system for analyzing Internet using SNMP. The extraction system has two modules; one is collection request module, and the other is analysis request module. The collection request module generates a polling script, which is used to collect management information from the managed system periodically. With this collected data, analysis request module extracts analysis parameters. These parameters are traffic flow analysis, interface traffic analysis, packet traffic analysis, and management traffic analysis parameter. For management activity, we have introduced two-step-analysis-view. One is Summary-View, which is used find out malfunction of a system among the entire managed systems. The Other is Specific-View. With this view we can analyze the specific system with all our analysis parameters. To show available data as indicators for line capacity planning, network redesigning decision making of performance upgrade for a network device and things like that.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.8
• /
• pp.907-913
• /
• 1999

For an automated transportation system like PRT(Personal Rapid Transit) system or IVHS, an efficient vehicle-merging algorithm is required for smooth operation of the network. For management of merging, collision avoidance between vehicles, ride comfort, and the effect on traffic should be considered. This paper proposes an unmanned vehicle-merging algorithm that consists of two procedures. First, a longitudinal control algorithm is designed to keep a safe headway between vehicles in a single lane. Secondly, 'vacant slot and ghost vehicle' concept is introduced and a decision algorithm is designed to determine the sequence of vehicles entering a converging section considering energy consumption, ride comfort, and total traffic flow. The sequencing algorithm is based on fuzzy rules and the membership functions are determined first by an intuitive method and then trained by a learning method using a neural network. The vehicle-merging algorithm is shown to be effective through simulations based on a PRT model.

• Journal of IKEEE
• /
• v.7 no.2 s.13
• /
• pp.127-134
• /
• 2003

Ad Hoc Networks, autonomous distributed network using routing scheme, does not operate properly owing to multi flow service when network load increases at specific network node. In this paper, we suggest traffic management routing protocol in Ad Hoc Network to reduce network traffic congestion and distribute network load in data transmission. Through test results of proposed algorithm under NS(Network Simulator)simulator environments . we acquired reduced network load and increased data transmission rate.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.599-617
• /
• 2006

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 the non-linear objective functions with the linear constraints. In the model, the flow-conservation constraints of the network are utilized to restrict the solution space and to force the link flows meet the traffic counts. The objective of the model is to minimize the discrepancies between the link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links and the link flows estimated through the traffic assignment using the path flow estimator in the legit-based SUE. In the proposed GA, a chromosome is defined as a vector representing a set of Origin-Destination Matrix (ODM), link flows and travel-cost coefficient. Each chromosome is evaluated from the corresponding discrepancy, and 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 is applied during the crossover and mutation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.4
• /
• pp.772-776
• /
• 2005

To support abruptly increasing data traffic in these days, network management is needed. And also to maintain the steady infra, there is MPLS need which can support traffic engineering. It's necessary that MPLS doesn't only manage network to support recently booming data traffic, but has capacity to support traffic engineering to keep static infrastructure. Traffic engineering, method that a large-scale user shifts traffic to the beforehand designated routes that pass through specific nodes on network, is operation that is mapping traffic flow to the physical network topology. In this paper, we supplement the defect of the traditional RSVP traffic engineering and to construct far more steady infra, we suggest the way of its development of ERSVP signaling protocol.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.105-108
• /
• 2005

To support abruptly increasing data traffic in these days. network management is needed. And also to maintain the steady infra, there is MPLS need which can support traffic engineering. It's necessary that MPLS doesn't only manage network to support recently booming data traffic, but has capacity to support traffic engineering to keep static infrastructure. Traffic engineering, method that a large-scale user shifts traffic to the beforehand designated routes that pass through specific nodes on network, is operation that is mapping traffic flow to the physical network topology. In this paper, we supplement the defect of the traditional RSVP traffic engineering and to construct far more steady infra, we suggest the way of its development of ERSVP signaling protocol.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.3
• /
• pp.65-77
• /
• 2001

Survivability of a network is one of the most important issues in designing present-day communication networks. the k-edge survivability of a given network is defined as the percentage of total traffic surviving the worst case failure of k edges. Although several researches calculated k-edge survivability on small networks by enumeration, prior research has considered how to calculate k-edge survivability on large networks. In this paper, we develop an efficient procedure to obtain lower and upper bounds on the k-edge survivability of a network.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.49-52
• /
• 2002

QoS support for the Internet traffic becomes an important future requirement of various network devices such as routers and switches. Differentiated Services(Diffserv) is considered as an efficient feasible solution for providing different service characteristics to different classes of network users. IETF Diffserv working group has already defined a general architecture of Diffserv and is extending its detail features. Network vendors also start implementing Diffserv enabled network devices. However, the management of Diffserv is not fully standardized yet. This paper, we present methods of traffic flow control in Diffserv Networks. we have designed a Diffserv Traffic Control system.

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

To address challenges of an unprecedented growth in mobile data traffic, the ultra-dense network deployment is a cost efficient solution to off-load the traffic over other small cells. However, the real traffic is often much lower than the peak-hour traffic and certain small cells are superfluous, which will not only introduce extra energy consumption, but also impose extra interference onto the radio environment. In this paper, an elastic energy efficient cell management scheme is proposed based on flow scheduling among multi-layer ultra-dense cells by a SDN controller. A significant power saving was achieved by a cell-level energy manager. The scheme is elastic for energy saving, adaptive to the dynamic traffic distribution in the office or campus environment. In the end, the performance is evaluated and demonstrated. The results show substantial improvements over the conventional method in terms of the number of active BSs, the handover times, and the switches of BSs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.1946-1958
• /
• 2011

Wireless Sensor Network (WSN) is made up of a number of sensor nodes and base stations. Traffic flow in WSN appears self-similar due to its data delivery process, and this impacts queue length greatly and makes queuing delay worse. Active queue management can be designed to improve QoS performance for WSN. In this paper, we propose self-similar traffic rate estimating algorithm named Power-Law Moving Averaging (PLMA) to regulate packet marking probability. This algorithm improves the availability of the rate estimation algorithm under the self-similar traffic condition. Then, we propose an adaptive Proportional Integral algorithm (SSPI) based on the estimation of the Self-Similar traffic rate by PLMA. Simulation results show that SSPI can achieve lower queue length jitter and smaller setting time than PI.