Abstract: The present invention discloses a network abnormal traffic analysis method, which calculates a set of index values of a monitored server based on the acquired IP network data, performs a primary detection on the calculated set of index values to generate vector corresponding to the set of index values, and performs a secondary detection on the vector to determine whether abnormal traffic and abnormal types related to the monitored server exist. The present invention also relates to a network abnormal traffic analysis apparatus related therewith and a network traffic monitoring system and method adopting these network abnormal traffic analysis method and apparatus.

Abstract: Includes a method that determines utilization of a link and determines a weight for the link based on an energy metric for the determined utilization. The method also includes transmitting the determined weight to at least one node adjacent in the network to the network forwarding device, and determining forwarding based on the transmitted weight.

Abstract: A multimedia server includes a first transceiver that modulates a data signal to produce a first radio frequency (RF) signal and that transmits the first RF signal to a client over a first transceiver channel when the first transceiver is in a transceive mode. The first transceiver includes a first channel control that performs a first channel scan when the first transceiver is in a scan mode, that determines at least one performance parameter of the first transceiver channel and asserts a low performance signal when the at least one performance parameter compares unfavorably to a performance threshold, and that switches the first transceiver to a selected alternative transceiver channel when the low performance signal is asserted.

Abstract: A branch exchange comprises at least one interface module coupled to a plurality of telecommunication connections including a first telecommunication connection and a second telecommunication connection. A converter is coupled to the at least one interface module and a network interface controller (NIC). The converter is configured to communicate at least one time division multiplexed (TDM) data stream between the converter and the at least one interface module. The converter is further configured to packetize data from one of the telecommunication connections into a first plurality of data packets transmitted to the NIC by the converter. A branch exchange manager is configured to receive the data from the NIC and cause the data to be transmitted over the second telecommunication connection.

Abstract: A network system includes a connectivity services network (CSN), a plurality of access service network gateways, a plurality of base stations, an orchestration device, executing a lifecycle quality-of-experience model for video-on-demand flows, receiving content from the CSN, and a plurality of subscriber stations in communication with the orchestration device through a base station and/or gateway, wherein the orchestration device continuously tracks past service and usage for each of the subscriber stations and predicts future channel conditions and load to determine, periodically or when triggered by critical events, many-to-one assignments from subscriber stations to base stations and allocation of base station resources to subscriber stations assigned to it.

Abstract: A Voice over Internet Protocol (VoIP) terminal has a Quality of Service (QoS) monitoring function and uses a QoS monitoring method. In a VoIP system performing real-time voice communication over an IP network, a packet loss value and a time-axis index value are detected, and are calculated from a real-time transport protocol (RTP) packet and an RTP control protocol (RTCP) packet, a QoS state value of the network is obtained in real time, the detected QoS state value is compared to a preset QoS state table, and thus a QoS state of the IP network is displayed for users.

Abstract: A mechanism is provided to determine an average rate of duplicate packets per connection for packets received by a node over an interface. The mechanism selects a connection from the connections established over the interface, determines that a rate of duplicate packets for the selected connection exceeds the average rate of duplicate packets by a threshold percentage, and sends a message to a transmitter of the duplicate packets over the connection to increase a timeout interval to retransmit packets.

Abstract: A method, apparatus, and computer program product for responding to congestion levels in a communication system by rate adaptation. A congestion condition is indicated by marking data packets. In response to receiving an indication of congestion, a data rate is reduced. A rate reduction inhibit timer is started, and further rate reduction is initiated if congestion is indicated after the rate reduction inhibit timer has expired. A rate increase timer is used to initiate a rate increase if no indication of congestion is received during a rate increase time.

Abstract: Video traffic smoothing may be provided. A video stream may be divided into segments for transmission. For each segment, a desired transmission rate and a range of possible transmission rates may be established. The desired transmission rate may be evaluated to determine whether the rate may result in an overflow and/or a starvation of a memory buffer associated with a receiver. The transmission rate and/or the segment size may be varied to avoid these scenarios.

