Samsung Electronics Co., Ltd.

Yonsei University

Byung-Gu Choe

Yong-Seok Park

Byung-Chang Kang

Byoung-Chul Kim

Jong-Sang Oh

Kang-Young Moon

Se-Woong Moon

Young-Keun Park

Jae-Hoon Lee

Dong-heon Lee

Eun-Young Park

Su-hyun Kim

Bong-Cheol Kim

Eun-Sook Ko

Kil-lyeon Kim

Jae-Hwoon Lee

Hyoung-Joon Park

An apparatus adapted to transmit and receive a packet between a network processor and a packet controller includes: the packet controller receiving an input packet from an input interface; a packet buffer storing and delivering the input packet the received input packet in response to a request from the network processor; a packet queue delivering information for the stored input packet from the packet controller to the network processor; and the network processor receiving a packet from the packet buffer and delivering the packet to an output interface using information for the input packet from the packet queue.

Transmitting packets between packet controller and network processor

Managing a Transmission Control Protocol (TCP) connection established between two applications includes providing a TCP/IP (Internet Protocol) kernel adapted to: store establishment information of the TCP connection and an established value for a TCP session connectivity check with respect to the TCP connection; create a Session Connectivity Check (SCC) message according to the establishment information and established value; transmit the SCC message to a TCP/IP kernel of another party, and determine whether or not the TCP connection is operating normally according to whether an SCC response message has been received from the TCP/IP kernel of the another party.

Managing transmission control protocol (TCP) connections

A method for managing forwarding information in a router having a distributed architecture with a plurality of routing nodes. Forwarding information is dynamically aggregated, or disaggregated, in response to an addition or a deletion of forwarding information, so that the size of the forwarding tables managed by the routing nodes of the router are reduced. The transmission of control packets being transmitted to update the forwarding tables is reduced; consequently internal traffic is also reduced.

Dynamic management method for forwarding information in router having distributed architecture

Managing network information in Access Routers (ARs) includes: communicating with neighboring Access Routers (ARs) to obtain information of each of the ARs and Access Points (APs) belonging to a subnet of a relevant AR; storing the information of the ARs and APs in a database; and performing a communication network service in accordance with the information stored in the database. Desired information can be shared without a need for adding any separate element to the network architecture. In addition, because a Candidate Access Router (CAR) table is generated during the operation of the Open Shortest Path First (OSPF), the AR immediately responds to the information requested by a mobile node so as not to increase a handoff delay and so as to reduce a burden of the mobile node.

Managing network information in access routers (ARs)

An apparatus for controlling traffic congestion includes: a transmitting processor including a packet classifying unit adapted to classify packets to be processed in a receiving processor and packets to be forwarded via the transmitting processor, the transmitting processor and the receiving processor having different traffic processing speeds; a buffer adapted to store the packets to be forwarded from the packet classifying unit to the receiving processor; and the receiving processor including a token driver adapted to output the packets stored in the buffer in accordance with a token bucket algorithm in response to an interrupt signal of the transmitting processor and to transmit the packets to a corresponding application, and a monitoring unit adapted to analyze and monitor a resource occupancy rate and a traffic characteristic used by the token driver to set an amount of tokens.

Controlling traffic congestion

An IP address look-up device is for looking up an IP address of an IP packet in order to forward the IP packet. The device includes a ternary CAM including pairs of data string and mask string, with the data string having a prefix of an IP address and the mask string representing a length of the prefix, and having routing entries stored in physical segments, respectively, without regard to order of prefix length, the ternary CAM functioning to compare a search key as a destination address of the IP packet to be forwarded, with the routing entries, set a match line of a matching routing entry, and output a mask string of the matching routing entry; and a priority encoder functioning to compare prefix lengths of mask strings outputted in correspondence to set match lines when at least one match line is set in the ternary CAM, determine, as an LPM entry, a routing entry corresponding to a longest mask string, and output a physical address of the LPM entry on the basis of a match line of the LPM entry.

Internet protocol address look-up device

A distributed router able to reduce occurrence of ping-pong of data and information packets within the architecture of the distributed router constructed with a main processor, a plurality of line connection units and a switching unit, is disclosed. The main processor manages a routing table, updates the routing table, and broadcasts the changes in routing information that are received. The switching unit switches packets either to the main processor or to the respective line connection units. A plurality of forwarding tables are positioned in different corresponding ones of the plurality of line connection units, to copy, store and manage a part of the routing table. A plurality of forwarding processors are positioned in different corresponding ones of the plurality of line connection units, to transmit each packet to an output port, to determine whether the output port of a packet received from the switching unit is connected to either an external router or the switching unit, and to transmit each packet to the external router when the output port is connected to the external router, and discard any packet when the output port is connected to the switching unit.

Distributed router with ping-pong preventing function and ping-pong preventing method using the same

In allocating bandwidth using a Resilient Packet Ring (RPR) fairness mechanism in a node connected to an RPR network, when congestion occurs, an amount of traffic that the node has transmitted to a ring during one aging interval is stored together with its own identifier in a fairness message as a fairness transmission rate to be advertised to its own upstream nodes. The amount of traffic transmitted from the upstream node during the aging interval is measured and stored. When the congestion has been solved, an available bandwidth is calculated with reference to the fairness transmission rate and the amount of traffic transmitted from the upstream nodes, and the fairness transmission rate is calculated to fairly allocate the available bandwidth to the upstream nodes so that the fairness transmission rate is transmitted to the upstream nodes.

