Abstract: Disclosed herein are system, method, and computer program product embodiments for optimal placement of aggregator equipment in telecommunication networks. An embodiment operates by receiving, as an input, information corresponding to resource capacity of the one or more types of aggregator units and resource demands generated by a plurality of access nodes. The embodiment then calculates, based on the input, an optimized traffic aggregation configuration comprising an optimized group of one or more types of traffic aggregator units. Next, the embodiment modifies, based on the optimized traffic aggregation configuration, a network connectivity configuration corresponding to a plurality of network sites. Finally, the embodiment routes network traffic, via the optimized group of one or more types of traffic aggregator units, based on the modified network connectivity configuration.

Abstract: Disclosed herein are system, method, and computer program product embodiments for optimal placement of aggregator equipment in telecommunication networks. An embodiment operates by determining an optimized traffic aggregation configuration based on execution of a network optimization function. The embodiment executes the network optimization function by receiving, as an input, information corresponding to resource capacity of the one or more types of aggregator units and resource demands generated by the plurality of access nodes, calculating an estimated number of each type of traffic aggregator unit of the one or more types of traffic aggregator units, and calculating the optimized traffic aggregation configuration.

Abstract: Session data for sessions associated with user equipment in portions of a macrocellular coverage area is accessed and a hierarchical data structure including a plurality of levels is generated. Each entry in a higher level of the plurality of levels encompasses a predetermined number of entries in the next lower level and stores aggregated session data for sessions associated with the encompassed entries. Entries in the hierarchical data structure can be selected to represent a hotspot that overlays the macrocellular coverage area. Session data stored in the selected entries can be aggregated.

Abstract: To effectively plan small cell placement within a current macro cell network, it is necessary to identify the traffic hotspots. Small cells can be placed in hotspot locations in order to effectively offload traffic from the corresponding macro cell. Hotspots can be identified based on information about traffic from/to mobile users, particularly, the observed User Equipment (UE) locations and amount of data transmitted from/to the UEs. Provided are systems and methods for accounting for geo-location errors in identifying hotspots and determining small cell placement.

Abstract: Session data for sessions associated with user equipment in portions of a macrocellular coverage area is accessed and a hierarchical data structure including a plurality of levels is generated. Each entry in a higher level of the plurality of levels encompasses a predetermined number of entries in the next lower level and stores aggregated session data for sessions associated with the encompassed entries. Entries in the hierarchical data structure can be selected to represent a hotspot that overlays the macrocellular coverage area. Session data stored in the selected entries can be aggregated.

Abstract: To effectively plan small cell placement within a current macro cell network, it is necessary to identify the traffic hotspots. Small cells can be placed in hotspot locations in order to effectively offload traffic from the corresponding macro cell. Hotspots can be identified based on information about traffic from/to mobile users, particularly, the observed User Equipment (UE) locations and amount of data transmitted from/to the UEs. Provided are systems and methods for accounting for geo-location errors in identifying hotspots and determining small cell placement.

Abstract: In an IPTV network, one or more caches may be provided at the network nodes for storing video content in order to reduce bandwidth requirements. Video content titles may be stored in the cache in accordance with a calculated cache arrangement that minimizes the total incremental transport cost of the content traffic.

Abstract: An apparatus and method for producing a traffic aggregation map for a telecommunications network where the network has at least one aggregation node and a plurality of access nodes. A computing device receives information regarding the identity of each node in the network and determines cost information relating to pairs of the nodes. The cost information may be calculated by the computing device or received as input, or a combination of the two. Cost information is also assigned for each pair consisting of an aggregation node and a super node, which is not one of the aggregation or access nodes. To produce the map, the computing device calculates a minimum spanning tree interconnecting all of the nodes including the super node. Disregarding in most cases the connections terminating at the super node, the remaining connections are displayed on a display device, preferably superimposed on a geographic map.

Abstract: In an IPTV network, cache memory assigned to each DSLAM, Central Office (CO) or Intermediate Office (IO) can be determined by defining a network cost function having cache memory per DSLAM, cache memory per CO and cache memory per IO as decision variables. The network cost function can be minimized to determine the optimal cache memory size for the network. The network cost function can be subject to boundary constraints that the cache memory is between zero and a maximum cache memory size for each network node type, allowing the network cost function to be solved as a 3-ary tree.

Abstract: An algorithm is disclosed for performing alien-wavelength channel balancing on channels between optical network elements within an optic-fiber communications system. The algorithm determines initial values of various optimization parameters for each of the channels, such as the input launch power and operating conditions of optical amplifiers in the optical path, and calculates an initial total optimization offset for the channels based on the initial values of the optimization parameters for each of the channels. The algorithm then adjusts the optimization parameters to new values and calculates a new total optimization offset based on the new optimization parameter values. The algorithm repeats this process until the relative channel launch powers and optical amplifiers are optimized.