Abstract: Dynamic rate limiting of background traffic to alleviate congestion in the access network is enabled. ICMP echo round-trip times and ICMP losses to a nearby node outside the local area and just beyond the divergence in end-to-end paths are measured, allowing unambiguous discrimination of nearby from distant congestion points. Using round-trip time samples, either short-run delay or short-run variance in delay can be measured to estimate congestion. When combined with an appropriate control law, background traffic can be rapidly reduced to allow interactive traffic to traverse unhindered through the access network. The described system and methods can be implemented in the application-layer and without any additional support from the network.

Abstract: A system comprises a base station, a plurality of mobile stations, and a packet scheduling algorithm that operates on the base station. The packet scheduling algorithm groups the plurality of mobile stations into a plurality of groups based on average throughput with the base station. The packet scheduling algorithm selects one of the plurality of groups for applying a scheduling metric.

Abstract: Methods are provided for managing hierarchically organized subscriber profiles. According to one embodiment, a connection for a subscriber is created based on a service context of the subscriber. A connection request is received from a subscriber of a network service delivery environment. The subscriber is associated with a first-level profile identifier indicative of a service context for the subscriber. One or more other subscribers can be associated with the first-level profile identifier. Lower-level profile identifiers are determined using the first-level profile identifier. The lower-level profile identifiers indicate a set of services that is available to the subscriber during the connection. Creating a connection for the subscriber that enables forwarding of packets based on the lower-level profile identifiers.

Abstract: Disclosed herein are various embodiments of collision avoidance systems and methods. One method embodiment, among others, comprises a client sending an end of transmission (EOT) request to an access point (AP), and responsive to the EOT request, the AP responding with an EOT frame.

Abstract: A method for transferring time-synchronous data, particularly voice and video data, over a network, particularly the Internet, between at least two terminals, where between the terminals a connection is established using a SIP server and where the SIP protocol is used for establishing the connection, is—with respect to high Quality of Service for transferring time-synchronous data and with a technically simple and cost effective design—developed in a way that the SIP server analyzes the connection and/or the terminals or the like and that based on the analysis it determines an ideal bandwidth for optimizing the transfer of time-synchronous data.

Abstract: A method for transmitting and downloading streaming data is disclosed. The method comprises (a) establishing connections with a plurality of nodes; (b) sending a request for sub blocks of streaming data to the plurality of nodes where connection is established to download the sub blocks; (c) monitoring download state of the established connections; and (d) redistributing sub Blocks to be downloaded from some of the nodes where connection is established according to the monitoring results; wherein, the step (b) to step (d) are repeated for downloading sub blocks included in next block when all sub Blocks included in a block are downloaded.

Abstract: Systems and methods of automatically determining a set of route targets is provided. The method includes receiving network topology data specifying configuration of a network. The method also includes automatically converting the network topology data into route targets to be assigned to virtual routing and forwarding elements. The route targets are grouped into sets and duplicate sets of route targets are removed based on the route targets between duplicate sets of route targets identified as being the same. The method further includes generating a data record including information related to the set of route targets.

Abstract: In a packet switched communications transport network a method for re-routing traffic flow is provided. The invention based on the recognition of actual utilization of transport resources. In accordance with the implementation, Fast Re-Route detour paths are recalculated each time after new bandwidth information is received. The detours are re-established on new computed paths if needed, i.e., if an optimized path has been found. A node and a system are also disclosed, referring to MPLS network. Also a node is described acting as a Point of Local Repair for link failures. The node comprises a Routing engine, a Link state database, a Detour path calculator and a Detour path establisher in order to capture bandwidth information of the network links and to calculate detour path information for the nodes.

Abstract: An apparatus, method, and machine-readable medium are described for establishing peer-to-peer (“P2P”) communication channels. In particular, in one embodiment, a matchmaker service performs a series of operations to service match requests received from a group of mobile devices. In one embodiment, the matchmaker service groups the match requests into matchable sets based on the application for which the requests are received and one or more variables associated with the application. Match requests within each match set can then be matched based on variables such as the NAT type, connection type and language associated with each of the mobile devices. Other variables such as geographical location, experience level, and age of the match requests may also be used to render match decisions.

