Abstract: The inventive system and method provide an integrated information and communication network to any number of associated communication terminals. The invention includes at least one home system or server containing a plurality of applications for performing communication and information services. The home system allows the associated communication terminals to connect and access the applications to receive any of the variety of information and communication services directly from the home system. Communication information in the form of communication signals, data, or any combination of the two may be sent between the communication terminals and the home system. Such information may be provided by the user, by the home system, or may be obtained or processed by any of the available applications.

Abstract: In an ATM exchange, a cell transmission control section transmits an ATM cell to a transmission path of an ATM network A traffic monitor monitors traffic of the cell transmissions. A statistical process section performs a temporal statistical process on the result of the traffic monitoring using a clock and a memory. A CAC produces an instruction for traffic control over a transmission terminal based on the result of the statistical process. A UPC controls traffic of a transmission path from the transmission terminal in accordance with the instruction.

Abstract: A system operating on a communication network for mapping service-level information comprising logical connections to physical-level information comprising working physical paths of the logical connections, where the physical-level information is obscured by activation of protect schemes within the communication network.

Abstract: A system and method for upgrading service class of a connection in a wireless network includes identifying a congested CoS in a sector of a wireless network. Bandwidth availability in the sector is determined at an enhanced CoS in relation to the congested CoS. A communications session is selected in the congested CoS for upgrading. The communications session is upgraded to the enhanced CoS.

Abstract: Only one point to multipoint virtual circuit (p2mp VC) is used within a router to handle all of the sources for a particular multicast group when other particulars of the multicast group are identical within that router. The router receiving a multicast packet for a particular multicast group identifies the source and the group number by reading fields of the incoming packet, identifies the input port of the router, and identifies the output port list. The input port of the router, the group number G, and the output port list are used by the router in establishing and identifying a point to multipoint VC within the router. The invention identifies all packets arriving at that particular input port, having the same multicast group number G, and having the same output port list, and transfers them to the identified VC. The VC is associated in the routing table with the output list of ports from which copies of the multicast packet are transmitted.

Abstract: A method and system utilizing a multi-level expedited forwarding per hop behavior (MLEF PHB) which manages buffer space to provide priority to calls based on a predefined priority scheme. The MLEF PHB defines a set of configurable parameters that define how much buffer space is available to each class or level of voice call. The MLEF PHB may optionally be implemented as programming statements in the SIP User Agent, SIP Proxy, and kernel of a LINUX-based PC router. The MLEF PHB applies an algorithm for dropping packets exceeding a caller precedence level-specific buffer capacity, which variable buffer capacity is determined by the particular DSCP (and the particular MLEF PHB to which it relates).

Abstract: A network comprises a plurality of network nodes. Each network node has a unique node identifier within the context of the network and stores a table of nodes. The table of nodes includes at least one table entry. The table entry includes three fields—a destination node field, a next node field and a cost field. The destination field is a unique node identifier corresponding to another node in the network. The next node is a unique node identifier corresponding to the next node in the communication path to the destination node. The cost field is the cost associated with communication with the network node. When a node is added to the network, it detects the presence of adjacent nodes. The new node obtains the table of nodes stored in each adjacent node and uses the information contained in the node tables to updates its own node table, thereby obtaining information for communicating with every other node in the network.

Abstract: The invention provides a method of selecting a base station according to which optimal quality can be achieved in the communication between a mobile station and a communication destination by efficiently using resources of the entire wireless network, as well as a mobile station and a base station. The base station selection method selects one from a plurality of base stations connected to the relay server, for a connection with the mobile station. In the method, each base station retains abase station routing cost which is a cost for the path connecting the base station to the communication network. And the mobile station measures a toward-base station routing cost for the path between itself and each base station, calculates a total routing cost for each base station by adding the base station routing cost and the toward-base station routing cost, and selects a base station associated with a minimal total routing cost when establishing a relay connection with the communication network.

