Abstract: A technique transfers data over a packet-switched network (PSN), comprising a plurality of intermediate nodes, in a manner that does not require that the intermediate nodes support a network layer infrastructure. A network controller coupled to the intermediate nodes acquires topology information associated with the PSN's topology. This information may include pseudo-wire definitions, ingress and egress interface information, ingress and egress labels, and so on. The network controller generates a transport database from the topology information and distributes the transport database to the intermediate nodes. An intermediate node acquires the transport database information and configures a packet-processing engine (PPE), contained within the intermediate node, to process packets acquired by the intermediate node.

Abstract: A technique controls the capacity of a virtual concatenation group (VCG) carried on a SONET path of a data network. Efficient control of VCG capacity is provided by emulating aspects of a Link Capacity Adjustment Scheme (LCAS) protocol in software. A hardware poller facility is employed to manage the status and state of the VCG, as well as members belonging to the VCG. The hardware poller contains one or more VCG state machines (VSMs) and member state machines (MSMs) configured to maintain the status and states of the VCGs and their members.

Abstract: In network systems for transporting GFP-encapsulated FICON frames across a SONET/SDH transport network between FICON ports, the transport interfaces for the FICON ports operate to drop duplicate and out-of-order frames transported across the SONET/SDH network. The transmitting transport interface inserts a sequence number incremented with each FICON frame into said one or more transport frames, whereby the sequence number is used as an index for determining duplicate and out-of-order frames after transport over said SONET/SDH network. The receiving transport interface compares sequence numbers with each FICON frame to determine duplicate and out-of-order FICON frames, drops the duplicate and out-of-order FICON frames; and sends the balance of the compared FICON frames to the receiving FICON port.

Abstract: A technique transfers data over a packet-switched network (PSN), comprising a plurality of intermediate nodes, in a manner that does not require that the intermediate nodes support a network layer infrastructure. A network controller coupled to the intermediate nodes acquires topology information associated with the PSN's topology. This information may include pseudo-wire definitions, ingress and egress interface information, ingress and egress labels, and so on. The network controller generates a transport database from the topology information and distributes the transport database to the intermediate nodes. An intermediate node acquires the transport database information and configures a packet-processing engine (PPE), contained within the intermediate node, to process packets acquired by the intermediate node.

Abstract: A method and system for emulating an Fibre Channel link over a SONET transport path to provide link integrity is disclosed. Techniques to handle link failures from a Fibre Channel element to its associated Fibre Channel port, or of the SONET/SDH network linking Fibre Channel ports are described. Timing the length of failures and return of operation of the failed links is used to handle transient conditions and to avoid link bouncing.

Abstract: A packet communications network includes a route management system in which routes can be remotely changed by using a simple set command to set a data value in the originating or terminating node of the route. Storage tables in the originating and destination nodes record the route changes and administrative data concerning the route. This administrative data can be retrieved from the originating node by simple get or get-next commands. The administrative data can include the specific specification of the route in links, the time of creation of the route, the route replaced and the reason for initiating the change in route. Together these capabilities permit centralized management of route changes in the entire network from a single manager node, and using only simple set, get and get-next command structures.

Abstract: Provided are a method and system for use within at least one network wherein broadcast occurs. The method and system achieve their objects as follows. In response to reception of a data frame with at least one destination indicator ordinarily requiring broadcast to a first defined group of stations, at least one attribute of the received data frame is examined. In response to the step of examining, the received data frame is transmitted to a defined second group of stations, smaller in number than the first group of stations.

Abstract: A packet communications network includes a route management system in which routes can be remotely changed by using a simple set command to set a data value in the originating or terminating node of the route. Storage tables in the originating and destination nodes record the route changes and administrative data concerning the route. This administrative data can be retrieved from the originating node by simple get or get-next commands. The administrative data can include the specific specification of the route in links, the time of creation of the route, the route replaced and the reason for initiating the change in route. Together these capabilities permit centralized management of route changes in the entire network from a single manager node, and using only simple set, get and get-next command structures.

Abstract: A packet communications network includes a centrally controlled route testing system in which each node includes test results tables containing the results of all path tests originated at that node. A centralized route management facility initiates a path test originating at any node by remotely altering a trigger value in a trigger data object at that node. A general results table contains general test results for an entire path between the local node and a remote node while a detailed test results table contains detailed, hop-by-hop test results for each transmission leg of a multi-leg path. The general results table contains a name trigger field for identifying a point-to-point path to be tested, and a connection trigger field for identifying a link-by-link path to be tested.