Abstract: A transmission device includes: a relay device information obtaining unit (101) which obtains self-device transmission status information that is information indicating a transmission status of a communication device; a neighboring communication device determining unit (102) which determines, from other communication devices connected to the network, neighboring communication devices; a neighboring communication device information obtaining unit (103) which obtains another-device transmission status information from each of the neighboring communication devices; a transmission rate control information correcting unit (104) which generates corrected transmission status information based on an amount of statistics calculated from the self-device transmission status information and the another-device transmission status information; a transmission rate determining unit (105) which determines a transmission rate of data, based on the corrected transmission status information; and a data transmission unit (106) wh

Abstract: A system for analyzing an availability of at least part of a communications network is provided. The network includes a set of network components, that are further divided into first and second subsets of network components. Each of the first and second subsets includes a plurality of different components in the network component set.

Abstract: Initiating peer-to-peer tunnels between clients in a mobility domain. Client traffic in a mobility domain normally passes from the initiating client to an access node, and from the access node through a tunnel to a controller, and then through another tunnel from the controller to the destination access node, and the destination client. When initiated by the controller, the access nodes establish a peer-to-peer tunnel for suitable client traffic, bypassing the “slow” tunnels through the controller with a “fast” peer-to-peer tunnel. Traffic through this “fast” tunnel may be initiated once the tunnel is established, or traffic for the “fast” tunnel may be queued up until traffic has completed passing through the “slow” tunnel. This queue and release process may be bidirectional or unidirectional depending on the traffic. Completion of slow tunnel traffic may be sensed in a number of ways.

Abstract: A comparative time of a first data stream accumulated in a buffer memory is compared with a comparative time of a second data stream (S113). If the comparative time of the first data stream is earlier, the first data stream is multiplexed (S114). On the other hand, if the comparative time of the first data stream is later, the first data stream is not immediately multiplexed. When a data stream is accumulated in a buffer memory, the comparative time of the data stream is a multiplexing reference time indicating the timing of reproduction of the data stream, which is obtained based on time information contained in the data stream or the like (S116). On the other hand, when a data stream is not accumulated in a buffer memory, a multiplexing predicted time which is predicted as the multiplexing reference time of a data stream which is to be next accumulated is used as the comparative time of the data stream (S117).

Abstract: A technique for performing layer 2 processing is described. In a method implementation of this technique, at least one first RLC SDU is created from one or more first RLC PDUs. It is assumed here that the first RLC SDU belongs to an incomplete RLC SDU set that is to comprise at least one second RLC SDU, and that the second RLC SDU is to be created from at least one second RLC PDU not yet available. In a next step, a first PDCP function is applied to the first RLC SDU to create a data packet. The RLC function is only performed after the second RLC PDU has become available (or after an RLC time-out). Then, after the RLC function has been performed, the data packet is released to a second PDCP function.

Abstract: Audio-visual data is provided to a network-connected terminal. First audio-visual data containing first information encoded at a first data rate and second audio-visual data containing first information encoded at a second data rate that is more than the first data rate are received. The first audio-visual data is provided to the network-connected terminal. A condition is identified to the effect that the amount of data being sent to the terminal is less than the available bandwidth. The difference between the data rates of the first and second audio-visual data is calculated, additional data packets are sent to the terminal to determine whether the available bandwidth is large enough to provide the first audio-visual data to the terminal; and if it is determined that the available bandwidth is large enough, provision of the first audio-visual data to the terminal is stopped and the second audio-visual data is provided instead.

Abstract: A system and method for estimating data conflicts in a multi-node system is disclosed. According to an embodiment of the invention, tracing the execution of a workload on a single node and analyzing the trace records makes it possible to predict how many data conflicts would occur if the workload were executed across multiple nodes. Also disclosed is a method and mechanism for generating a load distribution plan for a multi-node system.

Abstract: Examples of systems and methods are provided for handling remote drawing commands. A system may comprise a buffer module configured to receive, at the system from a remote server system over a remote access connection between the system and the remote server system during a remote connection session, remote drawing commands, according to a drawing command rate, of a remote application running on the remote server system. The buffer module may be configured to store the remote drawing commands. The system may comprise a timer module configured to facilitate sending at least some of the remote drawing commands in the buffer module to a graphics module according to a refresh rate that is less than the drawing command rate. The timer module may be application agnostic.