Abstract: A method for packet filtering can include establishing at least one policy in a centralized policy management framework (PMF), wherein the policy includes at least one policy condition, monitoring data traffic, determining if the data traffic at least substantially meets one of the policy conditions, sending a trigger to the PMF, if at least one of the policy conditions is at least substantially met, generating an enforcement decision at the PMF, wherein the enforcement decision includes at least one enforcement action, sending the enforcement decision to an enforcement function, and enforcing the enforcement decision. A policy-enabled deep packet inspection system also is disclosed.

Abstract: For each one of a plurality of broadcast control channels, a mobile device measures a signal strength level of a radio frequency (RF) signal from a wireless communication network. The mobile device then repeats the measuring at least one time so that at least one other signal strength level of the RF signal on the broadcast control channel is identified. The mobile device also receives and decodes information which is broadcasted on the broadcast control channel, and stores this broadcasted information in memory. The acts of receiving, decoding, and storing are performed after measuring the signal strength level of the RF signal, but prior to completion of an averaging function for calculating an averaged signal strength level of the signal strength levels.

Abstract: A system for determining a requirement in a converged communication system is provided. The system includes a network analyzer 108 that is operable to: (a) determine a packet-switched port usage for at least one of (i) a set of packet-switched stations, (ii) a set of packet-switched trunks, and (iii) a set of packet-switched communications, and a circuit-switched port usage for at least one of (iv) a set of circuit-switched stations, (v) a set of circuit-switched trunks, and (vi) a set of circuit-switched communications in at least a portion of an enterprise network; and (b) based on the determined packet-switched and circuit-switched port usages, determine a functional component requirement to comply with a selected communication specification.

Abstract: By introducing a novel parameter common to all links along the entire multihop route it is possible to more flexibly allocate, for each of a number of the links, a set of three interdependent link transmit parameters representative of link transmit energy, link transmit time or link transmit bandwidth or link code word consumption, and link transmit power. Basically, the common parameter is determined based on a given end-to-end (ETE) transmit parameter constraint for the entire multihop route. The idea is then to assign or allocate, for each considered link, the three interdependent link transmit parameters based on the common parameter and local link characteristics. In this way, all three link transmit parameters may (and generally will) be different between at least two links on the route when the links have different link characteristics, assuming that each link transmit parameter is also dependent on the local link characteristics.

Abstract: The allocation of network resources, such as bandwidth, etc., can be dynamically adjusted based on the knowledge of the traffic volume, the transport protocol used by the payload and entitled level of services. The type of transport protocol can be determined by monitoring and analyzing characteristics of the data traffic. The frames or packets over a particular channel are monitored to identify the time between frames for a particular period of time. This time then can be used to calculate a recent average time. The timing of subsequently received frames can then be compared to this average to determine if the transport protocol is UDP, TCP or some other protocol. In other embodiments a recent average throughput can be calculated and be compared to a current throughput. This information, along with the load and entitled level of service is used to control the network resources.

Abstract: A device for adjusting a set of primary rate limits for transmission rates of data flows having a certain priority in a transmitter is provided, wherein data flows of different priorities including said certain priority are transmitted by a port of the transmitter. The transmission of the data flows having the certain priority is limited by secondary rate limits per data flow and by a transmission or flow control per priority. The device comprises a determiner and a number of adjusters. The determiner is configured to determine a mean value of a duty cycle of the certain priority at the port provided by the transmission or flow control. The adjusters are configured to adjust the primary rate limits for the transmission rates of the data flows having the certain priority based on the determined mean value of the duty cycle to obtain the secondary rate limits.

Abstract: An image commercial transactions system and method, an image transfersystem and method, an image distribution system and method, and a display device and method are disclosed. A reception dealer accepts the transfer of an image recorded on a recording medium in a predetermined format with a handling condition intrinsic to the image, and transfers the image with the handling condition, and an advertisement, in digital data format, and a charge accounting dealer effects an electronic charge accounting transaction for the transfer of data of the image with the handling condition and the advertisement. Accordingly, a forwarding request user is helpful in making public the advertisement by having the data of the advertisement along with the data of the image forwarded, instead of the reception dealer, whereby a transfer fee for the data of image can be made lower. Consequently, it is possible to enhance the usability for the transfer significantly.