Abstract: A network node is configured to negotiate for connections for high priority calls (e.g., voice calls) received at the node in the face of otherwise congested outbound communication links. The negotiation is conducted in a fashion that will preserve connections for existing calls associated with the node. For example, the negotiation may be conducted so as to cause one or more of the existing calls to consume less bandwidth over the outbound communication links than was consumed at a time prior to reception of the high priority calls. Such negotiations may be initiated depending on the availability of codec resources and/or compression schemes at the node and may be conducted using OAM cells.

Abstract: A system and method for providing controlled broadband access bandwidth allocation adjustment service are disclosed. A broadband bandwidth allocation service manager is established which is accessible via the broadband network. When a broadband bandwidth allocation adjustment request is received from a requestor, a broadband bandwidth allocation adjustment will be made if the requested bandwidth is available and the requester is willing to accept the pricing associated with the adjustment.

Abstract: A packet switching apparatus for simplifying and reducing the size of a packet switching circuit which is to perform at high speed. The packet switching apparatus is provided with a first packet switching unit for sorting a data packet from one of a plurality of input lines into one of a plurality of transfer lines. The packet switching apparatus is also provided with a second packet switching unit for sorting a data packet from a transfer line into one of a plurality of output lines of a respective output line group. A transfer line transfers a data packet at a line speed faster than a sum of the line speeds of the output lines included within the respective output line group.

Abstract: Method and apparatus for providing a long loop broadband service which allows data from different ADSL users to be shared and transported across a group (possibly a group of one) of line-powered, repeatered copper pairs utilizing a symmetric transmission approach is disclosed. Multiple ADSL users are able to share the bandwidth on pair(s) between the Remote Terminal Unit and Central Termination Unit by converting the ADSL data into ATM cells that are properly addressed and sent over the pair(s). Straight-Through Repeaters can be used in between the Central Termination Unit and the Remote Termination Unit on each of the pairs to extend the reach of the system. In this manner, the reach of ADSL (or other) internet access can be increased from its present 15 to 18 kft limitation to over 40,000 feet using 26 gauge wire, effectively reaching over 99% of subscribers.

Abstract: A method for evaluating quality-of-service in packet switching network uses an evaluation signal with a frequency component that changes continuously with a lapse of time. The evaluation signal is a time stretched pulse, and wherein the method includes a step of transmitting the time stretched pulse to at least one packet switching network, a step of receiving the time stretched pulse passed through the at least one packet switching network, and a step of comparing the transmitted time stretched pulse with the received time stretched pulse.

Abstract: A method and apparatus that provide for a Layer 2 path determination are disclosed. In one embodiment of the invention, a Layer 3 path between a source device and destination device is first determined in order to identify contiguous pairs of Layer 3 devices. A subpath is then determined for each contiguous pair of Layer 3 devices based on VLAN and spanning tree information associated with the contiguous pair. The Layer 2 path is a concatenation of the subpaths of all the contiguous pairs in the Layer 3 path.

Abstract: In a communication network comprising nodes and links between the nodes, a controller node disseminates link state information. A nodal routing table exists at each node comprising routes between pairs of nodes. The nodal routing table is either populated by the given node based on network information received from the controlling node or populated at the controlling node and received by the given node. Each node receives heartbeat signals from its neighbouring nodes. An unexpected delay between heartbeat signals may be perceived as a failure of a link. The perceived failure of that link is reported by the perceiving node to the controlling node. Upon receiving link failure information from a node, the controlling node may determine a subset of nodes in the network influenced by the link failure and indicate the link failure to the determined subset of influenced nodes.

Abstract: A process for selecting the best possible route for an alternate communications path in connection-oriented networks takes into account the reserved network resources and the set of links and/or nodes used by a current communications path. Whenever a request for route selection includes the resources reserved by the current communications path, the alternate communications path is computed considering the network resources reserved by the current communications path as available, in addition to the available network resources existing in the topology database. In another embodiment of the invention, the topology database is initially modified such that the network resources reservations used by the current communications path are removed from the topology database. The alternate communications path is then computed. Finally, the topology database is restored to reflect again the network resources reservations used by the current communications path.

