• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.19-31
• /
• 2016

A design method of the network for automated transporters mounted on rails is addressed for automated container terminals. In the network design, the flow directions of some path segments as well as routes of transporters for each flow requirement must be determined, while the total transportation and waiting times are minimized. This study considers, for the design of the network, the waiting times of the transporters during the travel on path segments, intersections, transfer points below the quay crane (QC), and transfer points at the storage yard. An algorithm, which is the combination of a modified Dijkstra's algorithm for finding the shortest time path and a queuing theory for calculating the waiting times during the travel, is proposed. The proposed algorithm can solve the problem in a short time, which can be used in practice. Numerical experiments showed that the proposed algorithm gives solutions better than several simple rules. It was also shown that the proposed algorithm provides satisfactory solutions in a reasonable time with only average 7.22% gap in its travel time from those by a genetic algorithm which needs too long computational time. The performance of the algorithm is tested and analyzed for various parameters.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.251-261
• /
• 2001

The traffic on the Internet has been growing exponentially for some time. This growth is beginning to stress the current-day routers. However, switching technology offers much higher performance. So the label switching network which combines IP routing with switching technology, is emerged. EspeciaJJy in the data driven label switching, flow classification and cache table management are needed. Flow classification is to classify packets into switching and non-switching packets, and cache table management is to maintain the cache table which contains information for flow classification and label switching. However, the cache table management affects the performance of label switching network considerably as well as flowclassification because the bigger cache table makes more packet switched and maintains setup cost lower, but cache is restricted by local router resources. For that reason, there is need to study the cache replacement scheme for the efficient cache table management with the Internet traffic characterized by user. So in this paper, we propose several cache replacement schemes for label switching network. First, without the limitation at switching capacity in the router. we introduce FIFO(First In First Out). LFC(Least Flow Count), LRU(Least Recently Used! scheme and propose priority LRU, weighted priority LRU scheme. Second, with the limitation at switching capacity in the router, we introduce LFC-LFC, LFC-LRU, LRU-LFC, LRU-LRU scheme and propose LRU-weighted LRU scheme. Without limitation, weighted priority LRU scheme and with limitation, LRU-weighted LRU scheme showed best performance in this paper.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.4
• /
• pp.552-558
• /
• 2002

Differentiated services (DiffServ) architecture defines a new framework for the support of quality of service (QoS) in IP-based networks. RIO has received the most attention among all the active queue management mechanisms proposed for assured service in DiffServ environment. The paper proposed the enhanced RIO which could alleviate the impact of flow's packet sire on the realized throughput. The simulation results indicate that this mechanism, when combined with TSW as traffic conditioner, provide better throughput assurance and fair distribution of excess bandwidth independent of packet size of flows in case of well-provisioned network environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.4
• /
• pp.575-581
• /
• 1998

In order to accommodate current accelerated growth in customers and traffic. Internet has faced the demand to scale its network dimension both in size and bandwidth, and new service provisioning. One way to solve this problem is to forward If packets based on ATM switching technology. This paper briefly explained technical tasks to apply this If switching technique in ATM networks for building Internet backbone, and presented the directions to approach these tasks. Those tasks are scalability, ATM VC setup and mapping between VC and IP packet flow, traffic management and traffic engineering, multicast, and finally ATM switch architecture to provide multiservice.

• Journal of Internet Computing and Services
• /
• v.22 no.2
• /
• pp.11-17
• /
• 2021

Software-defined networking provides a programmable and flexible way to manage the network by separating the control plane from data plane. However, the limited switch memory restricts the number of flow entries in the flow table used to forward packets. This leads to flow table overflow and flow entry reinstallation, which severely degrade the network performance. Therefore, this paper proposes a comprehensive policy for timely eviction of inactive flow entries to optimally maintain flow tables usage. In particular, statistics of user datagram protocol flow entries are periodically sampled to enable the inactive entries to be evicted early. Through traffic-based experiments, we found that the proposed system reduces the number of overflow occurrences and flow entries reinstallation compared to the random and FIFO policies.

• Journal of Internet Computing and Services
• /
• v.10 no.2
• /
• pp.65-73
• /
• 2009

IEEE802.11 Wireless LAN(WLAN) is being widely used in public space such as airport, and increases the networking boundary in campus and enterprise, and it has lastly attracted considerable attention for mesh network and converged network with other 3G mobile communication networks. In WLAN, load balancing among Access Points(AP) is an important issue for efficient resource management or supporting the Quality of Service(QoS) of traffic, but most researches focused on the AP selection in network entry or roaming of Stations(STA). In this paper, we propose an AP-Initiated Flow Redirection(FR) for AP load balancing by monitoring AP's availability in the true sense. When the AP's resource becomes almost saturated, that is used more than a specific threshold, the AP queries the roaming possible neighbor APs about their availability and calculates the distribution of traffic load with statistical methods such as entropy or chi-square. Finally, the AP decides flows and new APs for redirection and performs it. Our simulation results show that our FR mechanism increases the performance in the various views.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6A
• /
• pp.97-106
• /
• 2008

Quality of Protection(QoP) provides a standard that can evaluate networks offering protection. Also, QoP estimates stability of the system by quantifying intensity of the security. Security should be established based on the circumstance which applied to appropriate level, and this should chose a security policy which fit to propose of network because it is not always proportioned that between stability of security mechanism which is used at network and performance which has to be supported by system. With evolving wireless networks, a variety of security services are defined for providing secure wireless network services. In this paper, we propose a new QoP model which makes up for weak points of existing QoP model to choose an appropriate security policy for wireless network. Proposed new QoP model use objectively organized HVM by Flow-based Abnormal Traffic Detection Algorithm for constructing Utility function and relative weight for constructing Total reward function.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1472-1480
• /
• 2016

When disasters such as earthquake, flood, typhoon, fire and terrorism are occurred a video management system is required which can shoot video on the disaster site, and send it to a server located in the command center that can grasp at a glance the site conditions. In this paper, to know the performance elements information needed to construct the video management system. we presented a method of configuring an ad hoc network based on Wi-Fi direct communication. And we also evaluated the performance through built of environment for the video management system. The evaluated performance test items are 'packet flow tests according to the video compression ratios and the image sizes', 'packet flow tests according to the distance and traffic tests', 'packet flow tests according to whether LOS or not', and 'performance test of scenarios'.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.4
• /
• pp.666-677
• /
• 2015

The importance of application traffic analysis for efficient network management has been emphasized continuously. Snort is a popular traffic analysis system which detects traffic matched to pre-defined signatures and perform various actions based on the rules. However, it is very difficult to get highly accurate signatures to meet various analysis purpose because it is very tedious and time-consuming work to search the entire traffic data manually or semi-automatically. In this paper, we propose a novel method to generate signatures in a fully automatic manner in the form of sort rule from raw packet data captured from network link or end-host. We use a sequence pattern algorithm to generate common substring satisfying the minimum support from traffic flow data. Also, we extract the location and header information of the signature which are the components of snort content rule. When we analyzed the proposed method to several application traffic data, the generated rule could detect more than 97 percentage of the traffic data.

• Journal of Navigation and Port Research
• /
• v.28 no.4
• /
• pp.299-303
• /
• 2004

In the Internet, to guarantee transmission rate and delay and to achieve fair bandwidth allocation, many per-flow scheduling algorithms, such as fair queueing, which have many desirable properties for congestion control, have been proposed and designed. However, algorithms based on per-flow need maintain rate state, buffer management and packet scheduling, so that it cost great deal ： implement. Therefore, in this paper, to implement routers cost-effectively, we propose CS-FNE algorithm based on FNE in Core-Stateless network We evaluate CS-FNE comparing with four additional algorithms i.e., CSFQ, FRED, RED and DRR, in several different, configurations and traffic sources. Through simulation results, we show that CS-FNE algorithm can allocate fair bandwidth approximately and is simpler and easier to implement than other per-flow basis queueing mechanisms.