Apparatus and methods for routing data packets through a processing system network
AssigneeNCR Corporation
InventorBenjamin P. Hart
Life of this patent
Estimating the term…
Abstract
Apparatus and methods are presented for providing processing system network connectivity, and more particularly, for routing data packets between at least two processing system networks. A first memory for storing at least one address for each of the networks, and a second memory for storing selectively at least one address for particular ones of the networks, are provided. A control circuit for routing a received data packet from a source network to a destination network is also provided. The control circuit utilizes a destination address which was retrieved from one of the first memory and the second memory, in response to a determination as to whether at least one address corresponding to the destination network is stored in the second memory.
Claims33
An apparatus for routing data packets between sub-networks of a processing system network, said apparatus comprising:
- a first means for storing addressing data for routing said data packets between said sub-networks;
- a second means, associated with said first means, for storing recently accessed addressing data for routing ones of said data packets between ones of said sub-networks;
- a control circuit, associated with said first means and said second means, that routes said data packets between sub-networks in response to said recently accessed addressing data and destination indicia associated with said data packets;
- and
- a timing circuit, associated with said control circuit, that indicates time periods during which said recently accessed addressing data are stored in said second means, wherein said control circuit deletes at least one of said recently accessed addressing data from said second means whenever a time period associated with said at least one recently accessed addressing data exceeds a maximum value said deletion thereby eliminating least recently accessed addressing data from said second means.
A method for routing data packets between sub-networks of a processing system network, said method comprising the steps of:
- storing an address for each of said sub-networks in a first memory;
- storing recently accessed addresses for particular ones of said sub-networks in a second memory;
- routing said data packets between sub-networks in response to said recently accessed addresses and destination indicia associated with said data packets;
- using a timing circuit to indicate time periods during which said recently accessed addresses are stored in said second memory;
- and
- deleting at least one recently accessed address from said second means whenever a time period associated with said at least one recently accessed address exceed a maximum value, said deletion thereby eliminating least recently accessed addresses from said second memory.
A processing system network comprising:
- a plurality of sub-networks wherein each said sub-networks includes at least one node;
- and
- an apparatus for routing data packets between said plurality of sub-networks, said apparatus comprising:
- a first means for storing addresses for routing data packets between ones of said plurality of sub-networks;
- a second means, associated with said first means, for storing ones of said recently accessed addresses for use in routing ones of said data packets between particular ones of said plurality of sub-networks;
- a control circuit, associated with said first means and said second means, arranged to route said data packets between said plurality of sub-networks in response to said recently accessed addresses and destination indicia associated with said data packets;
- and
- a timing circuit, associated with said control circuit, that indicates time periods during which said recently accessed addresses are stored in said second means, wherein said control circuit deletes at least one recently accessed address from said second means whenever a time period associated with said least one recently accessed address exceeds a maximum value, said deletion thereby eliminating least recently accessed addresses from said second means.
Dependencies are inferred from the claim text.