Abstract: Described is an end-to-end broadcast-based messaging technique used in controlling message flow in a data storage system. Each node stores flow control state information about all the nodes which is used in determining whether to send a data transmission to a receiving node. The flow control state information includes an indicator as to whether each node is receiving incoming data transmissions. If a node is not receiving incoming data transmissions, the flow control state information also includes an associated expiration time. Data transmissions are resumed to a receiving node based on the earlier of a sending node determining that the expiration time has lapsed, or receiving a control message from the receiving node explicitly turning on data transmissions. Each node maintains and updates its local copy of the flow control state information in accordance with control messages sent by each node to turn on and off data transmissions.

Abstract: A device interface circuit unit transfers a command and data in packet format between the unit and the host. A transport layer is provided with a receive FIFO, a command detection circuit and a send FIFO, and an application layer is provided with a receive task file register and a send task control file register. An available time is generated for each break point of a packet during data transfer in order to receive another command packet from the host. When the command packet is received from the host in the available time during data transfer, the data transfer is suspended and the received command is decoded to execute a process for continuing or canceling the data transfer, after which the data transfer is resumed.

Abstract: Systems and methods that provide fault tolerant transmission control protocol (TCP) offloading are provided. In one example, a method that provides fault tolerant TCP offloading is provided. The method may include one or more of the following steps: receiving TCP segment via a TCP offload engine (TOE); calculating a TCP sequence number; writing a receive sequence record based upon at least the calculated TCP sequence number to a TCP sequence update queue in a host; and updating a first host variable with a value from the written receive sequence record.

Abstract: The present invention provides a method of transmitting data in a network of interconnectable end-user nodes comprising a source node, a recipient node and a plurality of further nodes, wherein each of the end-user nodes is executing an instance of a communication client application. The invention also provides corresponding method of receiving data, and corresponding computer programs and user terminals. The method of transmitting data comprises: comprising: the communication client of the source node receiving a command to transmit the data to the recipient node; the source node selecting from the plurality of further nodes at least one storage node to store the data from the source node before being retrieved by the recipient node; transmitting the data from the source node to the at least one storage node; and the source node providing a network identity for each of the at least one storage nodes to the recipient node.

Abstract: A transmit packet generated by a CPU 1 is held in a buffer 100a (100b). From among packets received from Ethernet 820a (820b), a packet, a destination of which is a communication device 800, is held in the buffer 100a (100b). A packet which should be transmitted is transmitted from a transfer judging circuit 200 to Ethernet 820a or 820b through a MAC unit 300a or 300b. If a transfer judging circuit 200 judges a packet from the Ethernet 820a to be a packet, a destination of which is another communication device, with reference to a destination MAC address, this packet is transferred to the Ethernet 820b through MAC 300b. If a usage rate of a transferring FIFO buffer 130a (130b) exceeds a threshold value in the process of transmitting a packet held in a transmitting FIFO buffer 120a (130b) on a priority basis, the priority order of a transfer packet is made higher than that of a transmit packet so that the transfer packet is transferred to the Ethernet 820a or 820b in preference to the transmit packet.

Abstract: A system and method that includes monitoring a state of a physical queue receiving data is shown. The system and method includes generating, queuing, and scheduling messages based on the state of the physical queue, sending the messages to a virtual queue system, and approximating the state of the physical queue in a virtual queue system based on the messages. The system and method includes modifying a transmission rate towards the physical queue based on a state stored in the virtual queue system.

Abstract: In one embodiment, payload of multiple threads between intellectual property (IP) cores of an integrated circuit are transferred, by buffering the payload using a number of order queues. Each of the queues is guaranteed access to a minimum number of buffer entries that make up the queue. Each queue is assigned to a respective thread. A number of buffer entries that make up any queue is increased, above the minimum, by borrowing from a shared pool of unused buffer entries on a first-come, first-served basis. In another embodiment, an interconnect implements a content addressable memory (CAM) structure that is shared storage for a number of logical, multi-thread ordered queues that buffer requests and/or responses that are being routed between data processing elements coupled to the interconnect. Other embodiments are also described and claimed.

