Abstract: Systems and methodologies are described that facilitate computing discriminator signals for frequency tracking in wireless communications. The discriminator signal can be computed based at least in part on representations of a received signal shifted upward by a portion of a frequency tone and downward by the portion of the frequency tone. The shifted signals can be summed, and a dot product of the summed signals and a channel estimation of the original signal can be computed to remove uncertain frequency response due to fading. The discriminator signal can be computed as the imaginary portion of the dot product. A frequency error offset can be determined from the discriminator signal and applied to a receiver to tune alignment of the receiver with frequencies of received signals.

Abstract: A base round trip time (RTT) for a path in a network is determined. The RTT along a network path between a source node and a destination node is measured one or more times. A sample set of fitting parameters based on a distribution of historical queue delays is obtained. A Monte Carlo simulation is performed using the fitting parameters in the sample set to generate a distribution of queue delays for the measured network path. A base RTT for the network path is determined using the measured RTT and the distribution of queue delays.

Abstract: A system, apparatus, and method are directed towards managing traffic over a network by imposing temporal delays in acknowledgments (ACKs). A Traffic Management Device (TMD), interposed between two network session end-points monitors a buffer of relayed packets. If the contents of the buffer exceed a threshold value, delays are imposed on sending of acknowledgements. If the buffer contents exceed the threshold, and the buffer's contents are increasing, the delays may be increased. If the buffer's contents are about at steady state, the acknowledgement delays may be decreased, or maintained at a current delay status. In one embodiment, if the sender is sending packets at a rate above a receiver's ability to receive the packets, and the sender appears not to be decreasing its rate of transmission, an explicit congestion notification echo (ECE) may be sent to the sender.

Abstract: A system for combining a plurality of video streams includes a time stamp adjustment module that generates an adjusted second video stream by adjusting a plurality of time stamps of a second video stream. A video stream concatenation module generates a combined video stream by concatenating the adjusted second video stream to an end of a first video stream.

Abstract: The invention relates to data sources for a deterministic communications system comprising data sources, which can be connected to a data sink by means of at least one coupling node. Said system comprises a means of controlling the data sources to achieve a planned, deterministic communication between said data sources and the data sink.

Abstract: The present invention provides a system and method of modifying policy settings in a network having a plurality of subscriber devices. An embodiment includes a plurality of base stations, each capable of wirelessly transmitting across a geographic region. A cell-phone, capable of roaming between regions is operable to establish a wireless link with the base stations. The network contains a communication policy determining from which other communication devices a subscriber device can receive voice calls. A copy of this policy is stored on each subscriber device as a database and periodically updated as the devices make contact with the base stations or other subscriber devices. When receiving a voice call, the device first determines who the originator of the call is and then determines whether it is allowed to receive the call from that originator according to its policy database. The policy database can be updated either by subscriber devices or by base stations.

Abstract: Techniques for computing a path for a local repair connection to be used to protect a connection traversing an original path from an ingress node to an egress node. The computed path originates at a node (start node) in the original path and terminates at another node (end node) in the original path that is downstream from the start node. A Constraint Shortest Path First (CSPF) algorithm may be used to compute the path. The computed path is such that it satisfies one or more constraints and does not traverse a path from a first node in the original path to a second node in the original path, wherein the first and second nodes are upstream from the start node in the original path and the second node is downstream from the first node in the original path. A local repair connection may then be signaled using the computed path.

Abstract: Systems, methods, and other embodiments associated with monitoring a server port in a server network environment are described. In one embodiment, a graphical user interface (GUI) allows server port(s) to be selected for monitoring. The GUI also allows for an uplink port to be selected, where the uplink port is a port that may be connected to a network analyzer. In response to the selections, a virtual local area network (VLAN) is created to establish communication between the selected server port(s) and the selected uplink port. Network traffic that passes through the selected server port(s) can then be duplicated and transmitted through the VLAN to the selected uplink port to be monitored and analyzed by a network analyzer connected to the uplink port.

Abstract: A network method utilizing Session Initiation Protocol to establish a network path between network elements in a network includes generating a request for a network service in Session Initiation Protocol, wherein the request is one of manually and automatically configured, and wherein the request is directed to the network; obtaining network resources responsive to the request, wherein the network resources comprise network parameters required to obtain and provision the network path; and configuring the network resources responsive to the request. The network includes a plurality of network elements operable to receive Session Initiation Protocol requests. Optionally, the plurality of network elements include a plurality of optical network elements, wherein the network route includes wavelengths between a first and second optical network element in the network.

Abstract: The present invention relates to data packet traffic congestion solving mechanism in a node of a Radio Access Network (RAN), said mechanism is capable of blocking the transmission of data packets between a user terminal (UT) and said node in both uplink and downlink directions, if a created blocking table indicates for a scheduler that said user terminal has been determined to have been idle for more than a pre-determined time.

