• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.612-620
• /
• 2011

Recently, one of the problems with the Internet is the issue of scalability. To this end, locator/identifier separation protocol (LISP), which separates end-system identifiers and routing locators, has been proposed as a solution. In the LISP deployed network, the ingress and egress nodes of inter-AS traffic is determined by edge router selection (ERS) and endpoint identifier-routing locator mapping assignment (ERMA). In this paper, joint optimizations of ERS and ERMA for stub networks with and without predetermined link weights are studied and the mixed integer linear programming (MILP) formulations for the problems are given. To make the problem with optimizable link weights tractable, a revised local search algorithm is also proposed. Simulation results show that joint optimization of ERS and ERMA enables better network performance.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.399-405
• /
• 2002

Now days, it is based on GIS and GPS, it can search for the shortest path and estimation of arrival time by using the internet and cell phone to driver. But, even though good car navigation system does not create which is the shortest path when there average vehicle speed is 10 -20 Km. Therefore In order to reduce vehicle waiting time and average vehicle speed, we suggest optimal green time algorithm using fuzzy adaptive control , where there are different traffic intersection length and lane. In this paper, it will be able to forecast the optimal traffic Information, estimation of destination arrival time, under construction road, and dangerous road using internet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7C
• /
• pp.664-669
• /
• 2002

In this paper, we propose the fuzzy control algorithm for effective buffer control to connected traffic in ATM networks. The proposed Fuzzy control algorithm has two priorities and uses Fuzzy sets to search for dynamic thresholds. In this words, the difuzzification value controls the threshold in the buffer to according to traffic priority (low or high) using fuzzy set theory for traffic connected after reasoning. Performance analysis result: it was confirmed that with the proposed scheme, performance improves at cell loss rate, when compared with the existing PBS scheme.

• The Journal of the Korea Contents Association
• /
• v.21 no.8
• /
• pp.10-19
• /
• 2021

In CCVN, the existing content search and delivery protocols based on single-hop or multi-hop cause low content search ratio and high network traffic overhead. This paper proposes a RSU-based protocol for efficient content search and delivery. In the proposed protocol, an RSU chooses the candidate provider vehicle that provides the cost-minimized content delivery to the content requester vehicle. Simulation results verify that the proposed protocol achieves better performances.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1681-1688
• /
• 2006

GIS systems have gradually been utilized in life information as well as special businesses such as traffic, sight-seeing, tracking, and disaster services. Most GIS services focus on showing stored information on maps, not providing a service to register and modify their preferred information. In this paper, we present a new method which reduces DXF map data into Simple Geographic Information File format using format conversion algorithms. We also present the prototype implementation of a GIS search system based on ontologies to support associated information. Our contribution is to propose a new digital map format to provide a fast map loading service and individual customized information on the map service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.3
• /
• pp.360-371
• /
• 1993

Flood search algorithm is known to be an effective routing mechanism for tactical application, since it provides high degree of survivability and robustness. But it is known that it has significant drawbacks with respect to the network efficiency [1]. We consider a tactical circuit-switched grid network with a maximum of four links and two priority classes of voice traffic, Using the minimum first-derivative length (MFDL) path, we improve the blocking probability performance of the circuit-switched network without increasing the call set-up time and processor loading of the algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1311-1326
• /
• 2010

Peer-to-peer (P2P) networks consume the most bandwidth in the current Internet and file sharing accounts for the majority of the P2P traffic. Thus it is important for a P2P file sharing application to be efficient in bandwidth consumption. Bandwidth consumption as much as downloaded file sizes is inevitable, but those in file search and bad downloads, e.g. wrong, corrupted, or malicious file downloads, are overheads. In this paper, we target to reduce these overheads even in the presence of high volume of malicious users and their bad files. Sybil attacks are the example of such hostile environment. Sybil attacker creates a large number of identities (Sybil nodes) and unfairly influences the system. When a large portion of the system is subverted, either in terms of the number of users or the number of files shared in the system, the overheads due to the bad downloads rapidly increase. We propose ELiSyR, a file search protocol that can tolerate such a hostile environment. ELiSyR uses social networks for P2P file search and finds benign files in 71% of searches even when more than half of the users are malicious. Furthermore, ELiSyR provides similar success with less bandwidth than other general efforts against Sybil attacks. We compare our algorithm to SybilGuard, SybilLimit and EigenTrust in terms of bandwidth consumption and the likelihood of bad downloads. Our algorithm shows lower bandwidth consumption, similar chances of bad downloads and fairer distribution of computation loads than these general efforts. In return, our algorithm takes more rounds of search than them. However the time required for search is usually much less than the time required for downloads, so the delay in search is justifiable compared to the cost of bad downloads and subsequent re-search and downloads.

• Journal of Korean Society of Transportation
• /
• v.14 no.1
• /
• pp.51-67
• /
• 1996

The optimal path-finding problem becomes complicated when multiple variables are simultaneously considered such as physical route length, degree of congestion, traffic capacity of intersections, number of intersections and lanes, and existence of free ways. Therefore, many researchers in various fields (management science, computer science, applied mathematics, production planning, satellite launching) attempted to solve the problem by ignoring many variables for problem simplification, by developing intelligent algorithms, or by developing high-speed hardware. In this research, an integration of expert system technique and case-based reasoning in high level with a conventional algorithms in lower level was attempted to develop an optimal path-finding system. Early application of experienced driver's knowledge and case data accumulated in case base drastically reduces number of possible combinations of optimal paths by generating promising alternatives and by eliminating non-profitable alternatives. Then, employment of a conventional optimization algorithm provides faster search mechanisms than other methods such as bidirectional algorithm and $A^*$ algorithm. The conclusion obtained from repeated laboratory experiments with real traffic data in Seoul metropolitan area shows that the integrated approach to finding optimal paths with consideration of various real world constraints provides reasonable solution in a faster way than others.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1421-1435
• /
• 2004

When various work was given from user, the existing mobile agent model migrated from node to node and process the work at the point that much traffics according to passive routing schedule are happened, until it makes service the work result, time cost of round work process for the distributed nodes are increased. Therefore, the existing agent systems need migration method to solve the problems of agent size increment or a lack of interoperability among agent systems. To solve these problems in this thesis, we design and implement an CORBA-based Mobile Agent Model(CMAM) for the efficient work process into the distributed nodes, when the mobile agents are migrated among the nodes, using an optimal path search by sensing of network traffic.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2016.05a
• /
• pp.285-286
• /
• 2016

We aim to propose the prediction modeling method of ship's position with extracting ship's trajectory model through pattern recognition based on the data that are being collected in VTS centers at real time. Support Vector Machine algorithm was used for data modeling. The optimal parameters are calculated with k-fold cross validation and grid search. We expect that the proposed modeling method could support VTS operators' decision making in case of complex encountering traffic situations.