Abstract: In an ATM network in which an SPVC is realized and in which in order to carry out speedily the detection of failures on a line, a software PVC realized by a P-NNI, i.e., a PVC is established between a source private network and a destination private network, and the dynamic routing is carried out between ATM switching equipment on the basis of the establishment of an SVC, the ATM switching equipment is provided with failure detecting means for detecting occurrence of failures on a line in an ATM physical layer. A failure information reporting cell containing therein the information which is used to specify at least the source ATM switching equipment and the failure destination ATM switching equipment is produced on the basis of the failures which have been detected in the physical layer and the occurrence of the failures is reported to each of the ATM switching equipment.

Abstract: The present invention concerns a technique for providing Class-of-Service Routing in an ATM network (10) that utilizes the Private Network-Network Interface (PNNI) protocol. An originating node seeking to route a call to a terminating node does so by initially determining the class-of-service and then selecting a shortest length path there-between. Each successive link on the selected path is examined for sufficient available bandwidth and available depth (i.e., bandwidth not reserved for other services) for the Class-of-Service of the call. If every link possesses sufficient available bandwidth, then the call passes on the selected path. Otherwise, should a link on the selected path lack sufficient bandwidth and available depth, then a crankback message is sent to the originating node, and the originating node selects the next shortest path. Thereafter, the process of examining each link for sufficient bandwidth is repeated. If no path is found, the call is ultimately blocked.

Abstract: A method for constructing the set of optimal complex node representations of a PNNI peer group based on a restrictive cost database (e.g. a cost matrix) associated with the border nodes. The resulting set of complex node representations is the optimal in that it contains all the possible complex node representations that use the minimum possible number of exception bypasses.

Abstract: In a routing protocol control section, when a RIP frame related to a multipath at the same cost is received from each of networks, controls is provided, by a RIP deletion table control section, for deletion of any entry or for frame transmission following the entry (entries) according to whether destination information as well as the cost stored in the RIP deletion table are identified to those in the RIP frame or not for each entry in the RIP frame.

Abstract: A system and method of load balancing a network having a plurality of client systems and servers. The load balancing system and method distributes requests from the client systems to different servers on a wide area network by selecting the most optimal server for a specific client request. The client request for a server is received from a client system and the destination point of the client request is resolved in part by a load balancing server selector. The client request is sent to a load balancing server based on the resolved destination point and one server out of a subset of the plurality of servers is selected based on a predetermined criteria, such as network traffic congestion or server load, and a conduit to the client system and the selected server for transmission of the client request is provided.

Abstract: A handoff scheme for a communications network is disclosed. In a first embodiment a procedure for finding an optimal path between an originating network node and a destination network node is integrated in the handoff procedure. An optimally routed connection is obtained by first determining an optimal “crossover node” along the existing path and then the handoff is effected by altering the existing connection route so that it travels along the existing path until it reaches the crossover node, where the path then varies from the original route, and a new segment between the crossover node and the new location is established. Then the call is switched to the new segment and the corresponding old segment on the old connection is released. In an alternative embodiment, the handoff procedure is performed first by completing a fast reroute connection using a prior art path extension method. This results in a quick, but sub-optimal handoff connection.

Abstract: This invention relates to a method to effect hop-by-hop routing in a network segment where different nodes have different views of the network topology. In particular, the methods of this invention are applicable when each node in a network or network segment may be aware of only a subset of the communication links in the network, without perceiving other communication links. Based on each node's individual view of the network, the method introduces the concept of a visibility set that includes all visible communication links. More specifically, an efficient algorithm is disclosed for searching for a family of one-to-all optimal feasible paths in communication network where different nodes may have different views of the network topology.

Abstract: A packet network of interconnected nodes employs a method of routing with service level guarantees to determine a path through the network for a requested label-switched path (LSP). Each of the nodes includes one or more routers that forward packets based on a forwarding table constructed from paths determined in accordance with the method of routing with service level guarantees. The method of routing with service level guarantees determines the path of the requested LSP based on the effect that routing those packets of the requested LSP may have on current and/or future demands on the capacity of network nodes for currently provisioned LSPs. Such method of routing with service level guarantees may not necessarily route packets of a requested LSP along the shortest path, or minimum number of hops, through the network. Given the packet network and LSP request, a linear programming system may be defined by a set of linear programming equations for a non-split demand case.

