• Journal of Information Technology Applications and Management
• /
• v.10 no.2
• /
• pp.61-71
• /
• 2003

Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

• Speech Sciences
• /
• v.12 no.2
• /
• pp.183-191
• /
• 2005

This paper describes the automated call routing for call center system based on speech recognition. We focus on the task of automatically routing telephone calls based on a users fluently spoken response instead of touch tone menus in an interactive voice response system. Vector based call routing algorithm is investigated and normalization method suggested. Call center database which was collected by KT is used for call routing experiment. Experimental results evaluating call-classification from transcribed speech are reported for that database. In case of small training data, an average call routing error reduction rate of 9% is observed when normalization method is used.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.12
• /
• pp.1-8
• /
• 1994

In this paper, we hve compare the performance of DAR(Dynamic Adaptive Routing) with that of FSR(Flooding Search Routing) to select an adequate routing protocol in circuit-switched networs. As a performance factor, we have considered call setup time, which is the key factor of performance evaluation in circuit switched networks. We have evaluated the performance of two methods in grid topology circuit-switched networks using a commn channel signaling scheme, as application examples. As results, FSR method shows better performance than DAR method under light traffic load, when the number of links by which call has passed increases, but DAR method represents better performance than FSR method under heavy traffic load or large networks because of redundant packets.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.1
• /
• pp.1-6
• /
• 2005

Channel routing is a problem assigning each net to a track after global routing and minimizing the track that assigned each net. In this paper we propose a genetic algorithm searching solution space for 4-layer channel routing problem. We compare the performance of proposed genetic algorithm(GA) for channel routing with that of other 4-layer channel routing algorithm by analyzing the results of each implementation.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.202-214
• /
• 2003

The central challenge in the design of ad-hoc networks is the development of dynamic routing protocol that efficiently finds route between mobile nodes. Several routing protocols such as DSR, AODV and DSDV have been proposed in the literature to facilitate communication in such dynamically changing network topology. In this paper, a Node Transition Probability (NTP) based routing algorithm, which determines stable routes using the received power from all other neighboring nodes is proposed. NTP based routing algorithm is designed and implemented using Global Mobile Simulator (GloMoSim), a scalable network simulator. The performance of this routing algorithm is studied for various mobility models and throughput, control overhead, average end-to-end delay, and percentage of packet dropped are compared with the existing routing protocols. This algorithm shows acceptable performance under all mobility conditions. The results show that this algorithm maximizes the bandwidth utilization during heavy traffic with lesser overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2203-2217
• /
• 2016

To prevent structured peer to peer (P2P) overlay networksfrom being attacked by malicious nodes, a symmetric lookup-based routing algorithm referred to as Symmetric-Chord is proposed in this paper. The proposed algorithm determines the precision of routing lookup by constructing multiple paths to the destination. The selective routing algorithm is used to acquire information on the neighbors of the root. Authenticity of the root is validated via consistency shown between the information ascertained from the neighbors and information from the yet-to-be-verified root, resulting in greater efficiency of resource lookup. Simulation results demonstrate that Symmetric-Chordhas the capability of detecting malicious nodes both accurately and efficiently, so as to identify which root holds the correct key, and provides an effective approach to the routing security for the P2P overlay network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2379-2397
• /
• 2017

Content distribution technology, which routes content to the cache servers, is considered as an effective method to reduce the response time of the user requests. However, due to the exponential increases of content traffic, traditional content routing methods suffer from high delay and consequent inefficient delivery. In this paper, a content selection policy is proposed, which combines the histories of cache hit and cache hit rate to collaboratively determine the content popularity. Specifically, the CGM policy promotes the probability of possible superior paths considering the storage cost and transmission cost of content network. Then, the content routing table is updated with the proportion of the distribution on the paths. Extensive simulation results show that our proposed scheme improves the content routing and outperforms existing routing schemes in terms of Internet traffic and access latency.

• Journal of the Korea Society for Simulation
• /
• v.9 no.3
• /
• pp.91-102
• /
• 2000

The distribution routing problem is one of the important problems in distribution and supply center management. This research is concerned with an integrated distribution routing problem for multi-supply centers based on improved genetic algorithm and GUI-type programming. In this research, we used a three-step approach; in step 1 a sector clustering model is developed to transfer the multi-supply center problem to single supply center problems which are more easy to be solved, in step 2 we developed a vehicle routing model with time and vehicle capacity constraints and in step 3, we developed a GA-TSP model which can improve the vehicle routing schedules by simulation. For the computational purpose, we developed a GUI-type computer program according to the proposed methods and the sample outputs show that the proposed method is very effective on a set of standard test problems, and it could be potentially useful in solving the distribution routing problems in multi-supply center problem.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.4
• /
• pp.142-151
• /
• 1996

This paper presents a new symmetrical routing architecture for FPGA and an efficient routing algorithm for the architecture. The routing architecture adopts the segmented wires and the improved switch modules. Segmetned wires construct routing channels which pass through the chip in vertical and horizontal directions. To maximize the utility of a track, a track in each switch module can be separated in two part using a programmable switch to route two different net. The proposed routing algorithm finds all assignable tracks for a given net and selects the best track from assignable tracks to minimize the number of programmable switches and the unused portion of the wire segments. In order to stabilize the perfomrance of the algorithm, the routing order is defined by weighted sum of the number of wire segment, the length of wire segmetn, and the number of pin. Experimental results show that routability is improved dramatically and the number of crossing switches are reduced about 40% compared with the previous works.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.2
• /
• pp.28-34
• /
• 2008

This paper reports the problem in the previous routing protocol, EAR, and proposes an energy aware routing protocol to solve the problem in it. Proposed routing protocol considers the number of hops, the possibility of node exhaustion, and the node energy amount at the same time from the source to the sink. Thereby, it could efficiently solve the potential network separation problem and the sensing hole problem in EAR. Proposed routing protocol could remove the problems in the previous routing protocols but it still gets the advantages in them.