摘要:
A method and system are disclosed for distributing load in a network. A set of routers are configured for providing IP gateway services to a set of hosts where each router in the set of routers all back up all the other routers in the same set. Each router in the set utilizes identical load distribution policies, load distribution properties and load distribution arrangement. A Load Distribution Function (LDF) master router is determined for the set of routers, wherein each one of the set of routers is a backup for the LDF master router. Every router in the set of routers utilize the same algorithm to compute load distribution and the LDF master router provides balancing information to all the other routers by including that information in VRRP advertisement messages to all the routers.
摘要:
A method or corresponding apparatus in an exemplary embodiment of the present invention determines how many copies of a multicast packet are to be sent, as copies, to multiple destinations based on information in the multicast packet and a group (e.g., bridge node) with which the packet is associated. The copies of the multicast packets are then generated. After generating the copies, an action to take for each copy is determined. This determination is made using the information in the multicast packet and based on the group with which the packet is associated. After the action is determined for each copy, the action is performed on each copy. Through use of an embodiment of the present invention, memory space is conserved, allowing for continued use of a device in a multicast environment of an ever growing network, such as the Internet.
摘要:
A method and system are disclosed for distributing load in a network. A set of routers are configured for providing IP gateway services to a set of hosts where each router in the set of routers all back up all the other routers in the same set. Each router in the set utilizes identical load distribution policies, load distribution properties and load distribution arrangement. A Load Distribution Function (LDF) master router is determined for the set of routers, wherein each one of the set of routers is a backup for the LDF master router. Every router in the set of routers utilize the same algorithm to compute load distribution and the LDF master router provides balancing information to all the other routers by including that information in VRRP advertisement messages to all the routers.
摘要:
A method or corresponding apparatus in an exemplary embodiment of the present invention determines how many copies of a multicast packet are to be sent, as copies, to multiple destinations based on information in the multicast packet and a group (e.g., bridge node) with which the packet is associated. The copies of the multicast packets are then generated. After generating the copies, an action to take for each copy is determined. This determination is made using the information in the multicast packet and based on the group with which the packet is associated. After the action is determined for each copy, the action is performed on each copy. Through use of an embodiment of the present invention, memory space is conserved, allowing for continued use of a device in a multicast environment of an ever growing network, such as the Internet.
摘要:
A method of managing faults in a ring network may include configuring a ring network to be in a “horseshoe” topology by disabling a communications link from distributing media between a selected pair of adjacent nodes while allowing other communications or non-related media to continue to be distributed via the adjacent nodes. In the event of a failure, the disabled communications path may be re-enabled, and first or second backup communications paths may be employed, where the first backup communications path may use primary connections between adjacent nodes used for primary communications paths normally used to carry the media, and the second backup communications paths may use secondary connections between non-adjacent nodes. The disabled communications path may be dynamically moved in a logical or physical manner in an event of a communications link or node failure to maintain a “horseshoe” topology in the ring network.
摘要:
The present invention provides a system, method and computer program product for managing multi-dimensional data. The management of the multi-dimensional data includes generating policy-compliant journal and accounting entries by processing the data segments of the multi-dimensional data. One or more data segments in the multi-dimensional data are assigned one or more keywords by a user. The keywords are combined with arithmetic operators to generate rules, based on predefined compliance policies. The rules are operated to generate one or more data outputs. These data outputs are posted as journal and accounting entries to a ledger.
摘要:
Differentiated services for network traffic using weighted quality of service is provided. Network traffic is queued into separate per flow queues, and traffic is scheduled from the per flow queues into a group queue. Congestion management is performed on traffic in the group queue. Traffic is marked with priority values, and congestion management is performed based on the priority values. For example, traffic can be marked as “in contract” if it is within a contractual limit, and marked as “out of contract” if it is not within the contractual limit. Marking can also include classifying incoming traffic based on Differentiated Service Code Point. Higher priority traffic can be scheduled from the per flow queues in a strict priority over lower priority traffic. The lower priority traffic can be scheduled in a round robin manner.
摘要:
A method and apparatus that includes processing for providing multi-cast transmissions within a data network begins by determining, for a source virtual network, a list of downstream virtual sub-networks for multi-cast traffic based on a multi-cast routing protocol. The processing then continues by determining multi-cast group membership on as per downstream virtual sub-network, edge device, and port basis. The process continues when a data packet is received via the source virtual network. The processing then continues by generating a multi-cast session table entry based on the list of downstream virtual sub-networks and the multi-cast group membership. The process continues by establishing virtual connections between the source virtual network and edge devices coupled to virtual sub-networks identified in the list of downstream virtual sub-networks. Having generated the virtual connections, the processing continues by downloading the multi-cast session table to the edge devices. The edge devices utilize the multi-cast session table entry to determine where the received data packets are to be forwarded.
摘要:
The present invention provides a method, system, and computer program product for fast and efficient IP (Internet Protocol) address lookup. IP address values are interpreted using a separate array for each 8-bit component of the address. This technique is therefore exploitable in a multi-processing environment. The IP address look-up time when using the present invention is nearly constant, regardless of the particular address value. Minimal, if any, locking is required. This technique can be used equally well with class-specific IP version 4 32-bit addresses and with Classless Inter-Domain Routing (CIDR), and easily extends to use with IP version 6 128-bit addresses.
摘要:
Differentiated services for network traffic using weighted quality of service is provided. Network traffic is queued into separate per flow queues, and traffic is scheduled from the per flow queues into a group queue. Congestion management is performed on traffic in the group queue. Traffic is marked with priority values, and congestion management is performed based on the priority values. For example, traffic can be marked as “in contract” if it is within a contractual limit, and marked as “out of contract” if it is not within the contractual limit. Marking can also include classifying incoming traffic based on Differentiated Service Code Point. Higher priority traffic can be scheduled from the per flow queues in a strict priority over lower priority traffic. The lower priority traffic can be scheduled in a round robin manner.