Allocating bandwidth using resilient packet ring (RPR) fairness mechanism

In an apparatus for distributively processing a border gateway protocol (BGP) and a method thereof, a central processing unit does not process all tasks for processing the BGP, and distributed BGP processing units are formed in the central processing unit so that each distributed BGP processing unit manages TCP sessions with external BGP routers belonging to the distributed BGP processing unit. Information is internally transmitted in the distributed BGP processing units using a multicast scheme and a broadcast scheme so that loads can be distributed. The apparatus comprises a number of BGP routers existing externally, a BGP router corresponding to a server, and a number of distributed BGP processing units in the BGP router. The distributed BGP processing units only manage the BGP routers connected directly to each distributed BGP processing unit in accordance with an operator's policy. When each distributed BGP processing unit receives update information from the external BGP routers connected directly to it, it performs a filtering function for deciding whether or not a route is to be transmitted in accordance with an INPUT policy, a route-map function for a transmission path mapping, and a damping function for deciding whether or not the update information is to be transmitted in accordance with a threshold value when flapping occurs.

Apparatus for distributively processing BGP and method thereof

A routing table management method using an interface ID in the IPv6 that supports RIPng (Routing Information Protocol for next generation), prevents congestion in routing table management because multiple addresses are designated to a single interface, through managing a routing table using a different interface ID for each IPv6 router interface. According to the routing table management method, a first router designates a predetermined value to a first field of a route entry, designates an interface ID to a second field, thereby generating routing information, and a routing information packet including the routing information is transmitted to a second router. Then, the second router extracts a first field value of the received routing information packet from the first router and if the extracted field value is a predetermined value, a second field value is extracted therefrom. Lastly, routing information of a route entry having an interface ID identical with the extracted second field value is updated to routing information of the received routing information packet.

Routing table management method using interface ID in the IPv6

Processing broadcast data in a mobile Ad-hoc network includes: determining if all of the broadcast packets have been received using a Latest Broadcast Count Number (NBC) stored in a neighbor table within a buffer of a pertinent node and Broadcast Count Number (BC) contained in the broadcast packets received from a transmitting node upon receipt of broadcast packets transmitted from the transmitting node. The Broadcast Count Number (BC) of the received broadcast packet is compared with a buffer size of the pertinent node if all of the broadcast packets transmitted from the transmitting node have been received. A hello packet for flushing a buffer of the transmitting node is generated and transmitted to the transmitting node, the buffer of the pertinent node is flushed, and the neighbor table of the flushed buffer is updated, if the Broadcast Count Number (BC) of the received broadcast packet exceeds the buffer size.

Relaying broadcast packet in a mobile Ad-hoc network including flushing buffer if broadcast count number exceed buffer size

A method for monitoring traffic in a packet switched network. The packet switched network includes connections grouped in a single group; token buffers for respectively corresponding to the connections, and storing tokens generated at a predetermined token generation rate by the corresponding connection; a shared token pool for being shared among the connections, and storing the generated tokens therein when each token buffer of each connection is over a predetermined maximum size; and counters for respectively corresponding to the connections, and counting tokens stored in the shared token pool by a corresponding connection. The method for monitoring traffic in the packet switched network includes the steps of: a) providing data buffers for respectively corresponding to the connections and storing a packet of a contract-following connection in case of a temporary deficiency of a network resource; b) if a token buffer of a corresponding connection is over a predetermined maximum size and the shared token pool is over its own predetermined maximum size, storing tokens generated during a token generation time in the shared token pool, and controlling a count value of a corresponding counter; c) checking the count value of the corresponding counter, and selectively controlling a permitted buffer size of a data buffer of a corresponding connection upon receiving the checking result of the count value of the corresponding counter; and d) checking a token buffer of a corresponding connection and a shared token pool if a packet reaches the corresponding connection or is present in a data buffer of the corresponding connection, and selectively storing a received packet in a corresponding data buffer according to a count value of a corresponding counter if there is no token in the token buffer of the corresponding connection and the shared token pool.

Method for monitoring traffic in packet switched network

An Internet Protocol address look-up method for looking up an Internet Protocol address of an Internet Protocol packet in order to forward the Internet Protocol packet uses a ternary content addressable memory (CAM) which has routing entries, each including a pair of data strings having a prefix of an Internet Protocol address and a mask string representing a length of the prefix, which compares a search key as a destination address of the Internet Protocol packet to be forwarded with the routing entries, which sets a match line of a matching routing entry, and which outputs a mask string of the matching routing entry. The method comprises the steps of: comparing prefix lengths of mask strings outputted in correspondence to set match lines when at least one match line is set in the ternary content addressable memory (CAM); and determining, as a longest prefix matching (LPM) entry, a routing entry corresponding to a mask string having the longest prefix length.

Growing community of inventors

Seoul, South Korea

Byung-Gu Choe