• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.374-382
• /
• 2001

Nowadays, the commonly used table lookup scheme for IP routing is based on the sc-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, this complicates the IP lookup. Currently, this process is mainly performed in software and several schemes hale been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the new generation routers, in this article we investigate the properties of the routing table and present a new approach for IP lookups, our approach is not based Gn BMP and significantly reduces the complexity, thus the computation cast of existing schemes can be significantly reduced. We also propose an efficient IP lookup algorithm, with which we improve the binary search on prefixes to 30 millions of packets per second (MPPS) and 5,000 route updates/s under the same experiment setup with an even larger routing table.

• International journal of advanced smart convergence
• /
• v.5 no.3
• /
• pp.47-55
• /
• 2016

Router main task is to provide routing of Internet Protocol (IP) packets. Routing is achieved with help of the IP lookup. Router stores information about the networks and interfaces in data structures commonly called as routing tables. Comparison of IP from incoming packet with the IPs stored in routing table for the information about route is IP Lookup. IP lookup performs by longest IP prefix matching. The performance of the IP router is based on the speed of prefix matching. IP lookup is a major bottle neck in the performance of Router. Various algorithms and data structures are available for IP lookup. This paper is about reviewing various tree based structure and its performance evaluation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.728-735
• /
• 2003

It is a mainly issue that provide mobility smoothly in Mobile IP networks. The IP mobility support being standardized in the IETF utilized tunneling of IP packets from a home agent to foreign agent and utilized reverse tunneling of IP packets from foreign agent to home agent. In this paper, We propose that solve the triangular routing problem in IP mobility and that lessen the messages about IETF routing optimization. Through the Mobile Routing Table on the edge router, agent process the message instead of a end node when handoff occur and that lessen the routing path length by sending directly from FA to to Correspond Node's router. This action lessen the message occurrence frequency and the packet drop. We compare the standard IP, Routing Optimization of Mobile IP, Wu's method and the proposed algorithm. Finally, the simulation results are presented.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1408-1414
• /
• 2008

Development of internet and IP network technology creates various fusion services such as IPTV, VoIP and so on. Next generation IPv6 which will solve lack of IP is very important on IPTV which needs best quality of service about security, QoS and bandwidth. In this paper, we suggest a routing protocol standard in which we can service best quality of image using PSNR which is most commonly used as a measure of quality of reconstruction in image on IPv6 network.

• Journal of the Korea Society for Simulation
• /
• v.12 no.3
• /
• pp.55-68
• /
• 2003

As mobile IP has been suggested only to support mobility of mobile station(MS) by which it dose nothing but guarantee MS's new connection to the network, it is for nothing in Quality of Service(QoS) after handoff of MS. QoS is very important factor in mobile IP network to provide multimedia applications and real-time services in mobile environment, and it is closely related to handoff delay Therefore as a main issue in mobile IP research area, handoff delay problem is actively studied to guarantee and promote QoS. In this paper, in order to resolve such a problem, we suggest Simple Network Management Network(SNMP) information-based routing that adds keyword management method to information-based routing in active network, and then propose QoS controlled handoff by SNMP information-based routing. After setting up routing convergence time, modeling of suggested method and existing handoff method is followed in order to evaluate the simulations that are carried out with NS-2. The result of simulation show the improvement of handoff delay, and consequently it turns off the QoS has been improved considerably.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.602-611
• /
• 2011

The inter-domain routing scalability issue is a major challenge facing the Internet. Recent wide deployments of multihoming and traffic engineering urge for solutions to this issue. So far, tunnel-based proposals and compact routing schemes have been suggested. An implicit assumption in the routing community is that structured address labels are crucial for routing scalability. This paper first systematically examines the properties of identifiers and address labels and their functional differences. It develops a simple Internet routing model and shows that a binary relation T defined on the address label set A determines the cardinality of the compact label set L. Furthermore, it is shown that routing schemes based on flat address labels are not scalable. This implies that routing scalability and routing stability are inherently related and must be considered together when a routing scheme is evaluated. Furthermore, a metric is defined to measure the efficiency of the address label coding. Simulations show that given a 3000-autonomous system (AS) topology, the required length of address labels in compact routing schemes is only 9.12 bits while the required length is 10.64 bits for the Internet protocol (IP) upper bound case. Simulations also show that the ${\alpha}$ values of the compact routing and IP routing schemes are 0.80 and 0.95, respectively, for a 3000-AS topology. This indicates that a compact routing scheme with necessary routing stability is desirable. It is also seen that using provider allocated IP addresses in multihomed stub ASs does not significantly reduce the global routing size of an IP routing system.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.127-132
• /
• 1999

A mobile IP is proposed to support host mobility over the current Internet. One of the most important issues on the host mobility is location and routing schemes that allow mobile hosts to move effectively from one site to another. In a Mobile IP environment, frequent handoffs are likely to degrade the performance by minimizing the loss of datagrams during handoffs. The handoff scheme is using routing optimization and binding extension to improve the performance by minimizing the average transfer delay of messages and packet loss. Simulation details show the improvement of transport delays and packet loss rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.1
• /
• pp.65-73
• /
• 2004

In this paper, we propose a tunnel establishment scheme using Next Hop Resolution Protocol over mobile IP networks, which consist of LAN-based IP networks and ATM-based IP networks. As a basic idea, we use the shortest path algorithm to establish a short-cut tunnel between HA and FA. Also, we classify methods for establishing a short-cut tunnel into four cases considering the locations of HA, FA, CN and MN. To confirm the advantages of our schemes, which deliver packets using short-cut tunnel in optimized path method over mobile IP networks, we performed mathematical analysis and simulation, compared proposed schemes with existing IP routing method in terms of transmission delay between CN and MN. The simulation results show that our scheme have superior performance to that of existing IP routing mechanism, because the store-and-forward delay which occurred in IP routing mechanism is considerably reduced in short-cut tunnel over ATM networks.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.06a
• /
• pp.61-66
• /
• 2003

Mobile IP has been designed only to maintain communication as they move form place to place, so it doesn't guarantee Quality of Service(QoS). QoS in mobile IP is important to provide multimedia and real-time applications services in mobile, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to guarantee QoS as a main issue in mobile IP research area Next generation Mobile IPv6 resolve this problem somewhat, triangle problem for first packet and handoff delay still remain. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-Based routing. After modeling of suggested method and existing handoff method simulations we carried out with NS-2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.873-889
• /
• 2014

IP address lookup is very crucial in performance of routers. Several works have been done on prefix caching to enhance the performance of IP address lookup. Since a prefix represents a range of IP addresses, a prefix cache shows better performance than an IP address cache. However, not every prefix is cacheable in itself. In a prefix cache it causes false hit to cache a non-leaf prefix because there is possibly the longer matching prefix in the routing table. Prefix expansion techniques such as complete prefix tree expansion (CPTE) make it possible to cache the non-leaf prefixes as the expanded forms, but it is hard to manage the expanded prefixes. The expanded prefixes sometimes incur a great deal of update overhead in a routing table. We propose a bitmap-based prefix cache (BMCache) to provide low update overhead as well as low cache miss ratio. The proposed scheme does not have any expanded prefixes in the routing table, but it can expand a non-leaf prefix using a bitmap on caching time. The trace-driven simulation shows that BMCache has very low miss ratio in spite of its low update overhead compared to other schemes.