• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.169-175
• /
• 2011

This paper addresses mobile IP router which communicate between nodes in Ad Hoc network as well as supply attachment to outer Internet. Ad Hoc network is one which exchanges information through cooperations among nodes without wire infrastructure, mobile IP router considers the network as one mobile unit, and supports Internet connection in mobile as well as fixed spaces. Therefore, this router can accommodate the routing of Ad Hoc network, and provide nodes in Ad Hoc network with Internet connection. So mobile IP router can provide Ad-Hoc terminals with the diverse wireless services, such as Internet connection service, routing, mobility, and so on.

• 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.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.799-802
• /
• 1999

In this paper, programmable abstractions of the underlying resources of the IP router are proposed for designing a software architecture of the next generation router, which can provide the variety of QoS services and reliable and complicate network services.

• Journal of Science and Technology Studies
• /
• v.10 no.1
• /
• pp.73-106
• /
• 2010

Internet users want to use IP sharing routers for reducing their cost and managing their terminals easy. Network service providers(NSPs) forced their subscribers pay extra charges to use extra terminal like IP router, since 1998 in Korea. The NSPs asserted that IP sharing routers would harm their networks or would impose extra load on their networks, but they were unable to prove their assertion. Users and manufacturing companies insisted on the legitimacy of IP routers, because the IP router is a kind of terminal for end-users, and as such, the right of selection of an IP router belongs to the user. The interest in and beliefs of the relevant social groups about IP router will be deduced through their interpretation. It draws the technological frame of two social groups, NSPs and IP router-manufacturing companies. The rough struggle between two social groups come from their frames. The article shows how society constructs a particular information technology.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.223-226
• /
• 2003

The best way in order to protect the system resource front Distributed Denial of Service(DDoS) attack is cut off the source of DDoS attack with path retracing the packet which transferred by attacker. Packet marking method can not use ICMP cause by using IP identifier field as marking field. And in case of increasing the number of router, retracing method using router ID has the size of marking field's increasing problem. In this paper, we propose that retracing method can be available the ICMP using marking field for option field in IP header and the size of making Held do not change even though the number of router is increased using the mark information which value obtained through XOR operation on IP address.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.603-614
• /
• 2005

The wireless LAN environment using Mobile IP is constructed and managed to be connected with Ethernet based wired networks. However, there have been many problems with wireless networks using Mobile IP. Some important facts on network performance have not been considered when introducing wireless LAN by Mobile IP to wired networks. In this paper, we suggest schemes which can solve problems on Handover latency caused by the asymmetrical connectivity of the Access Router at applying the HMIPv6 and on binding updates due to the MN frequent movement. Our proposed schemes can reduce network latency by using the HMIPv6 architecture with a virtual router layer, and reduce communication overhead by interchanging information of the MN movement between routers. Our schemes are expected to assist in constructing a more real and effective wireless LAN environment based on the HMIPv6 and FMIP.

• The KIPS Transactions:PartA
• /
• v.10A no.5
• /
• pp.453-462
• /
• 2003

IP address lookup of router searches and decide proper output link using destination address of IP packet that arrie into router. The IP address lookup is essential part in te development of high-speed router needed to high-speed backbone network as one of bottleneck of router performance. This paper introduces DTC data structure that can support gigabit IP address lookup by dynamic trie compression technique that just uses small memory in conventional Pentium CPU. When make a forwarding table by trie compression, the DTC can dynamically select a size of data structure with considering correlation between table's size and searching speed. Also, when compress the prefix trie, DTC makes IP address lookup on the forwarding table of a search on the high speed SRAM cache by minimizing the size of data structure reflecting the structure of the trie. In the experiment result, the DTC data structure recorded performance of maximum $12.5{\times}10^5$ LPS (lookup per second) in conventional Pentium CPU through a dynamic building of most suitable compression over variety of routing tables.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.105-108
• /
• 1999

In this paper, we define the high-speed router as a router, which can support aggregated ports over 25Gbps, and provide issues and trends in high-speed router design. We propose design considerations on IP packet forwarding, switching fabric, packet scheduling and buffer management, network resource reservation, and router operation and administration.

• Proceedings of the IEEK Conference
• /
• 2002.06e
• /
• pp.83-86
• /
• 2002

In this paper while a router is routing all packet to the next hop, it inspects whether there is congestion on this current hop router or not and if the router discovers that it has some congestion, it informs that the packet is experienced to congestion. The packet arrived to next hop including some information about the congestion is processed first and it has wider bandwidth than another packet The amount of congestion is recorded to the DS field of IP header by congestion experience level. In the next hop when the packet including the congestion information is routed, the standard packet dropping ratio of the current router is changed in proportion to congestion experience that is recorded in IP header on of that. When the packet that has experienced congestion before is arrived, the router extends the drop threshold value not to drop the packet. It mean that transferring the audio or video stream, if the packet is already experienced the congestion in another hop, the router can provide the better service quality about 15∼25% than another.

• The Journal of the Korea Contents Association
• /
• v.7 no.3
• /
• pp.50-59
• /
• 2007

IP address lookup is one of the most important and complex functions in the router. In this paper, we propose an improved technique of LC-trie to increase the performance of IP address lookup in the high performance router. We effectively apply the prefix pruning method, which is used for the compression of the forwarding table in TCAM((Ternary Content Addressable Memory), to the LC-trie. This technique can decrease the number of memory accesses and upgrade the lookup speed. Moreover, through the real forwarding table and the real traffic distribution, we evaluate the performance of our scheme in terms of the lookup time and the number of memory access, comparing with that of the previous LC-trie.