Abstract: The claimed subject matter provides systems and/or methods that discover comparative differences in performance of Internet Service Provider networks. The system can include devices, components, and/or processes that partitions measurement processes into cycles and measures at least one Internet Service Provider network every cycle, develops and distributes to interrogation nodes a list of destination Internet Protocol (IP) addresses to interrogate, and utilizes results delivered or retrieved from interrogation nodes to generate a report on the comparative performance of Internet Service Provider networks queried.

Abstract: Provided are methods and apparatus that enforce zoning rules by separately employing source and destination information. In certain embodiments, information uniquely identifying network destinations is provided on a destination CAM. In these embodiments, each destination identified in the destination CAM has an associated zoning decision vector provided in a results memory. The vector provides specific zoning decisions (permit or deny transmission) for specific sources on the network. The specific zoning decision to be applied to a frame under consideration is selected from a zoning decision vector by using source information taken from the frame.

Abstract: Techniques for providing layer 4 transparent secure transport for end-to-end application protection are described herein. According to one embodiment, a packet of a network transaction is received from a client over a first network, where the packet is destined to a server of a data center having a plurality of servers over a second network. The packet includes a payload encrypted without encrypting information needed for a layer 4 of OSI (open system interconnection) layers of network processes. The layer 4 process is performed on the packet without having to decrypting the payload to determine whether the packet is eligible to access the destined server over the second network based on the unencrypted layer 4 information. Other methods and apparatuses are also described.

Abstract: A packet switch includes an arbiter that generates an availability signal indicating whether one or more pseudo-ports are available for receiving data. Each pseudo-port identifies one or more output ports of the packet switch. An input port of the packet switch receives data of a data packet, generates a grant request identifying a pseudo-port, and issues the grant request to a grant request filter. The grant request filter determines based on the availability signal whether the grant request is serviceable by the packet switch. If the grant request is a serviceable grant request, the grant request filter issues the grant request to the arbiter. The arbiter can select the serviceable grant request and issue a grant to the input port. The data of the data packet can then be routed from the input port to each output port identified by the pseudo-port.

Abstract: A method and system for recovering from service failure, and the method includes: sending, by a failure detecting node of a cross-domain connection service, a CALL_ID (Call Identifier) that identifies the cross-domain connection service and information on a disabled link in the cross-domain connection service to a first node of the cross-domain connection service, and performing, by the first node of the cross-domain connection service, an end-to-end connection recovery on a corresponding cross-domain connection service according to the CALL_ID and the information on the disabled link. According to the invention the end-to-end connection recovery of the cross-domain connection service can be implemented and the viability of the cross-domain connection service can be improved.

Abstract: A lightweight probabilistic mechanism used to estimate the number of active flows, which estimate is used to determine the probability of admitting a new flow into the network. In one embodiment, a method for controlling admission of new flows at a node in a network of nodes interconnected by links includes: (a) for each of a plurality of incoming packets arriving at the node, each incoming packet corresponding to an active flow traversing the node: (a1) randomly selecting a packet from an output buffer of the node; (a2) determining whether the incoming packet is from the same active flow as the randomly-selected packet; and (a3) updating an estimate of the number of active flows traversing the node based on the determination of step (a2); and (b) determining whether to admit or drop part or all of a new flow at the node based on the estimated number of active flows traversing the node.

Abstract: A communication device includes a communication unit having plural function operation units performing communication with an external device at plural prescribed communication speeds, and a control unit allowing the communication unit to receive a given kind of content data from the external device, estimating an optimum prescribed communication speed in which the power consumption amount becomes smallest from the plural prescribed communication speeds based on a bit rate of the content data, selecting a given function operation unit from the plural function operation units based on the estimated optimum communication speed, allowing the selected function operation unit to receive the given kind of content data at the estimated prescribed communication speed and controlling power consumption to the function operation units other than the function operation unit selected from the plural function operation units to be less than a fixed value.

Abstract: If a condition in a data transfer path is modeled appropriately, then a filter-based approach can be used to provide an estimate of the condition. This permits accurate, real-time estimates of the condition with modest requirements for data processing and memory resources. Change detection can be implemented to control a parameter of the filter.

Abstract: A technique dynamically resizes Traffic Engineering (TE) Label Switched Paths (LSPs) at a head-end node of the TE-LSPs in preparation to receive redirected traffic in response to an event in a computer network. The novel dynamic TE-LSP resizing technique is based on the detection of an event in the network that could cause traffic destined for one or more other (“remote”) head-end nodes of one or more TE-LSPs to be redirected to an event-detecting (“local”) head-end node of one or more TE-LSPs. An example of such a traffic redirection event is failure of a remote head-end node or failure of any of its TE-LSPs. Specifically, the local head-end node maintains TE-LSP steady state sampling and resizing frequencies to adapt the bandwidth of its TE-LSP(s) to gradual changes in the network over time.

Abstract: A networking system may include one or more nodes communicating with each other. The nodes may communicate via one or more links, which a switch or other structure may provide. The networking system may include one or more pools of at least one network diagnostic module. A network diagnostic module may test one or more links and may be configured to rove among a plurality of links. The networking system may include an alarm module.