Abstract: A system rewards users who offer to share the memory, storage, or bandwidth of their computing resource to third parties within a distributed network. Users share processing, storage, bandwidth or memory resources with third parties by permitting such third parties to access files stored in the memory of the users' computing devices. Users that offer files for upload are encouraged to register with a central authority, and receive value each time a third party accesses a resource from their computing devices. The value awarded to each such user is tracked by the central authority and is weighted.

Abstract: A system and method for converting low-jitter, interleaved frame traffic, such as that generated in an IP network, to high jitter traffic to improve the utilization of bandwidth on arbitrated loops such as Fibre Channel Arbitrated Loops. Embodiments of a high jitter scheduling algorithm may be used in devices such as network switches that interface an arbitrated loop with an IP network that carries low-jitter traffic. The high jitter algorithm may use a separate queue for each device on the arbitrated loop, or alternatively may use one queue for two or more devices. Incoming frames are distributed among the queues based upon each frame's destination device. The scheduling algorithm may then service the queues and forward queued frames to the devices from the queues. In one embodiment, the queues are serviced in a round-robin fashion. In one embodiment, each queue may be serviced for a programmed limit.

Abstract: A system balances bandwidth used by a data stream. The system receives data in the data stream and partitions the data into bursts. The system then identifies whether a size of a current one of the bursts is less than a size of a maximum burst associated with the data stream and schedules an additional burst in the data stream when the current burst size is less than the maximum burst size. The system transmits the current burst and the additional burst to balance bandwidth used by the data stream.

Abstract: The invention distributes bitstreams by a server to a plurality of client devices connected to the server via a network, in which the server device transfers a bitstream via the network to a client device belonging to the plurality of client devices, and in which the bitstream may be transcoded according to a plurality of predetermined transcoding methods. In the invention, a rate associated with each of the bitstreams is calculated after application of at least one of the plurality of transcoding methods. Each client device is classified, and a determination is made, among the plurality of predetermined transcoding methods, those which are acceptable for each client device, depending on the calculated rates and the classification.

Abstract: The Fair-Order Service of the present invention delivers action messages to the server as soon as it is feasible. Because action messages from different players exhibit different reaction times with respect to an update message, the Fair-Ordering Service executed at the server dynamically enforces a sufficient waiting period on each action message to guarantee the fair processing of all action messages. In reality, the waiting period at the server is bounded because of the real-time nature of interactive games. The algorithms that offer Fair Ordering Service take into consideration delayed and out-of-order action messages. When action messages corresponding to multiple update messages are interleaved, the Fair-Ordering Service matches the action message to the appropriate update message. It accomplishes this by maintaining a window of update messages and using the reaction times for an action message for each of the update messages in the window.

Abstract: A method of flow control implemented by a system disposed to execute a protocol stack and an application is disclosed herein. The method includes configuring the system to operate in a push mode pursuant to which the protocol stack initiates the forwarding, to the application, of a first sequence of data packets received by the protocol stack. The system may also be configured to operate in a pull mode pursuant to which the application initiates the forwarding, to the application, of a second sequence of data packets received by the protocol stack. In a particular implementation the system may be configured to transition from the push mode to the pull mode, or vice-versa, in response to receipt at the protocol stack of a data packet bearing a specified sequence number.

Abstract: A method and system of reachability indication between a wireless device and at least one push server, the method comprising the steps of: sending device status information from the wireless device to the at least one push server; and receiving the status information at the at least one push server; wherein the at least one push server is enabled to selectively start and stop serving the wireless device on the basis of the status information. The method further comprises sending status information to a packet data serving node that stores a list of push servers associated with a wireless device, and having the packet data serving node forward the status information to the push server. The system and method further includes selectively starting and stopping the serving of the wireless device by the push server during a voice call.

Abstract: A method performed by a device includes receiving a first Hyper-Text Transfer Protocol (HTTP) packet, creating a first session based on the HTTP packet, and creating a session cache entry for the first session. The method also includes receiving a second HTTP packet, performing a session cache lookup to identify a match of the second HTTP packet with the session cache entry, and creating a second HTTP session based on the match of the second HTTP packet with the session cache entry.