Abstract: In an IPTV network, one or more caches may be provided at the network nodes for storing video content in order to reduce bandwidth requirements. Cache functions such as cache effectiveness and cacheability may be defined and optimized to determine the optimal size and location of cache memory and to determine optimal partitioning of cache memory for the unicast services of the IPTV network.

Abstract: In an IPTV network, one or more caches may be provided at the network nodes for storing video content in order to reduce bandwidth requirements. Video content titles may be stored in the cache in accordance with a calculated cache arrangement that minimizes the total incremental transport cost of the content traffic.

Abstract: In an IPTV network, cache memory assigned to each DSLAM, Central Office (CO) or Intermediate Office (IO) can be determined by defining a network cost function having cache memory per DSLAM, cache memory per CO and cache memory per IO as decision variables. The network cost function can be minimized to determine the optimal cache memory size for the network. The network cost function can be subject to boundary constraints that the cache memory is between zero and a maximum cache memory size for each network node type, allowing the network cost function to be solved as a 3-ary tree.

Abstract: In an IPTV network, one or more caches may be provided at the network nodes for storing video content in order to reduce bandwidth requirements. Cache functions such as cache effectiveness and cacheability may be defined and optimized to determine optimal partitioning of cache memory for caching the unicast services of the IPTV network.

Abstract: An algorithm is disclosed for performing alien-wavelength channel balancing on channels between optical network elements within an optic-fiber communications system. The algorithm determines initial values of various optimization parameters for each of the channels, such as the input launch power and operating conditions of optical amplifiers in the optical path, and calculates an initial total optimization offset for the channels based on the initial values of the optimization parameters for each of the channels. The algorithm then adjusts the optimization parameters to new values and calculates a new total optimization offset based on the new optimization parameter values. The algorithm repeats this process until the relative channel launch powers and optical amplifiers are optimized.

Abstract: This is a system and method for optimally allocating multi-service traffic concentrators in telecommunications network. A problem model representing the telecommunications network topology is formulated and input to a linear programming algorithm for an optimal solution. In the model, data set indices are defined as those components and/or factors in the telecommunications network which affect various operations of the network, and include origination, concentration, and destination sites as well as different multiplexer levels at each of the sites. Decision variables representing measure of efficiency in the network and whose optimal values are to be computed by the linear program are defined to include concentrator node selection, concentrator to destination site connection status, and the number of optical carrier trunks for each concentrator. The values for each of the three variables provide the equipment quantity for optimally allocating multi-service traffic concentrators.

Abstract: A method of monitoring the quality of a communication system is described. A first telephone user initiates a telephone call with a second telephone user. The service provider connects the first telephone user with the second telephone user so that the telephone conversation can be conducted. Upon completion of the telephone conversation, a quality survey is automatically conducted with at least one of, and preferably both, of the telephone users.

Abstract: A method of optimizing a network includes a plurality of nodes interconnected by high multiplex level links, in which at least some of the links carry a number of low multiplex level remaining demands that is less than the capacity of the links, by rerouting lower multiplex level remaining demands through the network to reduce the total number of higher multiplex level links in the network. The method eliminates from consideration any bridges and spurs in the network, thereby forming one or more connected components of the network. After the spurs and bridges have been eliminated from consideration, the method reroutes remaining low multiplex level demands through each of the remaining connected components of the network to reduce the total number of high multiplex level links in each remaining portion.

Abstract: A method of and a system for performing computer simulations to determine a number of blocked calls resulting from cutting selected spans in a telecommunications network with selected levels of overtrunking to determine a level of overtrunking necessary to make the number of block calls resulting from a cut span less than a blocked call threshold. The method forms a capacity demand matrix based on a selected level of overtrunking. The capacity demand matrix reflects a circuit capacity between each pair of origination nodes and destination nodes of the network prior to a cut span. The method forms updated capacity demand matrices that reflect the circuit capacity between each pair of origination nodes and destination nodes of the network after a cut span with various levels restoration. The method runs a call simulation program with data from the updated capacity demand matrices to determine the number of blocked calls resulting from said cut span.

Abstract: A method of selecting an optimal set of spans for fiber cut simulations for a network carrying a plurality of demand-routes between a plurality of nodes interconnected by a plurality of fiber spans includes the steps of selecting from the plurality of spans a set of critical spans and selecting from the set of critical spans a minimal set of critical spans.