|Publication number||US7039014 B1|
|Application number||US 09/749,178|
|Publication date||May 2, 2006|
|Filing date||Dec 26, 2000|
|Priority date||Dec 26, 2000|
|Also published as||US7848245|
|Publication number||09749178, 749178, US 7039014 B1, US 7039014B1, US-B1-7039014, US7039014 B1, US7039014B1|
|Inventors||Chandrasekar Krishnamurthy, Huaqing Zeng|
|Original Assignee||Cisco Technology, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (20), Referenced by (35), Classifications (12), Legal Events (3)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present invention generally pertains to the field of Asynchronous Transfer Mode (ATM) networks and more particularly concerns a debug mechanism method for identifying failure points within the Private Network Node Interface or Private Network-to-Network Interface (PNNI) domain.
Developed through the efforts of the ATM Forum and detailed in “The ATM Forum Technical Committee, Private Network-Network Interface Specification Version 1.0 (PNNI 1.0),” af-pnni-0055.000, Mar. 1996, PNNI 1.0 is a protocol standard that enables the building of multi-vendor, interoperable ATM switching networks. The protocol allows for the building and maintenance of large ATM networks because it provides hierarchical, dynamic link-state routing instructions and communication pathways. The protocol permits separate ATM switches within interconnecting networks to continuously communicate and share information. In addition, PNNI defines signaling requests for establishing and taking down point-to-point and point-to-multipoint connections across those networks.
PNNI routing is based on well-known, link-state routing techniques similar to, for example, Open Shortest Path First (OSPF). In addition to the basic link-state mechanism, PNNI provides support for quality of service (QoS) routing, required for applications with real-time requirements and scalability to large global networks. These features provide large-scale networks with a single routing protocol, unlike the Internet strategy of using a number of protocols at various levels.
To establish connections, PNNI environments operate with peer groups (PG), a collection of logical nodes that exchange information with other members of the group. This information exchange allows all members of the same peer group to maintain an identical view of the PG and for those nodes outside of the PG to exchange messages with the PG as a whole. In more detail, connections in PNNI networks are enabled through dynamic routing, which requires that each node exchange information (link state information) with other nodes in its peer group regarding the connection topology (links) between itself and the other peer nodes, as well as exchanging less-detailed information regarding the connection topology of nodes outside the peer group. This information exchange is done on a regular basis in order to keep the status of the links in the network updated. When a call setup request is received at an originating node, the originating node utilizes the information it has received in order to generate a stack of “Designated Transit Lists” (DTLs) for the routing of the call setup request through the network hierarchy. A DTL essentially comprises a string of node identifications that is sent in conjunction with the call setup request.
One of the difficulties with dynamic routing schemes is that it greatly complicates identification of failure points in the network. Failure points are also referred to as rejection points. Since the route for a particular connection cannot be predicted beforehand, it typically is necessary to use a trace mechanism to determine the actual route used. Although path and connection trace mechanism can identify the route being taken, it cannot be effectively used for troubleshooting, because the number of connection setup messages will overload the network due to the sheer size of the TTL (time to live) IE (information element).
An improved mechanism is described for identifying failure points (i.e. nodes) in a PNNI network through the use of a debug IE (information element) that is propagated along the communication path for a given connection to activate diagnostic functions on targeted switching devices. The mechanism comprises a method that is initiated by embedding a debug information element (IE) in a data packet, such as a communications management message, which is propagated to various switching devices (the nodes) along the communication path. The debug IE is encoded such that it will be recognized by selected switching devices along the path, but ignored by other non-selected switching devices. Further encoding identifies targeted switching devices that are suspected to be possible failure points to confirm that they are functioning properly and/or diagnose why they have failed. This can also be used for any diagnostic functions that need to be performed in the switching device. Upon receipt and extraction of the debug IE from the data packet, the targeted switching devices are instructed to automatically perform one or more failure analysis functions to verify their operation. The results of these tests are then forwarded to an operator of the targeted switching devices, such as a network operator or a vendor that supplies the targeted switching devices to the network. Also, the debug IE can be used for any diagnostic information and also collecting runtime data on a per connection basis even though the connection can be established successfully.
Other features and advantages of the present invention will be apparent from the accompanying drawings and from the detailed description that follows below.
The present invention is illustrated by way of example and not limitations in the figures of the accompanying drawings, in which like references indicate similar elements, and in which:
An improved mechanism is disclosed for identifying failure points (i.e. nodes) in a PNNI network through the use of a novel debug IE (information element) that is propagated along the communication path for a given connection. In order to better understand the features and advantages provided by embodiments of the invention, a discussion of the hierarchical structure and basic operations of a PNNI network is now presented.
From a physical standpoint, a PNNI network comprises a plurality of switching devices, refered to as “nodes,” which are interconnected by means of physical links, i.e., through fiber optic or wired connections. The PNNI specification enables the connection and interaction of various vendor-independent switching devices, provided by companies such as Cisco Systems, Nortel Networks, and Lucent Technologies. An exemplary PNNI network 10 is shown in
A port is the attachment point of a link to a lowest-level node within a switching system. Physical links are duplex (i.e., communications data may be carried in either direction). However, physical link characteristics may be different in each direction, either because the capacities differ, or because existing traffic loads are different. Accordingly, each physical link is identified by two sets of parameters, one for each direction. These sets comprise a transmitting port identifier plus the node ID of the lowest-level node containing the port.
If the PNNI protocol supported only the flat network depicted in
The PNNI hierarchy begins at the lowest level, where the lowest-level nodes are organized into peer groups. A “logical node” in the context of the lowest hierarchy level is a lowest-level node. For simplicity, logical nodes are often denoted as “nodes.” A peer group (PG) is a collection of logical nodes, each of which exchanges information with other members of the group, such that all members maintain an identical view of the group. Logical nodes are uniquely and unambiguously identified by “logical node IDs.” As shown in
A peer group is identified by its “peer group identifier,” which is specified at configuration time. Neighboring nodes exchange peer group IDs in “Hello packets.” If nodes have the same peer group ID, then they belong to the same peer group. If the exchanged peer group IDs are different, then the nodes belong to different peer groups. A “border node” has at least one link that crosses the peer group boundary. Hence neighboring nodes with different peer group IDs are border nodes of their respective peer groups. In the presence of certain errors or failures, peer groups can partition, leading to the formation of multiple peer groups with the same peer group ID. The peer group ID is defined as a prefix of at most 13 octets on an ATM End System Address. Thus, the peer group ID can default to a prefix on the address(s) of one or more nodes belonging to the peer group in question, but this is not a requirement.
Logical nodes are connected by “logical links.” Between lowest-level nodes, a logical link is either a physical link or a VPC (Virtual Private Connection) between two lowest-level nodes. Links between lowest-level nodes in the same peer group are not aggregated. For example if two physical links were to connect the same pair of lowest-level nodes, then they would be represented by two separate logical links. Logical links inside a peer group are “horizontal links,” whereas links that connect two peer groups are referred to as “outside links.”
When a logical link becomes operational, the attached nodes initiate an exchange of information via a well-known Virtual Channel Connection (VCC) as a “PNNI Routing Control Channel” (RCC). Hello packets sent periodically by each node on this link specify the ATM End System Address, node ID, and its port ID for the link. In this manner, the Hello protocol makes the two neighboring nodes known to each other. As discussed above, the PNNI Hello protocol also supports the exchange of peer group IDs so that neighboring nodes can determine whether they belong to a same peer group or to different peer groups.
Each node exchanges Hello packets with its immediate neighbors and thereby determines its local state information. This state information includes the identity and peer group membership of the node's immediate neighbors, and the status of its links to the neighbors. Each node then bundles its state information in “PNNI Topology State Elements” (PTSEs), which are reliably flooded throughout the peer group. PTSEs are the smallest collection of PNNI routing information that is flooded as a unit among all logical nodes within a peer group. A node's topology database consists of a collection of all PTSEs received, which represent that node's present view of the PNNI routing domain. In particular, the topology database provides all the information required to compute a route from the given node to any address reachable in or through that routing domain.
Every node generates a PTSE that describes its own identity and capabilities, information used to elect the peer group leader, as well as information used in establishing the PNNI hierarchy. This is referred to as the nodal information.
PTSEs contain, among other things, “topology state parameters” (i.e. “link state parameters”, which describe the characteristics of logical links, and “nodal state parameters”, which describe the characteristics of nodes). Topology state parameters are classified as either attributes or metrics. An attribute is considered individually when making routing decisions. For example a security “nodal attribute” could cause a given path to be refused. A metric, on the other hand, is a parameter whose effect is cumulative along a path. For example, delay “metrics” add up as one progresses along a given path. Certain topology state information, especially that related to bandwidth, is rather dynamic. On the other hand, other topology state information, such as Administrative Weight, may be relatively static. There is no distinction between dynamic and static topology state parameters in the flooding mechanism for PNNI topology distribution.
Reachability information consists of addresses and address prefixes which describe the destinations to which calls may be routed. This information is advertised in PTSEs by nodes in the PNNI routing domain. Internal and exterior reachability information is logically distinguished based on its source. PNNI routing may not be the only protocol used for routing in an ATM network. Exterior reachability is derived from other protocol exchanges outside the PNNI routing domain. Internal reachability represents local knowledge of reachability within the PNNI routing domain. The primary significance of this distinction is that exterior reachability information shall not be advertised to other routing protocols or routing domains (for fear of causing routing loops across routing domains). Manual configuration can be used to create internal or exterior reachability information with corresponding effects on what is advertised to other routing protocols or domains. Exterior reachable addresses may also be used to advertise connectivity to otherwise independent PNNI routing domains.
When neighboring nodes, at either end of a logical link being initialized, conclude that they are in the same peer group through the exchange of Hellos, they proceed to synchronize their “topology databases.” Database synchronization is the exchange of information between neighbor nodes resulting in the two nodes having identical topology databases. The topology database includes detailed topology information about the peer group in which the logical node resides plus more abstract topology information representing the remainder of the PNNI routing domain. The way in which this higher level information flows into the peer group is described below.
During a topology database synchronization, the nodes in question first exchange PTSE header information, i.e. they advertise the presence of PTSEs in their respective topology database. When a node receives PTSE header information that advertises a more recent PTSE version than the one it has or advertises a PTSE that it does not yet have, it requests the advertised PTSE and updates its topology database with the subsequently received PTSE. If a newly initialized node connects to a peer group then the ensuing database synchronization reduces to a one-way topology database copy.
A link is advertised via PTSE transmissions only after the database synchronization between the respective neighboring nodes has successfully completed. In this way, the link state parameters are distributed to all topology databases in the peer group containing that link. This is achieved through “flooding.”
Flooding is the reliable hop-by-hop propagation of PTSEs throughout a peer group. It ensures that each node in a peer group maintains an identical topology database. Flooding is the advertising mechanism in PNNI.
In essence, the flooding procedure is as follows. PTSEs are encapsulated within “PNNI topology state packets” (PTSPs) for transmission. When a PTSP is received, its component PTSEs are examined. Each PTSE is acknowledged by encapsulating information from its PTSE header within an “Acknowledgment Packet”, which is sent back to the sending neighbor. If the PTSE is new or of more recent origin than the node's current copy, it is installed in the topology database and flooded to all neighbor nodes except the one from which the PTSE was received. A PTSE sent to a neighbor is periodically retransmitted until acknowledged.
Flooding is an ongoing activity, i.e., each node issues PTSPs with PTSEs that contain updated information. The PTSEs contained in topology databases are subject to aging and get removed after a predefined duration if they are not refreshed by new incoming PTSEs. Only the node that originally originates a particular PTSE can reoriginate that PTSE. PTSEs are reissued both periodically and on an event driven basis.
Each peer group is represented in the next hierarchical level by a single node called a “logical group node.” The functions needed to perform this role are executed by a node, called the “peer group leader”, that is a member of the peer group being represented. There is at most one active peer group leader (PGL) per peer group; more precisely at most one per partition in the case of a partitioned peer group. PGLs are selected through an election process, details of which are not disclosed herein. Apart from its specific role in aggregation and distribution of information for maintaining the PNNI hierarchy, the PGL does not have any special role in the peer group. For all other functions, e.g., connection establishment, it acts like any other node.
Internal operation of a peer group does not require having a peer group leader. Full connectivity within a peer group can be achieved without a peer group leader. A PNNI Routing Domain configured as a single peer group can achieve full connectivity even without a peer group leader.
A degenerate form of a peer group is one containing a single node. The peer group leader of a single node peer group is the node itself. This could occur through configuration, or as a result of failures.
A “logical group node” is an abstraction of a peer group for the purpose of representing that peer group in the next PNNI routing hierarchy level. For example, in
The functions of the logical group node and the peer group leader of its child peer group are closely related. The functions of a logical group node include aggregating and summarizing information about its child peer group and flooding that information into its own peer group. A logical group node also passes information received from its peer group to the PGL of its child peer group for flooding. A logical group node does not participate in PNNI signaling.
A logical group node is identified by a node ID, which by default contains the peer group ID of the peer group that the node is representing. A logical group node is addressable by a unique ATM End System Address that may, for example, correspond to the address of the lowest-level node in the same switching system but with a different “selector” value.
The manner in which a peer group is represented depends on the policies and algorithms of the peer group leader. Thus given two potential peer group leaders that implement the same policies and algorithms, the representation of the peer group does not depend on which of the two is elected.
Observe that logical group nodes in
Peer group A is called the “parent peer group” of peer groups A.1, A.2, A.3 and A.4. Conversely, peer groups A.1, A.2, A.3 and A.4 are called “child peer groups” of peer group A. A parent peer group is identified by a peer group ID that must be shorter in length than its child peer group IDs. Any node capable of becoming peer group leader must be configured with its parent peer group ID.
The length of a peer group ID indicates the level of that peer group within the PNNI hierarchy. One refers to this length as the “level indicator.” PNNI levels are not dense, in the sense that not all levels will be used in any specific topology. For example, a peer group with an ID of length “n” bits may have a parent peer group whose ID ranges anywhere from 0 to n−1 bits in length. Similarly, a peer group with an ID of length “m” bits may have a child peer group whose identifier ranges anywhere from m+1 to 104 bits in length (104 is the maximum peer group ID length and corresponds to 13 octets).
A logical group node represents an entire underlying peer group. The associated peer group leader, as a member of the underlying peer group, has received complete topology state information from all nodes in the peer group. This provides the peer group leader with all of the required information to instantiate the logical group node. Conceptually this may be thought of as the peer group leader feeding information up to the logical group node it instantiates. This upward flow includes two types of information: reachability and topology aggregation. Reachability refers to summarized address information needed to determine which addresses can be reached through the lower level peer group. Topology aggregation refers to the summarized topology information needed to route into and across this peer group.
There is a filtering function inherent in the summarization process that propagates only the information needed by the higher levels. PTSEs never flow up the hierarchy. Instead the summarized information is advertised within PTSEs originated by the logical group node and flooded to its peers.
The foregoing describes how feeding information up the PNNI routing hierarchy is necessary for creating the hierarchy itself and for distributing routing information about child peer groups. Conversely feeding information down the hierarchy is necessary to allow nodes in the lower level peer groups to route to all destinations reachable via the PNNI routing domain. Route computation uses this information to select routes to destinations.
Each logical group node feeds information down to its underlying peer group. The information fed down consists of all PTSEs it originates or receives via flooding from other members of the LGN's peer group. Each PTSE that flows down to a peer group leader is flooded across that peer group. This gives every node in a peer group a view of the higher levels into which it is being aggregated. In summary, PTSEs flow horizontally through a peer group and downward into and through child peer groups.
With reference to
In ATM networks, data is passed along a communication path in the form of a fixed-size unit called a “cell.” ATM is a cell-switching and multiplexing technology that combines the benefits of circuit switching (guaranteed capacity and constant transmission delay) with those of packet switching (flexibility and efficiency for intermittent traffic). Depending on the type of data being sent, e.g. audio data, video data, or binary data, various Quality of Service (QoS) parameters are specified. The most commonly used QoS parameters are average cell transfer delay, cell delay variation, cell loss ratio, cell error ratio, and cell misinsertion rate. For example, since audio and video connections require real-time or near-real-time transmission, their corresponding QoS parameters will typically place emphasis on speed of transmission, i.e., the parameters for cell transfer delay and cell delay variation will be set to adhere to rapid data delivery. In these instances, the penalty for losing data (e.g., a missed cell) is not great. In contrast, binary data (e.g., a computer file) needs to be accurately transported, but generally does not require real-time transfer. Accordingly, the cell loss ratio, cell error ratio, and cell misinsertion rate parameters will be emphasized, with allowances for a corresponding penalty in speed.
An ATM cell header can be in one of two formats: UNI or NNI. The UNI header is used for communication between ATM endpoints and ATM switches in private ATM networks. The NNI header is used for communication between ATM switches. The Header portion of an ATM cell that implements the NNI format is depicted in
Messages and data are propogated across the network using ATM switching. The basic operation of ATM switching is straightforward: The cell is received across a link on a known VCI or VPI value. The switch looks up the connection value in a local translation table to determine the outgoing port (or ports) of the connection and the new VPI/VCI value of the connection on that link. The switch then retransmits the cell on that outgoing link with the appropriate connection identifiers. Because all VCIs and VPIs have only local significance across a particular link, these values are remapped, as necessary, at each switch.
ATM cell streams are converted into other formats specific to various communication protocols, such as telephony protocols and IP protocols, in ATM adaptation layers (AALs), that sit above the ATM layer in a multi-layer stack. Details of the various AALs will be known to those skilled in the art, and are therefore not disclosed herein. The AALs enable transmission of data in variable-length packets, such as IP packets. In addition, various information is distributed across the network through the use of similar higher-level data packets.
Included in these data packets are connection-management messages. ATM uses several connection-management messages to initiate, acknowledge, and release connections. For example, an end-point-to-end-point connection path is established in the following manner. The calling party (i.e., the party at the initiation end point, e.g., CPE(A)) initiates a call attempt using a SETUP message indicating CPE(B) as the called party number IE. Information in the SETUP message may also include QoS parameters. The network routes the call to the physical interface on which CPE(B) is connected and outputs a SETUP message indicating the VPI/VCI to use if the call is accepted. Optionally, the SETUP message may also communicate the identity of the calling party (CPE(A)) in the calling party number IE, similar to the calling line ID service provided by telephone service providers. The route selected is a function of the network traffic ar nodes along the path (as well as the traffic at nodes that were considered, but are not used in the path), as well as QoS considerations, if specified in the SETUP message. Once the SETUP message reaches the called party, the called party may accept the call by returning a CONNECT message, which the network propagates back to the originator as rapidly as possible in order to keep the call setup time as low as possible. A CONNECT ACKNOWLEDGE message is used from the network to the called party and from the calling party to the network as the final stage of the three-way handshake to ensure that the connection is indeed active.
A end-point-to-end-point connection release (i.e., hang up a call) proceeds as follows. Either party may initiate the release process, just as either party may hngu up first during a telephone call. A connection release is initiated by sending a RELEASE message. The network then propagates the RELEASE message across the network to the other party. The other party acknowledges the RELEASE request by returning a RELEASE COMPLETE message, which is then propogated back across the network to the party that originated the RELEASE request.
Suppose that node A.4.3 has a problem, preventing the call from going through, such as shown in
As discusses above, the ATM protocol supports multi-vendor networks, such that switching devices from various suppliers may be implemented in the same network. Many of these vendors supply switching devices with built in failure diagonostic functions that may be used in debugging equipment failures.
A debug mechanism is provided that enables selective activation of failure diagnostics in switching devices along a given connection path. According to one embodiment, the debug mechanism comprises embedding a debug IE in one or more connection-management messages, such as a SETUP, CALL PROCEEDING, CONNECT, RELEASE, and/or RELEASE COMPLETE message. As the debug IE is propogated along the communication path during the passing of a connection-management message, the failure diagnostic function(s) of various targeted switching devices can be selectively activated. Since ATM networks are vendor-neutral, a particular vendor may implement the debug mechanism on that vendor's equipment, in a manner that does not effect the operation of the equipment provided by other vendors.
For example, the debug IE can be embedded in a SETUP message to indicate that failure diagnostic functions should be performed on of a particular vendor's switching devices that are along a connection path. Optionally, the debug IE can be encoded such that the failure diagnostic functions are activated in those switching devices that meet a specific requirement, such as along a certain portion of the connection path, or switching devices that are members of a certain peer group.
The structure for information element coding in a general PNNI message as defined in ITU-T recommendation Q.2931 is shown in
The formatting of a general information element as defined by standard Q.2931 is shown in
An exemplary format for implementing the debug IE of the present invention is shown in
The logic for implementing one embodiment of the invention is shown in
Next, in accord with a block 112, the debug IE is propagated along with the message or data packet to each switching device along the connection path. Upon receiving a message, each switching device will parse the packet to identify the activity that is to be performed on the packet. In general, the activity will simply be to pass the data packet onto the next switching device. However, as provided by a block 114, selected switching devices, such as those supplied by a particular vendor or supplied by members of a vendor cooperative, will be programmed such that they will extract the debug IE and understand what activities they are to perform based on information encoded within the debug IE. Accordingly, the debug IE should be located in the header or encoded in a manner such that it would simply be ignored by equipment produced by other vendors.
Upon extracting the debug IE, failure analysis function(s) corresponding to information contained in the contents of the debug IE would be initiated at selected switching devices, as provided by a block 116. For example, the debug IE might inform a particular switching device to perform a full set of failure analysis functions, or prescribe only (a) particular function(s) to be run.
Upon completion of the failure analysis functions, the switching devices would then communicate the results back to the network operator and/or vendor by either propagating data back along the connection path to the operator or vendor, or providing such information to one or more data stations, as indicated by a block 116. An exemplary scenario corresponding to the latter case is shown in
The foregoing process can be initiated in several different ways. Under many circumstances, it may be desired to determine why a particular connection path failed. For example, suppose a particular connection failed. The first step would be to determine the connection path and the switching device corresponding to the failure point. The debug IE would then be forwarded by the switching devices along the path until it reached the switching device that caused the failure. Upon receiving the debug IE, the failed switching device would be instructed to perform one or more failure analysis functions, and the results of the functions would then be forwarded to the operator of the device.
The debug IE could also be used for maintainence purposes. For instance, a vendor could send a message containing the debug IE to a predetermined set of switching devices to have them perform certain diagnostic functions on a periodic basis. Other similar uses for the debug IE will be known to those skilled in the art.
In the foregoing specification, the invention has been described with reference to specific exemplary embodiments. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4679186 *||Sep 26, 1984||Jul 7, 1987||American Telephone And Telegraph Company, At&T Bell Laboratories||Alternate self-routing packet switching node having fault detection capabilities|
|US5056085 *||Aug 9, 1989||Oct 8, 1991||Harris Corporation||Flood-and-forward routing for broadcast packets in packet switching networks|
|US5271000 *||Dec 6, 1991||Dec 14, 1993||International Business Machines Corporation||Method and apparatus for testing and evaluation of distributed networks|
|US5506838 *||Dec 29, 1994||Apr 9, 1996||Emc Corporation||Packet propagation and dynamic route discovery apparatus and techniques|
|US5781529 *||Mar 27, 1996||Jul 14, 1998||General Datacomm, Inc.||Systems and methods for routing ATM switched virtual circuit calls|
|US5943391 *||Jun 10, 1997||Aug 24, 1999||Cirrus Logic, Inc.||Method and device for a debugger and test data collector|
|US5946316 *||Jan 17, 1997||Aug 31, 1999||Lucent Technologies, Inc.||Dynamic distributed multicast routing protocol|
|US6055561 *||Sep 30, 1997||Apr 25, 2000||International Business Machines Corporation||Mapping of routing traffic to switching networks|
|US6147965 *||Jan 26, 1998||Nov 14, 2000||Newbridge Networks Corporation||Switched connections diagnostics in a signalling network|
|US6147971 *||Nov 18, 1998||Nov 14, 2000||3Com Corporation||Optimized routing method based on minimal hop count for use in PNNI based asynchronous transfer mode networks|
|US6208623 *||Apr 13, 1998||Mar 27, 2001||3Com Corporation||Method of combining PNNI and E-IISP in an asynchronous transfer mode network|
|US6243384 *||Mar 23, 1998||Jun 5, 2001||Telefonaktiebolaget Lm Ericsson||Address analysis for asynchronous transfer mode node with PNNI protocol|
|US6282195 *||Jan 9, 1997||Aug 28, 2001||Silicon Graphics, Inc.||Packetized data transmissions in a switched router architecture|
|US6292463 *||Jul 6, 1998||Sep 18, 2001||Alcatel Canada Inc.||Method and apparatus for recovering from a signalling failure in a switched connection data transmission network|
|US6456600 *||Apr 28, 1999||Sep 24, 2002||3Com Corporation||Complex node representation in an asynchronous transfer mode PNNI network|
|US6473408 *||May 19, 1999||Oct 29, 2002||3Com Corporation||Building a hierarchy in an asynchronous transfer mode PNNI network utilizing proxy SVCC-based RCC entities|
|US6532237 *||Feb 16, 1999||Mar 11, 2003||3Com Corporation||Apparatus for and method of testing a hierarchical PNNI based ATM network|
|US6708291 *||May 20, 2000||Mar 16, 2004||Equipe Communications Corporation||Hierarchical fault descriptors in computer systems|
|US6754219 *||Jun 4, 1999||Jun 22, 2004||Nortel Networks Limited||Modular routing system|
|US6757289 *||Jun 4, 1999||Jun 29, 2004||Nortel Networks Limited||Apparatus and method for managing communication between a failed application and other executing applications|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7184402||Aug 30, 2001||Feb 27, 2007||Cisco Technology, Inc||Method for multi-link load balancing to improve sequenced delivery of frames at peer end|
|US7185319 *||Jul 9, 2002||Feb 27, 2007||Microsoft Corporation||Debugging distributed applications|
|US7233571||Dec 18, 2001||Jun 19, 2007||Cisco Technology, Inc.||Connection-based bandwidth utilization|
|US7383351||Nov 27, 2001||Jun 3, 2008||Cisco Technology, Inc.||Method and apparatus for efficient SPVC destination endpoint address change|
|US7398321 *||May 13, 2003||Jul 8, 2008||The Research Foundation Of Suny||Segment protection scheme for a network|
|US7418005 *||Jul 23, 2002||Aug 26, 2008||Matsushita Electric Industrial Co., Ltd.||Bus optimizing method and communication node|
|US7433362 *||Nov 5, 2004||Oct 7, 2008||Sbc Knowledge Ventures, L.P.||System and method for SONET NSAP addressing|
|US7551635||Oct 7, 2008||Jun 23, 2009||Sbc Knowledge Ventures, L.P.||SONET method and system having network service access point addressing|
|US7587635 *||Oct 4, 2004||Sep 8, 2009||Cisco Technology, Inc.||Method of debugging “active” unit using “non-intrusive source-level debugger” on “standby” unit of high availability system|
|US7701860 *||Feb 21, 2003||Apr 20, 2010||Alcatel Lucent||Control plane stability in communications networks|
|US7733860 *||Nov 1, 2002||Jun 8, 2010||Alcatel-Lucent Canada Inc.||Method for advertising reachable address information in a network|
|US7925487||Jun 29, 2007||Apr 12, 2011||Microsoft Corporation||Replaying distributed systems|
|US7933759||Mar 28, 2008||Apr 26, 2011||Microsoft Corporation||Predicate checking for distributed systems|
|US8098593 *||Apr 30, 2008||Jan 17, 2012||Microsoft Corporation||Multi-level interconnection network|
|US8121824||Mar 31, 2011||Feb 21, 2012||Microsoft Corporation||Predicate checking for distributed systems|
|US8270416 *||Jan 26, 2005||Sep 18, 2012||Samsung Electronics Co., Ltd.||Data transmission path setting apparatus and method for ad-hoc network|
|US8543681 *||Oct 15, 2002||Sep 24, 2013||Volli Polymer Gmbh Llc||Network topology discovery systems and methods|
|US8868715||Oct 15, 2002||Oct 21, 2014||Volli Polymer Gmbh Llc||Report generation and visualization systems and methods and their use in testing frameworks for determining suitability of a network for target applications|
|US9294958 *||Jun 3, 2013||Mar 22, 2016||Qualcomm Incorporated||Method and apparatus for dynamically configuring a cell update message|
|US20030021235 *||Jul 23, 2002||Jan 30, 2003||Matsushita Electric Industrial Co., Ltd.||Bus optimizing method and communication node|
|US20030091165 *||Oct 15, 2002||May 15, 2003||Bearden Mark J.||Report generation and visualization systems and methods and their use in testing frameworks for determining suitability of a network for target applications|
|US20030097438 *||Oct 15, 2002||May 22, 2003||Bearden Mark J.||Network topology discovery systems and methods and their use in testing frameworks for determining suitability of a network for target applications|
|US20030229807 *||May 13, 2003||Dec 11, 2003||The Research Foundation Of State University Of New York, University At Buffalo||Segment protection scheme for a network|
|US20040006632 *||Jul 2, 2002||Jan 8, 2004||Heung-For Cheng||Methods and apparatus for dispatching JavaTM software as an application managed by an operating system control manager|
|US20040010778 *||Jul 9, 2002||Jan 15, 2004||Kaler Christopher G.||Debugging distributed applications|
|US20040073658 *||Oct 10, 2002||Apr 15, 2004||Cisco Technology, Inc.||System and method for distributed diagnostics in a communication system|
|US20040085961 *||Nov 1, 2002||May 6, 2004||John Coffell||Method for advertising reachable address information in a network|
|US20050165957 *||Jan 26, 2005||Jul 28, 2005||Samsung Electronics Co., Ltd.||Data transmission path setting apparatus and method for ad-hoc network|
|US20060075295 *||Oct 4, 2004||Apr 6, 2006||Cisco Technology, Inc., A California Corporation||Method of debugging "active" unit using "non-intrusive source-level debugger" on "standby" unit of high availability system|
|US20060098642 *||Nov 5, 2004||May 11, 2006||Mallya Arvind R||System and method for SONET NSAP addressing|
|US20080077712 *||Feb 28, 2007||Mar 27, 2008||Fujitsu Limited||Peripheral device, peripheral-device recognizing method, and computer product|
|US20090034984 *||Oct 7, 2008||Feb 5, 2009||Sbck Knowledge Ventures, L.P.||Sonet method and system having network service access point addressing|
|US20090274043 *||Apr 30, 2008||Nov 5, 2009||Microsoft Corporation||Multi-level interconnection network|
|US20110178788 *||Mar 31, 2011||Jul 21, 2011||Microsoft Corporation||Predicate Checking for Distributed Systems|
|US20140022989 *||Jun 3, 2013||Jan 23, 2014||Qualcomm Incorported||Method and apparatus for dynamically configuring a cell update message|
|U.S. Classification||370/244, 370/249|
|International Classification||H04L12/26, G01R31/08|
|Cooperative Classification||H04L43/0847, H04L2012/5628, H04L2012/5619, H04L49/555, H04L43/0817|
|European Classification||H04L43/08D, H04L49/55C, H04L43/08E2|
|Dec 26, 2000||AS||Assignment|
Owner name: CISCO TECHNOLOGY, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KRISHNAMURTHY, CHANDRASEKAR;ZENG, HUAQING;REEL/FRAME:011421/0482
Effective date: 20001226
|Sep 28, 2009||FPAY||Fee payment|
Year of fee payment: 4
|Nov 4, 2013||FPAY||Fee payment|
Year of fee payment: 8