Abstract: Systems and methods are provided to facilitate efficient communications handoff for access terminals in a wireless network. In an aspect, a method to handoff communications in a wireless network is provided. The method includes decoding assignment messages from one or more sectors in an active set and performing an access terminal handoff based at least in part on the active set.

Abstract: A de-rate matching device in a communication system divides received data into a plurality of blocks, and simultaneously de-rate-matches data in the respective blocks.

Abstract: Systems, methods, and computer program products are described that intelligently determines the status of a process. The process is performed with respect to a creative asset that may be included in an online ad, for example. The status of the process is requested at a poll time that is calculated based on at least one attribute of the creative asset. For example, the calculated poll time may be based on a duration of a video associated with the creative asset, a weight (i.e., bitsize) of the creative asset, etc.

Abstract: A CPU 14 detects a value of an output bit rate of media data output from a buffer 17, detects a value of a free space of the buffer 17, and divides a value resulted from subtracting a decrease ratio set value from the detected value of the free space by a saved period. As a result, a value of a decrease ratio is obtained. In order to decrease a value of an input bit rate of media data input to the buffer 17 in accordance with the value of the output bit rate, the CPU 14 decreases the value of the input bit rate based on an upper limit of the input bit value that is a value resulted from adding the detected value of the output bit rate and the calculated value of the decrease ratio.

Abstract: A system and method for enabling the interchange of enterprise data through an open platform is disclosed. This open platform can be based on a standardized interface that enables parties to easily connect to and use the network. Services operating as senders, recipients, and in-transit parties can therefore leverage a framework that overlays a public network.

Abstract: A protection relay with integrated communications may include a protective relay portion to perform protective relay operations associated with a load operatively connected to the protection relay, and a communications server portion to perform communications operations as an independently operating communications server.

Abstract: A mobile communication terminal for downloading contents and a method thereof. The mobile communication terminal comprises: a memory for storing at least one multimedia data to be outputted while downloading contents; a controller for outputting at least one control signal to control an output of the stored multimedia data when prediction time for downloading the contents is more than a preset time; and at least one output device for outputting the stored multimedia data based on the outputted control signal.

Abstract: Embodiments of the present invention provide a method and device for processing network time delay characteristics. The method includes: determining whether network time delay changes; if the network time delay reduces, determining whether at least one blank frame is included in received but not played media frames of a real-time media service; if at least one blank frame is included in the received but not played media frames, extracting the blank frame from the received but not played media frames, the blank frame is a media frame, information amount of which is smaller than a preset first threshold, or difference between the information amount of which and the information amount of a previous media frame is smaller than a preset second threshold; if the network time delay increases, inserting the blank frame in the received but not played media frames.

Abstract: Elements of the present invention relate to systems and methods for controlling the transmission rate of streaming processes.

Abstract: A system and method for dynamically controlling aggregate and individual packet flow characteristics within a compressed logical data tunnel. A logical data tunnel is formed and includes one or more packet flows. Each packet flow includes individual packets having a shared destination address. Bandwidth allocated to control an aggregated flow of packets routed through the logical data tunnel. A transfer rate is assigned to control each packet flow transiting within the logical data tunnel.

Abstract: To reduce the total amount of reply messages in broadcasting and to make effective use of the bandwidth of a communication route without assuming an error rate in advance. Data is broadcasted to a plurality of receivers (step 11), then a maximum message length of reply messages from the receivers is calculated (step 13), and a backoff time of the reply messages is calculated (step 14). The maximum message length and the backoff time is sent to the receivers (step 15), then the reply messages having lengths of up to the specified maximum message length are generated by the receivers (step 17), and the reply messages are sent from the receivers at any time within the specified backoff time (step 19).

Abstract: A hierarchical content distribution system includes a seeding server, a plurality of geographically distributed content platforms, and a distribution controller, all interconnected by a communications network. The seeding server initially receives content files for distribution to various content platforms that provide for the persistent storage of the content files. Each content platform includes a content file server responsive on-demand to requests for the transfer of content files. The distribution controller autonomously monitors the transfers of content files and selectively issues transfer directives to the content platforms to modify the distribution of content files among the content platforms. The content file servers respond to received transfer directives by issuing requests for the transfer of the directive identified content files, thereby conforming the specific distribution of content files to an optimal distribution pattern as determined by the distribution controller based on usage patterns.

