129 results about "Bandwidth constraint" patented technology

Embodiments of the present invention generally relate to a system and method of processing data signals. More specifically, in one embodiment, system architecture splits mixing functions between client and server to enable dynamic switching between a client-server and a peer-to-peer paradigm. In another embodiment, architecture allows one to efficiently trade-off computation in the server and link bandwidth in the network. In another embodiment a system is provided to minimize computational load on server subject to link bandwidth constraint. In another embodiment a system is provided to maximize use of client computational resources. In another embodiment a system is provided to adapt to changing network environments and changing service requirements (e.g. number of clients).

A method of clustering communication nodes based on network attributes such as network delays and forwarding capacity; on communication interest attributes; and on application attributes such as quality of service preferences/constraints (e.g. end-to-end delay constraints, bandwidth constraints) in providing communications between users and application servers. A multi-attribute communication feature vector is formed. That vector is comprised of network attributes (such as available bandwidth, client location attributes in the IP map), communication interests attributes (client request for content updates, client subscription to specific data items or to a set of proximal data sources in network space or application/virtual space) and quality of service requirements (such as delay and loss constraints is used to from efficient group communication mechanisms for distributed collaborative applications. Then the multi-attribute communication feature vectors are clustered. The clustering methods for multi-type attribute feature vectors are: iterative clustering using a generalized distance space with normalized attribute subspace metrics; fusion clustering, and nested clustering.

A device and a method for providing programs to multiple end user devices. The method includes: providing to multiple end user devices, via an edge device, at least one type of media stream out of unicast media stream and a multicast media stream; wherein the at least one type of media stream convey a group of programs; receiving a request from a first end user device to view a first program that belongs to the group of programs; and selectively switching, in response to bandwidth constraints imposed on a communication path coupled to the edge device, a type of a media stream that conveys the first program to a second end user device.

A mechanism to alleviate bandwidth fragmentation in a network employing path computation element(s) to place MPLS Traffic Engineering tunnels. One application is a multiple Autonomous System or multiple area network employing distributed computation of MPLS Traffic Engineering LSPs. A particular path computation element may determine that bandwidth fragmentation is present based on monitoring of path computation failures where desired paths are blocked due to bandwidth constraints. In response to the detected bandwidth fragmentation condition, the path computation element floods a routing notification within its Autonomous System or area. Nodes respond to the routing notification by requesting reoptimization of their own previously requested Traffic Engineering LSPs allowing the path computation element an opportunity to alleviate bandwidth fragmentation.

A pairwise key-agreement scheme is provided for creating key agreements non-interactively between pairs of nodes disposed in a hierarchy of nodes. The scheme is non-interactive so that any two nodes can agree on a shared secret key without interaction. In addition, the scheme is identity-based so that any given node only needs to know the identity of peer nodes to compute the shared secret key. All of the nodes are arranged in a hierarchy where an intermediate node in the hierarchy can derive the secret keys for each of its children from its own secret key and the identity of the child. Accordingly, the scheme is fully resilient against compromise of any number of leaves in the hierarchy and of a threshold number of nodes in the upper levels of the hierarchy. The scheme is well-suited for environments such as mobile ad-hoc networks (MANETs), which are very dynamic, have acute bandwidth-constraints and have many nodes are vulnerable to compromise.

A scheme for providing programs to multiple end user devices. Two types of media streams that convey a first group of programs are provided to multiple end user devices via an edge device. The two types of programs include a unicast media stream and a multicast media stream. When a request from a first end user device to view a first program that belongs to the first group of programs is received, a type of a media stream that conveys the first program to a second end user device is selectively switched, in response to bandwidth constraints imposed on a communication path coupled to the edge device.

A service discovery protocol is provided for use in personal area networks and other ad-hoc networking environments. The service discovery protocol is specifically designed to take into account the dynamic network configurations, bandwidth constraints as well as other characteristics of these types of networks. One of the key differentiators of the service discovery protocol is that it relies on a dynamically selected service directory device to manage the amount of information being distributed in the network.

Displaying a video stream when constrained by system memory and connection bandwidth. When the resources and/or memory of a client are insufficient to decode and process a video stream, the client only decodes and processes key frames of the video stream. The other frames are discarded by the client. By decoding and processing key frames, the memory and resource requirements of the video stream are reduced. The client is also able to negotiate with the video stream source such that only key frames are downloaded. Bandwidth limitations can thus be accommodated because downloading only key frames requires less bandwidth.

A split microprocessor socket is disclosed that provides a cavity created at an outer edge of the microprocessor socket. An optical module may be fitted in the cavity thus providing an optical fiber or waveguide connection directly to the socket. This low cost optical interconnect, closely packaged with the microprocessor, may alleviate bandwidth constraints associated with conventional electrical connections.

The invention discloses a method for reducing communication loads and the energy consumption of a data center. The method includes enabling a dispatching center to compute an initial placement sequence of virtual machines according to an expenditure matrix and a service demand matrix; configuring service communication data to corresponding switchboards and links according to bandwidth constraint conditions and acquiring an initial service routing information table; judging whether an execution communication duration of a task carried by a current virtual machine exceeds a communication duration threshold value or not, and migrating the current virtual machine into a target physical machine logically closest to a target virtual machine if the execution communication duration of the task carried by the current virtual machine exceeds the communication duration threshold value; enabling the dispatching center to judge whether all the virtual machines carried with tasks with execution communication durations exceeding the communication duration threshold value are migrated or not, enabling the dispatching center to update the initial placement sequence of the virtual machines and the initial service routing information table if all the virtual machines carried with the tasks with the execution communication durations exceeding the communication duration threshold value are migrated, and closing the switchboards which are not used by the data center. The method has the advantages that network information dynamic perception and feedback regulation functions can be realized, services with the communication durations exceeding the duration threshold value are reasonably distributed, the usage amount of the switchboards is reduced, and the purpose of saving energy for the data center is achieved.

Method and system for providing data, video and voice to a group of end user devices includes receiving end user device group quality of service rules and access network node bandwidth constraints; assigning multicast addresses and unicast addresses to end user devices of the group in response to the access node bandwidth constraints; and providing, in response to the end user device group quality of service rules and requests to receive services from the residential gateways, data, video and voice utilizing the assigned multicast addresses and unicast addresses. Further methods include receiving location information representative of distances between multiple end user devices and access nodes; defining end user bandwidth constraints in response to the location information and in response to access node bandwidth constraints; and providing, in response to the end user bandwidth constraints and to requests to receive services from the end user devices, data, compressed video and voice.

A telecommunications system in a DiffServ aware Traffic Engineering (DS-TE) environment includes a plurality of source nodes from which LSPs arise. The system includes an MPLS network having DS-TE compliant routers and links with available bandwidth between the routers. The links having equal cost paths. Each router adding an LSP to a link as a function of available bandwidth. The plurality of source nodes in communication with the network. The MPLS network using a DS-TE bandwidth constraint model. The system includes a plurality of destination nodes in communication with the network which receives LSPs. A method for LSP path selection in a DiffServ aware Traffic Engineering environment.

The invention discloses a streaming media playing method and a streaming media player. The method comprises the following steps: receiving a media stream; separating an audio stream from the media stream, storing the audio stream in an audio decoding buffer region, decoding the audio stream stored in the audio decoding buffer region, and storing audio data after decoding in an audio playing buffer region; separating a video stream from the media stream, storing the video stream in a video decoding buffer region, decoding the video stream stored in the video decoding buffer region, and storing video data after decoding in a video playing buffer region; and playing the audio data stored in the audio playing buffer region and the video data stored in the video playing buffer region. Thus, the phenomena of frame loss and blocking caused by bandwidth constraints of the mobile Internet and the stability of the network can be reduced, and the influence of the phenomena on the viewing experience of users is avoided.

A data communication resource allocation for OFDMA based wireless systems supporting heterogeneous traffic is provided by allocating the rates to users subject to power/bandwidth constraints, according to a user selection metric and rate allocation based on traffic requirements and channel conditions. Thus, a proportionally fair rate allocation with minimum rate constraint to data sessions and short term rate guarantees to real-time sessions can be provided.

The invention discloses an unmanned aerial vehicle base station bandwidth and track joint optimization method with limited pushing power. The method is suitable for an unmanned aerial vehicle emergency communication scene. According to the invention, a single unmanned aerial vehicle is used as an air base station; in a scene of providing downlink transmission services for a plurality of users in aprocess of flying from a starting point to a terminal point, under the condition that the pushing power and the flight time of the unmanned aerial vehicle are limited; the minimum average rate of each user in the system is maximized by adjusting the flight path and the user bandwidth distribution; a non-convex optimization problem is established according to the moving position of the unmanned aerial vehicle, the pushing power and the bandwidth constraint, and the non-convex optimization problem is converted and solved by using a block coordinate descent and continuous convex approximation method, so that the minimum average rate of each user in the system is maximized, and the energy and frequency band resource utilization rate is maximized. The method has important guiding significancefor the unmanned aerial vehicle communication system under the condition that the pushing power and the total bandwidth are limited.

A technique to manage wireless wide area network bandwidth constraints in a communication network includes; prioritizing client activities in a serving access point; detecting that wired domain access is inactive while wireless wide area domain access is active; and utilizing an available bandwidth of the wireless aide area domain access for the highest priority client activities. The lower priority client activities can be address in various different ways including transferring to other available wired access.

The bitrate for any practical video streaming system will vary considerably as a function of the difficulty of encoding the sequence in question. This variation is even more apparent when comparing different video clips of different genres for example where sports clips might require a higher average bitrate and fluctuate more due to the high activity of typical scenes, whereas a news report clip might require a much lower bitrate and be relatively static. As such, to deliver video streams at a constant quality to users sharing a contended network, a constant bandwidth method is not efficient to use across all the streams. The bandwidth allocated to each stream must be allowed to dynamically vary in time in accordance with the precise demands of the video being streamed at that time and also be within any network bandwidth constraints. The present invention defines such a method.

A method and apparatus for organizing and processing pieces of interrelated information (or “thoughts”) using a digital computer is disclosed. The invention employs a graphical user interface to facilitate user interaction with highly flexible, associative “matrices” that enable users conveniently to organize digitally-stored thoughts and their network of interrelationships. Each of the thoughts may be affiliated with one or more application programs, such as a word processing or spreadsheet utility, or an Internet browser. Users are able conveniently to select a current thought along with any applications or content associated with that thought by interacting with the graphical representation. That representation is automatically reoriented about the selected thought, and is revised to reflect only those thoughts having predetermined relations to that current thought. Users can easily modify the matrix by interactively redefining relations between thoughts. Further aspects of the invention include techniques permitting automated generation of thought matrices, delayed loading to facilitate navigation amongst thoughts without undue delay due to bandwidth constraints, and matrix division and linking to allow optimal data structure flexibility. The present invention is interoperable with computer networks including the Internet, and offers an intuitive scalable methodology for the navigation and management of essentially immeasurable information resources and knowledge bases that transcends the limitations inherent in traditional hierarchical approaches. Thought matrices may conveniently be published and shared by multiple users under another aspect of the present invention. Still another aspect enhances communications amongst computer network users by sharing information about users' navigation amongst shared thoughts. The present invention offers advantages over prior art methods when speech is used to control a computer. Lastly, another aspect of the present invention provides users of a computer network automatically to receive custom content in response to their navigation of network files, without modifying those files.

Cost, electronic circuitry limitations, and communication channel behaviour yield communication systems with strict bandwidth constraints. Hence, maximally utilizing available bandwidth is crucial, for example in wireless networks, to supporting ever increasing numbers of users and their demands for increased data volumes, low latency, and high download speeds. Accordingly, it would be beneficial for such networks to support variable bandwidth allocations such that smaller frequency sub-bands are allocated to users, as their number increases, but the individual users/nodes insert more data-carrying signals in order to compensate pensate for the loss of operating bandwidth arising from the accommodation of more users. It would further be beneficial for transmitters and receivers according to embodiments of such a network architecture to be based upon low cost design methodologies allowing their deployment within a wide range of applications including high volume, low cost consumer electronics for example.

The present invention relates to a route choice method of a mobile ad-hoc network based on bandwidth constraint and minimum load, which includes three steps. Firstly, when a node needs to transmit services to another node, the node broadcasts routing request packets; secondly, when receiving a routing request message, an intermediate node compares the addresses of the intermediate node and the destination node; thirdly, when receiving the routing request from the source node, the destination node checks whether the current time is less than the time spent in receiving the routing request within the specified time. In a mobile ad-hoc network, the bandwidth resource is hard to determine due to the dynamic change of topological structures, the energy of the heavily loaded nodes in a network is rapidly depleted due to the unbalanced load distribution, and as a result the connectivity of the network is rapidly weakened, which finally shortens the total survival time of the network; the present invention resolves the problem. The present invention is compared with the existing AODV protocol by using the NS2 simulation tool, and the simulation results show that the BLLM excels the AODV in terms of packet delivery rate, packet loss rate, throughput, etc.

An integrated circuit for a smart card may include a plurality of data buffers and a processor. In particular, the processor may selectively allocate data buffers from the plurality thereof and exchange data therewith based upon different types of data. As such, the processor may advantageously change the allocation of the buffers for different data types based upon various bandwidth constraints in a particular smart card environment to enhance bandwidth utilization. By way of example, each type of data may correspond to one of a plurality of endpoints supported by the processor.

In a radar apparatus, a receiving antenna includes a plurality of antenna elements, each receiving, as a reception signal, radio waves emitted into space and reflected off a target object. An analog signal is obtained by downconverting and putting a bandwidth constraint on the reception signal, and is then converted to a digital signal. Based on the digital signal, a signal processing unit detects the bearing of the target object. The signal processing unit performs processing based on outputs of two sets of the antenna elements.

A system and method maximize the availability of cloud services in the event of a disruption to one or more cloud servers by automatically triggering the live migration of selected cloud services and automatically performing the triggered migration of such services. The operational state of virtual machines operating on a cloud server and the services that are associated with the virtual machines is monitored. Different techniques are used for deciding when to migrate cloud services based on the automatic detection of anomalies, for deciding what cloud services to migrate so as to maximize the availability of high priority services during migration under time and network bandwidth constraints, and for deciding where to migrate the selected cloud services based on a determination of the best location for migration.