Modular switches interconnected across a communication network to achieve minimal address mapping or translation between termination devices
DC
First Claim
1. A routing network of more than three nodes and three branches, wherein only one switch within one node performs a single address translation as the data traverses the entire routing network and is sent to one of a plurality of termination devices.
5 Assignments
Litigations
0 Petitions
Accused Products
Abstract
An architecture, system and method are provided for efficiently transferring packets of data across a communication network. The communication network is structured such that there are hierarchical levels of high speed switches existing throughout the network. Distributed routing of packets is achieved by comparing identification numbers of only select switches with the destination address on a field-by-field basis. Not all fields need be compared at all switches. Once routing is achieved within the structured network, transfer to a destination termination device occurs through a single look-up table only when departing the network if multiple termination devices are present at that exit node. The routing operation between termination devices can therefore be achieved using a single mapping operation (if more than one termination device must be selected) and is backward compatible with devices external to the network and protocols used by those devices. An additional protocol layer specific to the structure is wrapped onto the incoming packet protocol using a series of read cycles to a memory which temporarily receives the incoming protocol. The sequence of reads can be quickly achieved without using conventional packet processors and the delayed access times normally attributed to those processors. Each switch thereby serves as a traffic manager, having registers that are configured so as to allow the traffic manager to direct packets of data from an input port to an output port in the quickest, most efficient manner without having to decode the entire destination address or requiring time-consumptive routing tables.
27 Citations
16 Claims
- 1. A routing network of more than three nodes and three branches, wherein only one switch within one node performs a single address translation as the data traverses the entire routing network and is sent to one of a plurality of termination devices.
-
6. A communication network comprising:
-
an entry end switch;
an exit end switch selectibly coupled to a plurality of termination devices, one of which is an exit termination device;
a plurality of intermediate switches coupled between the entry end switch and the exit end switch; and
a packet compiled by the entry end switch to contain a destination address of the exit end switch, wherein the packet is forwarded through the plurality of intermediate switches with each intermediate switch having an identification number which points the packet to a successive one of the plurality of intermediate switches and finally to the exit end switch which performs the entirety of all translation needed by the communication network to route the packet from the exit end switch to the exit termination device. - View Dependent Claims (7, 8, 9, 10, 11)
-
-
12. A method of routing data, comprising:
-
providing a communication network comprising multiple interconnected intermediate switches terminated between an entry end switch and an exit end switch;
providing an entry terminal selectibly coupled to the entry end switch;
providing an exit terminal selectibly coupled to the exit end switch;
compiling a packet comprising a destination address of the exit end switch and a source address of the entry termination device, and forwarding the packet from the entry termination device to the entry end switch;
while maintaining the destination address, updating the source address to the address of the entry end switch while forwarding the packet from the entry end switch to the exit end switch, exclusive of look-up operations in the interim; and
while maintaining the source address, updating the destination address to the address of the exit termination device while mapping the packet from the exit end switch to the exit termination device. - View Dependent Claims (13, 14, 15, 16)
before compiling the packet;
broadcasting address resolution protocol from the entry termination device to the entry end switch, thereafter to the exit end switch, and further thereafter to the exit termination device;
finding the location of an exit termination device; and
associating the location of the exit termination device with an identification address of the exit end switch.
-
-
15. The method as recited in claim 14, wherein resolving comprises generating a mapping table within memory of the exit end switch to allow use of the mapping table for directing the packet from the exit end switch to the exit termination device.
-
16. The method as recited in claim 15, wherein generating the mapping table comprises tabulating the results of the associating step for a plurality of exit termination devices.
Specification
-
- Resources
-
Current AssigneeRPX Corporation
-
Original AssigneeDunti Corporation
-
InventorsKapadia, Viren H., Mahalingaiah, Rupaka
-
Primary Examiner(s)Chin, Wellington
-
Assistant Examiner(s)JAIN, RAJ K
-
Application NumberUS09/312,241Time in Patent Office1,635 DaysField of Search370/428, 370/429, 370/351-356, 370/357-360, 370/400, 370/401, 370/403, 370/229-236, 370/248, 370/250, 370/404-406, 370/408, 370/412, 370/389, 370/396, 370/397US Class Current370/389CPC Class CodesH04L 45/04 Interdomain routing, e.g. h...
