Technique for capturing information needed to implement transmission priority routing among heterogeneous nodes of a computer network
AssigneeCisco Technology, Inc.
InventorsUlrica Tam, Steven H. Berl
Life of this patent
Estimating the term…
Loading patent…
AssigneeCisco Technology, Inc.
InventorsUlrica Tam, Steven H. Berl
Estimating the term…
A technique efficiently captures information required to create a filter used by switching nodes of a heterogeneous network to implement transmission priority routing of data traffic over a connection network between end nodes of the network. A bounded time interval, i.e., a time window, is established during which a first switching node monitors the traffic over the network to capture portions of the required information contained in a defined data packet. Monitoring of data traffic during the time window is triggered by a predictable event, the occurrence of which is communicated to the first switching node by a hybrid node of the network. In addition to providing this "triggering" communication, the hybrid node also provides the first switching node with the remaining portion of the required information.
A method for efficiently acquiring information used by first and second switching nodes of a heterogeneous network to implement transmission priority (TP) routing of data traffic over a connection network between end nodes of the network, the method comprising the steps of:
Apparatus for capturing information required to implement transmission priority (TP) routing of data traffic over a network coupling network devices, the apparatus comprising:
A computer readable medium containing executable program instructions for acquiring information used by a switching node of a network to implement transmission priority (TP) routing of data traffic between end devices of the network, the executable program instructions comprising program instructions for:
A switching node for efficiently acquiring information used to implement transmission priority (TP) routing of data traffic over a connection network between end nodes of the network, the switching node comprising:
A method implemented by a switching node, the method being for efficiently acquiring information used to implement transmission priority (TP) routing of data traffic over a connection network between end nodes of the network, the method comprising:
A computer readable medium containing executable program instructions for being executed by a switching node for causing the node to efficiently acquire information used to implement transmission priority (TP) routing of data traffic over a connection network between end nodes of the network, the program instructions comprising instructions for:
Dependencies are inferred from the claim text.
Drawings are temporarily unavailable. Open the PDF at USPTO
Flow control; Congestion control: evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
Arrangements for monitoring or testing data switching networks
Traffic control in data switching networks: flow control; Congestion control
Flow control; Congestion control: identifying congestion
Term ended 10 Apr 2017 (estimated)
USPTO file history isn’t available for this patent, so only indexed dates are shown.
The invention relates to computer networks and, more particularly, to the efficient acquisition of predetermined information by nodes of a computer network.
Data communication in a computer network involves the exchange of data between two or more entities interconnected by communication links and subnetworks. These entities are typically software programs executing on hardware computer platforms, such as end stations and intermediate stations. Examples of an intermediate station may be a router or switch which interconnects the communication links and subnetworks to enable transmission of data between the end stations. A local area network (LAN) is an example of a subnetwork that provides relatively short distance communication among the interconnected stations; in contrast, a wide area network (WAN) enables long distance communication over links provided by public or private telecommunications facilities.
Communication software executing on the end stations correlate and manage data communication with other end stations. The stations typically communicate by exchanging discrete packets or frames of data according to predefined protocols. In this context, a protocol consists of a set of rules defining how the stations interact with each other. In addition, network routing software executing on the routers allow expansion of communication to other end stations. Collectively, these hardware and software components comprise a communications network and their interconnections are defined by an underlying architecture.
The above and further advantages of the invention may be better understood by referring to the following description in conjunction with the accompanying drawings in which like reference numbers indicate identical or functionally similar elements:
FIG. 1 is a schematic block diagram of prior art communications architecture protocol stacks, such as the Internet protocol stack, used to transmit data between stations of a computer network;
FIG. 2 is a schematic block diagram of a prior art Advanced Peer to Peer Networking (APPN) network including APPN nodes;
FIG. 5 is a block diagram of a computer network 500 comprising a collection of interconnected communication links and subnetworks attached to a plurality of stations. The stations are typically computers comprising end stations 502, 512 and intermediate stations 550, 610, 650. Preferably, the end stations are Advanced Peer to Peer Networking (APPN) end nodes, although the stations may comprise other types of nodes such as Low Entry Networking nodes or Physical Units 2.0 via Dependent Logical Unit Requestor functions. In addition, the intermediate stations 610, 650 are data link switching (DLSw) nodes and intermediate station 550 is an APPN/DLSw hybrid node.
Each node typically comprises a plurality of interconnected elements, such as a processor, a memory and a network adapter. The memory may comprise storage locations addressable by the processor and adapter for storing software programs and data structures associated with the inventive information capturing techniques. The processor may comprise processing elements or logic for executing the software programs and manipulating the data structures. An operating system, portions of which are typically resident in memory and executed by the processor, functionally organizes the node by, inter alia, invoking network operations in support of software processes executing on the node. It will be apparent to those skilled in the art that other memory means, including various computer readable media, may be used for storing executable program instructions pertaining to the techniques described herein.
The subnetworks included within network 500 are preferably local area networks (LANs) and the communication links may include wide area network (WAN) links; in the illustrative embodiment of the invention, the LANs are preferably token rings (TR) 504, 514 and an IP network 510, which may comprise either a LAN and/or a WAN configuration such as X.25, inteconnects the nodes 550, 610, 650. Communication among the nodes coupled to the network 500 is typically effected by exchanging discrete data packets or frames via connection-oriented service sessions between the communicating nodes.