Abstract: A method of using a computer network for Dynamic Discovery of Quality of Service Nodes is provided. The method comprises requesting for a level of Quality of Service (QoS) of communication for a service of an Internet Service Provider (ISP) by a Application Service Provider (ASP). The request is based on a Quality of Service by Reference (QoSbyR) information that is received by the ASP from a user. The QoSbyR information comprises a ISP location information and a level of Quality of Service information.

Abstract: Systems and methods for maintaining base stations are provided. In this regard, a representative system, among others, includes a base station that is configured to receive transmitted signals from one or more mobile stations, calculate one or more data rates based on the transmitted signal associated with the one or more mobile stations, respectively, and generate data rate signals based on the calculated one or more data rates. The base station includes a dithering unit that is configured to apply dithering noise to the data rate signals, and memory that includes channel assignment logic configured to assign access channels to the one or more mobile stations based on the dithered signals, respectively.

Abstract: A system, computer program and method for transmitting requested data from a data source in response to data transmission requests from at least one electronic device according to differential rates of throughput. Data transmission requests are classified into one of a plurality of throughput classes, with each throughput class having an assigned rate of throughput. A proportion of data transmission requests to be processed from each throughput class is selected such that each data transmission request has a rate of throughput approximating the assigned rate of throughput of its class. The requested data is then sent from the data source to the electronic device.

Abstract: Disclosed are a method, upstream processing node, and computer readable medium for dynamically stabilizing a stream processing system. The method includes receiving at least one computing resource allocation target. The method further includes determining that an input data flow rate of at least one upstream processing element varies. The computing resource is dynamically allocated to the upstream processing element in response to the input rate of the upstream processing element varying. Data flow is dynamically controlled between the upstream processing element and at least one downstream processing element.

Abstract: A method includes receiving a first capture time corresponding to a first time that a data packet is received at a first probe and a second capture time corresponding to a second time that the data packet is received at a second probe. The data packet is from existing network traffic transmitted over a data network. The first and second probes can be configured to capture the data packet in response to a capture instruction. The first capture time and second capture time are different and are used to calculate the latency of at least a portion of a data network.

Abstract: Cloud computing platforms having computer-readable media that perform methods to shape virtual machine communication traffic. The cloud computing platform includes virtual machines and a controller. The controller limits the traffic associated with the virtual machines to enable the virtual machines to achieve desired communication rates, especially when a network servicing the virtual machines is congested. The controller may drop communication messages associated with the virtual machines based on a drop probability evaluated for the virtual machines.

Abstract: A source-based memory usage table is accessed to identify a source having a memory usage satisfying a predetermined memory usage threshold, the source-based memory usage table including a plurality of source records, each corresponding to a source from which packets are received. A first flow control signal is transmitted to the identified source that has a memory usage satisfying the corresponding predetermined memory usage threshold to control further packet transmission from the identified source. A priority-based memory usage table is accessed to identify a priority of which a memory usage satisfies a predetermined memory usage threshold of the priority. A second flow control signal is transmitted to one or more sources associated with the identified priority having a memory usage satisfying the corresponding predetermined memory usage threshold to control further packet transmission from the identified one or more sources.

Abstract: A communications system provides a dynamic setting of optimal buffer sizes in IP networks. A method for dynamically adjusting buffer capacities of a router may include steps of monitoring a number of incoming packets to the router, determining a packet arrival rate, and determining the buffer capacities based at least partially on the packet arrival rate. Router buffers are controlled to exhibit the determined buffer capacities, e.g. during writing packets into and reading packets from each of the buffers as part of a packet routing performed by the router. In the disclosed examples, buffer size may be based on the mean arrival rate and one or more of mean packet size and mean waiting time.

Abstract: Method and apparatus for power boosting a portion of installments in transmission of a packet of data. The power boosting incorporates a power boost factor for each installment. On receipt of a negative acknowledgement after the power boosted portion of installments, transmission of the subpacket is terminated, and processing passed to a higher layer.

Abstract: A vehicle active network (12) communicatively couples devices (14-20) within a vehicle (10). Device operation is independent of the interface (22-28) of the device (14-20) with the active network (12). Additionally, the architecture of the active network (12) provides one or more levels of communication redundancy. The architecture provides for the total integration of vehicle systems and functions, and permits plug-and-play device integration and upgradeability.

