Abstract: A network is represented using a graph. The graph comprises a plurality of vertices and a plurality of edges. The vertices comprise a source vertex, a destination vertex and a vertex u. The edges link corresponding adjacent pairs of the vertices. A minimum cost path in the graph is determined from the source vertex to the destination vertex, wherein the vertex u is in the minimum cost path. An edge from the vertex u in the minimum cost path introduces an additional capital expenditure cost that is dependent on how the minimum cost path traverses from the source vertex to the vertex u.

Abstract: A system includes a capacity management tool. The capacity management tool is configured to be coupled to one or more of an application layer, a physical layer, and a transport layer of a processor-based network. In a particular embodiment, the capacity management tool is further configured to extract data from one or more of a network connectivity database, a customer provisioning and services ordered database, a customer equipment database, a network element management system database, and a server and application management system database. The capacity management tool can be further configured to correlate the data to manage the capacity of the network or isolate congestion points in the network.

Abstract: A distributed network including at least two Reconfigurable Optical Add/Drop Multiplexers (ROADMs) may be designed by a method including simulating routing of data traffic in a distributed network. The method may also include identifying a first location for placement of a first ROADM based at least partially on the simulated routing of the data traffic. The method may also include simulating rerouting of data traffic in the distributed network including the first ROADM at the first location. The method may further include identifying a second location for placement of a second ROADM based at least partially on the simulated rerouting of the data traffic.

Abstract: A method including receiving data packets encapsulating at least part of a media stream, extracting a decoder-ready packet from the data packets, processing the decoder-ready packet; and substantially synchronously with the processing of the decoder-ready packet, generating delivery performance information for the at least part of the media stream, data from which is included in the decoder-ready packet.

Abstract: Various embodiments of the disclosed subject matter provide apparatus, methods, and systems including an input to receive data associated with a channel viewership of a network; a distribution unit coupled to the input, the distribution unit to determine one or more relative viewership distributions based on the data; and a configuration unit coupled to the distribution unit, the configuration unit to provide one or more reconfiguration settings for one or more reconfigurable servers coupled to the network.

Abstract: Various embodiments of the disclosed subject matter provide methods and systems to automatically identify preferred distributed programming content based on subscriber-specific profile information generated at least in part from a subscriber's viewing history of viewing broadcast television programs delivered via a television distribution system, automatically store information indicative of the identified preferred distributed programming content, and generate a personalized list of the identified preferred distributed programming content, the personalized list, displayed on initial activation of a video system, including at least one image of the identified preferred distributed programming content.

Abstract: Various embodiments of the disclosed subject matter provide methods and systems to automatically identify popular television programs based on the viewing of broadcast television programs by at least some of the subscribers of a television distribution system. One or more of the popular television programs identified are stored and offered to one or more of the subscribers on-demand. Subscribers can obtain delivery of at least one of the stored popular television programs for viewing on a subscriber television.

Abstract: The disclosure provides a system and method for providing a service in a packet-switched network at a selected Quality of Service (QoS) level. The method includes receiving a request for a service from a customer gateway at server connected to the packet-switched network; correlating the requested service to available network resources; and enabling the network to provide the requested service based on a result of the correlation.

Abstract: A global positioning satellite device is dynamically provisioned. Global positioning satellite device provisioning information is received for at least one specified location from an information source over a communications network. The received global positioning satellite device provisioning information is transferred to the global positioning satellite device.

Abstract: An Internet Protocol (IP) usage pattern of a first computer system is monitored by a second computer system remotely located from the first computer system. Based on the monitoring, it is determined if the IP usage pattern is abnormal for the first computer system. If the IP usage pattern is abnormal, an alert signal is generated for the first computer system by the second computer system. The alert message indicates a potential presence of parasite software on the first computer system.

Abstract: Error codes output from a serializer/deserializer in a node of a communications network are detected by error decode logic that assumes that each new error occurrence reflects a one bit error in the word giving rise to the error code. Each error occurrence is then counted. When the error count reaches a predetermined limit (e.g., 250 errors), the total bit count required to accumulate the 250 errors is then determined. The total bits can be determined based on a clock count (time). The BER is then calculated based upon the fixed error limit and the total bit count. This BER is then reported and used to determine the health of the network.

Abstract: The disclosed network includes two rings, wherein a first ring transmits data in a clockwise direction, and the other ring transmits data in a counterclockwise direction. The traffic is removed from the ring by the destination node. During normal operations (i.e., all spans operational), data between nodes can flow on either ring. Thus, both rings are fully utilized during normal operations. The nodes periodically test the bit error rate of the links (or the error rate is constantly calculated) to detect a fault in one of the links. The detection of such a fault sends a broadcast signal to all nodes to reconfigure a routing table within the node so as to identify the optimum routing of source traffic to the destination node after the fault. Since the available links will now see more data traffic due to the failed link, traffic designated as “unprotected” traffic is given lower priority and may be dropped or delayed in favor of the “protected” traffic.

Abstract: Error codes output from a serializer/deserializer in a node of a communications network are detected by error decode logic that assumes that each new error occurrence reflects a one bit error in the word giving rise to the error code. Each error occurrence is then counted. When the error count reaches a predetermined limit (e.g., 250 errors), the total bit count required to accumulate the 250 errors is then determined. The total bits can be determined based on a clock count (time). The BER is then calculated based upon the fixed error limit and the total bit count. This BER is then reported and used to determine the health of the network.