摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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 recorded together with its own identifier in a fairness message as a fairness transmission rate to be advertised to its own upstream nodes and to be stored. 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 which was recently advertised and the amount of traffic which has been transmitted from the upstream nodes, and the fairness transmission rate is calculated in order to fairly allocate the available bandwidth to the upstream nodes effectively so that the fairness transmission rate is transmitted to the upstream nodes. The upstream nodes transmit traffic in accordance with the fairness transmission rate.
摘要:
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.
摘要:
A method and apparatus for exchanging routing information in a distributed router system provide enhanced reliability of routing information exchanged between routing processors. To exchange routing information between routing processors in a distributed router system, a transceiving unit adds a header, including a sequence number, to update information transmitted from the routing protocol daemon, and multicasts the update information to another peer. A control unit transmits a sequential update packet, provided by a peer, to the transceiving unit, and a continuous update packet is stored in a receiver buffer for the routing protocol daemon. The control unit then stores in the receiver buffer a non-sequential update packet provided by another peer to the transceiving unit, in the receiver buffer, receives a synchronous signal from another peer, and releases the sender buffer. Subsequently, the control unit receives a maximum value, requests the retransmission of a lost packet, and transmits the maximum value and the synchronous signal periodically. Finally, if a retransmission request signal is received from another peer through the transceiving unit, the lost packet is read from the sender buffer, and is retransmitted through the transceiving unit.
摘要:
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.
摘要:
A method and apparatus and a program storage device, readable by a machine, tangibly embodying a program of instructions executable by the machine performs a method including: receiving an update message at a router, the update message including a timer value from at least one other router according to a routing protocol; extracting the timer value from the update message received from the at least one other router; and resetting the timer value in response to a difference between the extracted timer value of the at least one other router and the set timer value.
摘要:
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.
摘要:
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.