Abstract: A method of routing messages between stations of a network is characterised in that each of the stations performs the following operations: storage (E104, E102) of data concerning each message which it receives and including at least one message identifier (ID, ISS), an identifier (TSS) for the station sending the message, and a message transmission cost (CT), and, after having stored the data of two messages whose message identifiers (ID, ISS) are identical and whose sending station identifiers (TSS) are different, comparison of the transmission costs (CT) of the two messages in order to determine the sending station associated with the lowest cost. The invention makes it possible to detect paths in the network.

Abstract: The present invention provides a method of determining or selecting a path for transmitting data in packets in an Internet Protocol communication network and a communication network using the method. The method comprises predetermining a limited number of paths by repeatedly applying a single criterion selection method to all of the paths in the network concerned, using different first criteria, and then determining one or more given paths from said limited number of predetermined paths by comparing them with each other on the basis of two or more conditional criteria and then classifying them.

Abstract: An originating switch (110) in a packet-based telecommunications network (100) routes calls to a terminating switch using the combination of Success-to-the Top (STT) and Class-of-Service criterion. In routing a call to the terminating switch, the originating switch 110 checks for available bandwidth for the class of service of the call on the direct path (116) between switches. If the path has available bandwidth, the originating switch routes on the direct path. Otherwise, the originating switch searches for the most recently successful one of a plurality the via switches (1181-118n) linking the originating and terminating switches to determine whether that via switch can successfully route the call to the terminating switch. If the most recently successful one of the via switches possesses available bandwidth to route the call in accordance with its class of service, the originating switch 110 selects that via switch to route the call.

Abstract: A method of calculating a complex node representation for logical nodes in a hierarchical peer group in a PNNI based ATM network. The summary information for default spokes, exceptions and bypasses is determined in a way that closely represents the underlying metrics associated with the peer group. A list of all border nodes in the peer group is generated and maintained and a matrix of tables is generated, one table for each metric per each class of service. The table is populated by the best value associated with the corresponding metric for a particular pair of border nodes within a particular class of service. Once the table is populated, each element is placed in a group or bin. The bins are generated by dividing the full range of the metric into a plurality of smaller subgroups or bins. The bin having a count greater than a threshold count is selected and 80% of the worst value for that group is used as the default spoke.

Abstract: In a communications network, each network node includes a first module that handles a group of channels between its input and output ports as a route decision unit and a second module that handles a channel between its input and output ports as a route decision unit. A module state database stores module cost data of the first and second modules and a link state database stores link cost data of the links. Using the module and link state databases a route of minimum cost is determined and a connection is established between an incoming link and one of the input ports of the first and second modules and a connection is established between one of the output ports of the first and second modules and an outgoing link. The contents of the module and state databases are broadcast to the network.

Abstract: An apparatus and a method for transferring a packet flow having a plurality of packets in a communication network which includes plural subnetworks, first and second end systems connected to the respective subnetworks and a transit system for relaying the packet and a message between the first and second end systems through a default route, where the packet flow is forwarded from the first end system to the second end system or to a terminal connected to the second end system, in the first end system, determines it by collating the packet with a predetermined criterion whether to forward the packet flow through a shortcut path bypassing the default route and in dependence upon the determining, sends to the second end system through the default route, a request message requesting to set the shortcut path, along with an address of the first end system; in the second end system, requests the communication network to set the shortcut path between the first and second end systems in accordance with the request mes

Abstract: Systems and methods are described for enabling routers to coordinate via a back-channel communication medium. The information exchanged over the back-channel is used to increase the number of paths considered for the routers during route optimization. The Decision Makers may assert routes and prefixes to the routers under their control. This may be done via a Border Gateway Protocol (BGP) feed. The Decision Makers, in turn, communicate separately with one another, in order to coordinate routing policy amongst themselves. This coordination may be performed over a back-channel, which may take the form of physical or logical connections between the Decision Makers.