Abstract: A method of visualizing network data includes parsing a collection of packets in accordance with a set of categories related to characteristics of the collection of packets, the categories including listings of categorical elements, wherein at least some of the categorical elements are selectable by a user. When a categorical element is selected by a user, the collection of packets is filtered in accordance with the selected categorical element. Alongside each categorical element is a selectable count value that is indicative of the number of discrete communications sessions in which an associated categorical element is present in the collection of packets. When the count value is selected, a session view or views is/are created for each respective session, with content payload available for review and viewing.

Abstract: The present invention relates to a method and an apparatus for controlling message traffic licenses. The method includes: controlling message traffic through an ordinary license; judging whether the triggering conditions of using the first extended license are fulfilled, and, if the triggering conditions are fulfilled, using the first extended license to control the message traffic. The apparatus includes: a license management module, adapted to switch between the licenses according to the triggering conditions of the message traffic license; and a control module, adapted to control the message traffic by using the license selected by the license management module.

Abstract: Provided is a method for reserving a propagation time by estimating a channel environment in a wireless personal area network. The method includes the steps of: a) measuring a propagation range to the reception station upon starting data transaction with the reception station; b) measuring an average Strength Signal (ARSS) for determining a final transfer speed upon checking a transfer speed corresponding to the propagation range to the measured reception station based on a pre-defined table; c) determining a final transfer speed based on the transfer speed corresponding to the propagation range to the reception station according to a result that the measured ARSS is compared with Upper Bound RSS (URSS) and Lower Bound RSS (LRSS); and d) reserving a next propagation time according to the determined final transfer speed.

Abstract: Methods and computer readable mediums are provided for determining the processor occupancy of a cluster of HLR registers. A deterministic-based performance model is utilized to determine the processor occupancy based on a number of nodes in the cluster, a number of call attempts per unit time, a number of autonomous registrations, a processor utilization for processing each call attempt and a processor utilization for processing each autonomous registration. The models may be utilized to determine the processor occupancy of each node in the cluster if a selected number of HLR nodes are utilized, such that an iterative process may be employed to select a number of HLR nodes in order for each HLR node to operate under a node processor occupancy threshold.

Abstract: The inventors have envisioned a multihop network scenario in which nodes are equipped with advanced multi-antenna arrangements, and recognized the advantage of exploring the presence of such advanced antenna arrangements in multihop network nodes for the specific purpose of determining link cost for routing in the network. Link cost is determined for a wireless link between a pair of nodes in the network based on multi-channel characteristics between the nodes, where at least one of the nodes is configured for operation with multiple antennas to provide for multiple channels. These multi-channel characteristics may for example be determined based on explicit channel matrix estimation and/or the number of transmit and receive antennas or other information on the antenna capabilities of the involved nodes. The determined link cost information may subsequently be used together with additional routing cost information for route determination, and packet forwarding.

Abstract: The selection of the spatial mode together with modulation and encoding schemes based on channel condition measurements requested from MS forms a basis for selecting a best transmission data rate in a wireless link in every channel conditions. A method and network element comprising multiple-input multiple-output (MIMO) capable antenna technology allows the use of a best transmission data rate in the channel if selection of transmission mode has been made correctly. The thresholds for transmission mode selections are pre-determined and compared to instantaneous channel quality information. The practical MIMO solution based on correct selection procedure provides also continuous sufficient channel condition for terminal users when the user moves from LOS situation to NLOS situation.

Abstract: A system and method is described for formulating a linked-list hybrid peer-to-peer sub-network that analyzes capabilities of a plurality of nodes, and creating at least two linked-list hybrid peer-to-peer sub-networks by forming a first group of nodes of the plurality of nodes having similar capabilities and establishing serial connections between nodes of the first group of nodes to form a first linked-list hybrid peer-to-peer sub-network.

Abstract: A method of receiving communications at a data processing device includes receiving a packet from a virtual channel associated with a physical communication link. The packet is associated with a link virtual channel, and is stored in a storage location with the link virtual channel. Multiple internal virtual channels can be associated with the link virtual channel. A pointer to the storage location is enqueued in one of a plurality of FIFOs associated with one of the internal virtual channels. Each FIFO of the plurality of FIFOs stores pointers associated with a different internal virtual channel, allowing receiver arbitration logic to reorder between internal virtual channels based on internal resource availability and current priorities among virtual channels. This reduces the likelihood of communication deadlock and supports multiple classes of service.

