Abstract: Techniques for single-failure protection in load-balanced network architectures are disclosed. For example, in one aspect of the invention, a technique for processing a traffic flow in a communication network comprising a plurality of nodes, the traffic flow being deliverable from a source node to at least one destination node via one or more intermediate nodes, comprises the following steps/operations. The traffic flow is split at the source node into a plurality of parts. The parts are distributed to respective ones of the intermediate nodes such that the parts are routed from the source node to the at least one destination node in a disjoint manner.

Abstract: Network design techniques and techniques for routing virtually-concatenated data traffic in a network in a manner which distributes delay to intermediate nodes of the network are disclosed. For example, in one aspect of the invention, a technique for routing virtually-concatenated data traffic in a network comprising a plurality of nodes comprises, for a given traffic demand to be routed from a source node to a destination node in the network, the following steps/operations. Two or more paths are determined to route the given traffic demand. Each of the two or more paths correspond to a member of a virtually-concatenated group. At least one path of the two or more paths comprises the source node, the destination node and at least one other node coupled between the source node and the destination node. Further, at least a subset of the source node, the destination node and the one other node buffer at least a portion of the given traffic demand such that a delay is distributed over the at least one path.

Abstract: Techniques for designing networks. The techniques utilize network management-based routing (NMS routing) in conjunction with the planning step (design-based routing) of the design process so that an optimal network may be designed. An automated technique for designing a network may comprise the following steps. First, one or more traffic demands are obtained. Then, a network is computed by determining one or more routes for the one or more traffic demands using a design-based routing methodology based on feedback from a network management-based routing methodology.

Abstract: Techniques are disclosed for designing optical transmission systems that efficiently compute cost-optimal configurations under one or more constraints. For example, in one aspect of the present invention, a technique for designing an optical transmission system comprises the following steps/operations. A set of one or more demands and a set of optical transmission system elements are obtained. Elements may be consecutively coupled via a span. At least one constraint on the design of the optical transmission system is obtained.

Abstract: A fast shared path allocation technique is disclosed. Network nodes are pre-configured such that data from multiple data sources or multiple primary data paths may be sent via a shared secondary data path. Merge nodes merge input from a plurality of input ports onto an output port. The merge nodes implement a blocking function such that upon receipt of a signal from one of the input ports, the signals from the other input ports are blocked from reaching the output port. Upon a triggering event indicating a need to allocate the shared path, the data is first sent to the merge node where it is appropriately merged onto the output link and transmitted towards its destination. Only after the data has been sent does the merge node block the remaining input ports from reaching the output port. This blocking may be performed automatically by the merge node or by conventional network signaling.

Abstract: Virtually-concatenated data traffic is routed in a network comprising a plurality of nodes, the plurality of nodes including one or more nodes that are differential delay enabled and one or more nodes that are not differential delay enabled. For a given traffic demand to be routed from a source node to a destination node in the network, at least one route is determined for routing the demand between an intermediate node that is differential delay enabled and one of the source node and the destination node that is not differential delay enabled. Also, a set of routes is determined for routing the demand between the intermediate node that is differential delay enabled and at least one other node of the network, that may or may not be differential delay enabled, with each of the routes in the set corresponding to a member of a virtually-concatenated group. The given traffic demand is routed from the source node to the destination node, utilizing the at least one route and the set of routes.

Abstract: Multi-path routing techniques using intra-flow splitting are disclosed. For example, a technique for processing traffic flows at a node in a network comprises the following steps/operations. At least one traffic flow is obtained. The at least one traffic flow comprises multiple packets or bytes. The at least one flow is split into at least two sub-flows, wherein each of the at least two sub-flows comprises a portion of the multiple packets or bytes. The packets or bytes of the at least two sub-flows are respectively routed on at least two paths in the network.

Abstract: Techniques and systems for designing a network providing communication and location identification services are described. A solution point comprising parameters for each of a plurality of base stations is generated. A coverage and locatability performance value for the solution point is computed, as well as derivatives of the performance value. The coverage and locatability performance value and its derivatives are used to indicate favorable directions for searching for subsequent solution points, and subsequent solution points are generated and compared against previous solution points until an optimum solution point is found. The coverage and locatability performance value is a weighted sum of coverage and locatability values for each point in the service area of the network, with coverage values representing forward and reverse link quality and locatability values representing the probability that a point will experience an acceptable power level from at least four base stations.