Abstract: As more internet service providers have more customers with high-speed internet access accounts and these customers access more multi-media rich data (such as videos), the network infrastructure of internet service providers becomes saturated. Thus, internet service providers are facing pressure to upgrade their networks. Thus, internet service providers need to optimize the usage of their existing networks. To optimize the usage of existing networks, a system of performing predictive downloading for data caches is proposed. The system for performing predictive downloading examines network traffic conditions and does not issue predictive download requests if the network is busy. By restricting predictive downloads to times when the network is not busy, the system utilizes an under used resource. Accurate predictions will reduce future network traffic. Incorrect predictions cause no harm since the transfers only occur when free network bandwidth is available.

Abstract: A system for utilizing informed throttling to guarantee quality of service to a plurality of clients includes a server core having a performance analyzer that compares a performance level received by a client to a corresponding contracted service level and determines if the client qualifies as a victim whose received performance level is less than the corresponding contracted service level. The performance analyzer is further configured to identify one or more candidates for throttling in response to an I/O stream receiving insufficient resources by determining if the client qualifies as a candidate whose received performance level is better than the corresponding contracted service level. The server core further includes a scheduler that selectively and dynamically issues a throttling command to the candidate client, and provides a quality of service enforcement point by concurrently monitoring a plurality of I/O streams to candidate clients and concurrently throttling commands to the candidate clients.

Abstract: A management system using Global Positioning System receivers for tracking remote units from a central office and quickly and conveniently determining if those remote units have varied from a set of predetermined parameters of operation. The system also includes provisions that allows information to be sent from the remote units to the central office and vice versa. The system also has safety features that promote the rapid dispatch of law enforcement personnel when requests for emergency assistance have been made from the remote units.

Abstract: Certain aspects of a method and system for transparent transmission control protocol (TCP) offload with best effort direct placement of incoming traffic are disclosed. Aspects of a method may include collecting TCP segments in a network interface card (NIC) processor without transferring state information to a host processor every time a TCP segment is received. When an event occurs that terminates the collection of TCP segments, the NIC processor may generate a new aggregated TCP segment based on the collected TCP segments. If a placement sequence number corresponding to the generated new TCP segment for the particular network flow is received before the TCP segment is received, the generated new TCP segment may be transferred directly from the memory to the user buffer instead of transferring the data to a kernel buffer, which would require further copy by the host stack from kernel buffer to user buffer.

Abstract: A method and system for transmitting data over a channel of a network. The method comprises: receiving data at a first node; encoding a first portion of the data at a first bit rate to generate a first encoded data stream; monitoring an indication of the capacity of the channel; transmitting to the second node a padded data stream via the channel, wherein padding bits are added to the first encoded data stream, in dependence on the indication of the capacity of the channel, to generate the padded data stream; determining if transmitting the padded data stream exceeds the capacity of the channel; and encoding a second portion of the data at a higher bit rate than the first bit rate, to generate a second encoded data stream for transmission over the channel, if it is determined that transmitting the padded data stream does not exceed the channel's capacity.

Abstract: A high performance network adapter is provided for forwarding traffic and providing adaptation between packetized memory fragment based processor links of multiple CPUs and multiple switch planes of a packet switching network. Low latency for short and long packets is provided by innovative packet reassembly, overlapping transmission, and reverse order transmission in the upstream direction, and cut through operation in the downstream direction.

Abstract: Method of managing priority during the transmission of a message, in an interconnections network comprising at least one transmission agent which comprises at least one input and at least one output, each input comprising a means of storage organized as a queue of messages. A message priority is assigned during the creation of the message, and a queue priority equal to the maximum of the priorities of the messages of the queue is assigned to at least one queue of messages of an input. A link priority is assigned to a link linking an output of a first transmission agent to an input of a second transmission agent, equal to the maximum of the priorities of the queues of messages of the inputs of said first agent comprising a first message destined for that output of said first agent which is coupled to said link, and the priority of the link is transmitted to that input of said second agent which is coupled to the link.