Abstract: A method is provided for maximizing utility of a media delivery network having a media source, a first media adaptor, a second media adaptor and a media renderer. The media source can provide data in a first format and a second format. The first media adaptor can receive the data in the first format from the media source. The second media adaptor can receive the data in the second format from the media source. The first media adaptor can further provide data in a third format based on the received data in the first format. The second media adaptor can further provide data in a fourth format based on the received data in the second format. The media renderer can render the data in the third format and can render the data in the fourth format.

Abstract: A method, apparatus, and computer implemented instructions for managing traffic in a network data processing system. Traffic for a plurality of network paths is monitored. In response a packet for a particular network path within the plurality of network paths causing traffic for the particular network path to exceed a level of traffic allowed, an amount of available bandwidth is reduced based on a fair share for the particular network path.

Abstract: A method, apparatus and computer-readable storage medium for regulating packet flow through a device such as a router with a switch fabric. Congestion information, such as statistics on bandwidth utilization, is collected for each of a plurality of queues at an egress stage of the device. Based on the bandwidth utilization statistics, computations are performed to evaluate a “discard probability” for each queue. This information is transmitted to the ingress stage, either periodically or at other controlled time periods, such as when the discard probability changes significantly. The ingress stage can then proceed with controllable transmission or non-transmission of packets to the switch fabric, depending on the queue for which the packet is destined and also depending on the discard probability for that queue. In this way, congestion can be avoided even before it even has a chance to occur.

Abstract: The need to monitor real time network services has prompted service providers to use new measurement technologies, such as service-specific probes. A service-specific probe is an active probe that closely mimics the service traffic so that it receives the same treatment from the network as the actual service traffic. Service-specific probes are end-to-end and their deployment depends on solutions that address questions such as minimizing probe traffic, while still obtaining maximum coverage of all the links in the network. A polynomial-time probe-path computation algorithm is provided as well as a 2-approximate solution for merging probe paths when the number of probes exceeds a required bound k. The algorithms are evaluated using ISP topologies generated via Rocketfuel. For most topologies, it is possible to cover more than about 98% of the edges using just about 5% of the nodes as terminals.

Abstract: A system for centrally controlling packet network communications may include an input/output (I/O) unit configured to communicate data packets over a packet network with multiple network communications devices, a processing unit in communication with the I/O unit and configured to communicate with the network communications devices via respective node segments, and a memory in communication with the processing unit and configured to store a table. The processing unit may be configured to receive and store network performance information of node segments generated by the network communications devices. The network performance information may be stored in the table in association with indicia representative of the node segments, respectively. The processing unit may further be configured to control network communications by the network communications devices over the node segments based on the network performance information stored in the table.

Abstract: Methods are provided for managing hierarchically organized subscriber profiles. According to one embodiment, a policy engine of a VR defines services available to subscribers in terms of profile identifiers. A scalable subscriber profile database is established having a memory requirement dependent upon the number of available service contexts by hierarchically organizing profile identifiers as leaf profile identifiers, which explicitly define services, and intermediate profile identifiers, which indirectly represent services. The policy engine receives a first-level profile identifier and determines whether it is among those stored in the database. If not, then it obtains service profile information associated with the first-level profile identifier. If the first-level profile identifier is an intermediate profile identifier having leaf profile identifiers, then it further obtains them and associated profile information and stores this information in the database.

Abstract: A method of bandwidth allocation in a Resilient Packet Ring (RPR) network includes: congestion degree of a present node in the RPR network is determined. There is an upstream node and a downstream node of the present node in the RPR network. A present local arrival rate of local traffic flows of the present node from at least one client is obtained. An average transit rate of fairness eligible (FE) flows of the present node in a past time period is calculated. An effective node number for the present node and a present temporal fair rate of the present node are calculated respectively. A present local fair rate of the present node is obtained by looking up a local fair rate table. Transit rate transmitted by the upstream node is controlled according to the present local fair rate of the present node.