Abstract: A load-balanced network architecture is disclosed in which a traffic flow deliverable from a source node to a destination node via intermediate nodes is split into parts, and the parts are distributed to respective ones of the intermediate nodes. Path delay differences for the parts are substantially equalized by delay adjustment at one or more of the intermediate nodes, and packets of one or more of the parts are scheduled for routing from respective ones of the intermediate nodes to the destination node based on arrival times of the packets at the source node.

Abstract: Personalized location enabled indicators, such as ring backs or ring tones are described. Such capability can be provided by wireless service providers to offer their customers a host of unique location based ring tones and ring backs of both an audio and video nature. By way of example, a first calling party may be provided with a video ring back indicative of location, such as a picture of the Golden Gate Bridge when a second called party is in San Francisco, or a ring tone may indicate a called party is at work and busy, at home and not busy, or the like, with different ring tones for different classes of callers, such as coworkers, family, friends or specified individuals.

Abstract: Techniques for network routing and design are provided. A technique for determining a route for a demand in a network, wherein the network comprises primary paths and secondary paths, and at least two secondary paths may share a given link, comprises the following steps/operations. First, a graph representing the network is transformed. Edges of the graph represent channels associated with paths and nodes of the graph represent nodes of the network. The transformation is performed such that costs associated with the edges reflect costs of using channels in secondary paths. Then, the shortest path between nodes corresponding to the demand is found in the transformed graph. The shortest path represents the least-cost path in the network over which the demand may be routed. When the above route determination steps/operations result in a path with at least one loop, an alternative routing process may be executed so as to determine a loopless path for the demand.

Abstract: A load-balanced network architecture is disclosed in which a traffic flow at a given network node is split into a plurality of parts, and the parts are distributed to respective ones of the plurality of nodes that are designated as participating in a load balancing process for the traffic flow. Each of at least a subset of the participating nodes receiving one of the parts routes at least a portion of its received part to one or more destination nodes.

Abstract: A method for location tracking on a distributed basis using multiple locations, which utilizes a pairwise application of distance constraints and vicinities for determining locations. The location of a particular node is represented by a group of points (as opposed to a single point) defined by the vicinity.

Abstract: An alert-me management system for a telecommunications infrastructure and a method of providing an alert-me service. In one embodiment, the system includes: (1) distributed alert-me request servers configured to receive and aggregate alert-me requests pertaining to uniquely identified wireless terminals from calling parties and (2) an alert-me service manager configured to receive the alert-me requests from the distributed alert-me request servers, further aggregate the alert-me requests into a table based on the uniquely identified wireless terminals, generate status checks for the uniquely identified wireless terminals and respond to the distributed alert-me request servers with positive alert-me indications to prompt the distributed alert-me request servers to generate alerts to the calling parties.

Abstract: Techniques for designing networks. The techniques integrate the planning and configuration steps of the design process so that an optimal network may be designed. An automated technique for designing a network may comprise the following steps. First, a set of nodes and a set of links with which network equipment may be deployed, and one or more traffic demands are obtained. Then, a network is computed by determining one or more routes for the one or more traffic demands while querying at least a portion of the network equipment to determine a cost for using said equipment to route the one or more traffic demands such that said cost is considered when determining the one or more routes. The network equipment may be queried via one or more application programming interfaces.

Abstract: An apprising system and a method of apprising are set forth for use with a cellular telephone to apprise a user of the cellular telephone of a spontaneous occurrence. In one embodiment, the apprising system includes: (1) a matching subsystem that compares a location of the cellular telephone to an area associated with an occurrence and (2) an informing subsystem that notifies a user of the cellular telephone of the occurrence based on the compares.

Abstract: Techniques for designing networks. The techniques utilize network management-based routing (NMS routing) in conjunction with the planning step (design-based routing) of the design process so that an optimal network may be designed. An automated technique for designing a network may comprise the following steps. First, one or more traffic demands are obtained. Then, a network is computed by determining one or more routes for the one or more traffic demands using a design-based routing methodology based on feedback from a network management-based routing methodology.

Abstract: A fast shared path allocation technique is disclosed. Network nodes are pre-configured such that data from multiple data sources or multiple primary data paths may be sent via a shared secondary data path. Merge nodes merge input from a plurality of input ports onto an output port. The merge nodes implement a blocking function such that upon receipt of a signal from one of the input ports, the signals from the other input ports are blocked from reaching the output port. Upon a triggering event indicating a need to allocate the shared path, the data is first sent to the merge node where it is appropriately merged onto the output link and transmitted towards its destination. Only after the data has been sent does the merge node block the remaining input ports from reaching the output port. This blocking may be performed automatically by the merge node or by conventional network signaling.