Abstract: A method and an access domain node identify and manage a type of service offered by a service provider to user domains. A service template is prepared by the service provider, comprising an address of a server and a protocol identifier, as well as policies for controlling traffic for the service. Upon set up of a connection between a user domain and the service provider, an address of the user domain is added to the service template to produce a service flow management set. Every data packet exchanged between the user domain and the server, in either direction, is related to a service data flow for a given service type by checking for a match between a source address, a destination address, and a protocol type contained therein, with an appropriate service type. Policies from the service flow management set are used to manage the flow of data packets.

Abstract: A method of managing a congestion state in a server of a communication network is provided. The server includes a buffer storing a first number of service requests and having a maximum storage capacity. The method includes: in a first time frame, receiving a further service request to be stored in the buffer and determining whether to store such a further service request in the buffer or to refuse it; and, in a second time frame, deleting a second number of service requests stored in the buffer. The step of determining whether to store the further service request in the buffer or to refuse it includes refusing the further request according to a refusal probability if the first number is lower than the maximum storage capacity.

Abstract: Methods, apparatuses, and systems for improving utilization of a communications system (e.g., a satellite communications system) are provided, using techniques referred to herein as “deltacasting.” Embodiments operate in a client-server context, in which the server-side of the communication link intercepts requests and responses using a client-server optimizer (e.g., a transparent proxy or in-line optimizer between a client web browser and an Internet content provider). The optimizer uses techniques, such as dictionary coding techniques, to create fingerprints of content traversing the links of the communications system. These fingerprints are used to identify and exploit multicasting and/or other opportunities for increased utilization of the communications links.

Abstract: A data-packet processing method is used in a network system. The network system includes a buffer for optionally storing a data packet to be transferred, and the method includes steps of: determining a type of the data packet to be transferred; determining a storage state of a buffer where the data packet is to be temporarily stored before transferring; and storing the data packet into the buffer if the storage state of the buffer is a packet-accepting storage state; wherein the packet-accepting storage state of the buffer varies with the type of the data packet.

Abstract: Flexible network policies might be enforced by (a) obtaining a flow of network packets, (b) determining a content characteristic by characterizing content of the flow using bit-stream level statistics, (c) determining content-independent flow characteristics, port-independent flow characteristics, and/or application header-independent flow characteristics, and (d) enforcing a policy on the flow using both (1) the determined content characteristic and the (2) determined content-independent flow characteristics, port-independent flow characteristics, and/or application header-independent flow characteristics.

Abstract: The present invention provides a method and apparatus for packet transmission in the network. When the network device receives data packets from the first user, the network device extracts and saves the data encapsulated in the data packets and then forwards the packets according to the destination addresses of the data packets. When it receives the request from a second user for the data mentioned above, it encapsulates the saved data in data packets and sends the data packets to the second user. With the present invention deployed, the uploaded data packets are saved on network devices and can be directly transmitted to users requesting them. In this way, the present invention avoids repeated traffic upload, reduces upload traffic in the network, decreases network bandwidth occupied by traffic, and thus improves the overall network performance.

Abstract: A method for increasing transfer quality between a content requestor and a content source on a content distribution system. The method involves determining transfer quality between the requestor and various content sources. The determination is made from the requestor's perspective. After determining transfer qualities for the various content sources, the requester provides the transfer qualities to a selector on the content distribution system. The selector uses the determined transfer qualities select a content source to supply the requestor.

Abstract: Disclosed are methods for automatic categorization of internal and external communication, the method including the steps of: defining groups of entities that transmit data; monitoring data flow of the groups; extracting the data, from the data flow, for learning traffic-flow characteristics of the groups; classifying the data into group flows; upon the data being transmitted, checking the data to determine whether the data is designated as group-internal; and blocking data traffic for data that is group-internal. Preferably, the step of monitoring includes assigning data weights to the data using Bayesian methods. Most preferably, the step of classifying includes classifying the data using Bayesian methods for evaluating the data weights. Preferably, the step of blocking includes blocking data traffic between members of two or more groups. Preferably, the method further includes the step of: enabling an authorized entity to unblock the data traffic.