344results about How to "Reduce bandwidth consumption" patented technology

A system for providing video-on-demand service, broadband internet access and other broadband services over T-carrier systems including a pull multiplexer cherrypicker at the head end is disclosed. The pull multiplexer receives upstream requests and cull out MPEG or other compressed video packets, IP packets and other data packet types to satisfy the requests or to send pushed programming downstream. The downstream can be DSL or HFC. Each customer has a cable modem, DSL modem or a gateway which interfaces multiple signal sources to a LAN to which settop decoders, digital phones, personal computers, digital FAX machines, video cameras, digital VCRs etc. can be attached. Each gateway can coupled the LAN to a DSL line or HFC through a cable modem or a satellite dish through a satellite transceiver. A PSTN and conventional TV antenna interface is also provided.

A method for screening packet-based communication traffic. At least a first data packet, sent over a network from a source address to a destination address, is received. A determination is made, by analyzing the first data packet, that the first data packet was generated by a worm. In response to the determination, a second data packet sent over the network from the source address is blocked.

A method and apparatus for adaptively obtaining bandwidth requests in a broadband wireless communication system. The method and apparatus includes dynamically varying technique combinations enabling a plurality of users to efficiently request bandwidth from a shared base station. A user may “piggyback” a new bandwidth request upon, or set a “poll-me bit” within, presently allocated bandwidth. A base station may poll users, individually or in groups, by allocating unrequested bandwidth for new requests. Polling may respond to a “poll-me bit,” and / or it may be adaptively periodic at a rate based on communication status parameters, such as recent communication activity and connection QoS levels. Group polling permits a possibility of collisions. Polling policies may be established for dynamically varying user groups, or may be determined for each user. Dynamic selection of appropriate polling techniques makes use of efficiency benefits associated with each technique.

For improving feed-based automatic distribution of content to a mobile terminal via a mobile network, a network component (150) comprises a network-side agent (160). The network-side agent (160) manages the feed-based automatic transmission of content to the mobile terminal and is configured to periodically generate a feed request to a feed server, to receive a requested feed from the feed server in response to the feed request, and to transmit the received feed to the mobile terminal. The network component (150) may also comprise a cache memory (164) for storing copies of feeds and contents and a proxy for processing feed requests and content requests received from the mobile terminal (110).

A method for providing “guaranteed message delivery” for network based communications between a client machine and a server. The client machine includes a Client Runtime Environment (CRE) and the server includes a Server Runtime Environment (SRE). The method includes the following steps. A first message queue is maintained in the CRE. A first unique identification is attached to the first message from the first message queue and the first message is sent from the CRE to the SRE via a network communication. The SRE receives the first message and sends an acknowledgement of the receipt of the first message to the CRE. Upon receiving of the acknowledgement within a certain time threshold, the CRE removes the first message from the first message queue in the CRE. A method of providing “server-push” of messages from the server to the client machine utilizing a push Servlet and a push API.

A computing system for performing stateful distributed computing includes a client machine having a Client Runtime Environment (CRE) that is adapted to maintain the state of an application in the client machine. The CRE maintains state of the application by first retrieving a first markup document of the application, creating and storing a first object oriented representation of information contained in the first markup document. The first object oriented representation defines a first state of the application. Next, retrieving a second markup document, creating and storing a second object oriented representation of information contained in the second markup document. Finally merging the first and second object oriented representations thereby forming a new object oriented representation of information contained in the first or the second markup documents. This new object oriented representation defines a new state of said application. The CRE may further update the new state of the application by retrieving one or more additional markup documents, creating and storing one or more additional object oriented representations of information contained in the one or more additional markup documents, respectively, and merging the one or more additional object oriented representations with the new object oriented representation thereby forming an updated state of the application.

A method and apparatus for adaptively obtaining bandwidth requests in a broadband wireless communication system. The method and apparatus includes dynamically varying technique combinations enabling a plurality of users to efficiently request bandwidth from a shared base station. A user may “piggyback” a new bandwidth request upon, or set a “poll-me bit” within, presently allocated bandwidth. A base station may poll users, individually or in groups, by allocating unrequested bandwidth for new requests. Polling may respond to a “poll-me bit,” and / or it may be adaptively periodic at a rate based on communication status parameters, such as recent communication activity and connection QoS levels. Group polling permits a possibility of collisions. Polling policies may be established for dynamically varying user groups, or may be determined for each user. Dynamic selection of appropriate polling techniques makes use of efficiency benefits associated with each technique.

A method and apparatus for adaptively obtaining bandwidth requests in a broadband wireless communication system. The method and apparatus includes dynamically varying technique combinations enabling a plurality of users to efficiently request bandwidth from a shared base station. A user may “piggyback” a new bandwidth request upon, or set a “poll-me bit” within, presently allocated bandwidth. A base station may poll users, individually or in groups, by allocating unrequested bandwidth for new requests. Polling may respond to a “poll-me bit,” and / or it may be adaptively periodic at a rate based on communication status parameters, such as recent communication activity and connection QoS levels Group polling permits a possibility of collisions. Polling policies may be established for dynamically varying user groups, or may be determined for each user. Dynamic selection of appropriate polling techniques makes use of efficiency benefits associated with each technique.

Methods, systems and computer program products for document sharing in collaborative electronic meetings. Exemplary embodiments include a method for control of documents in a collaborative interaction, the method including establishing an out-of-band channel between a first participant and a second participant in the collaborative interaction, transferring a copy of a document on the out-of-band channel between the first participant and the second participant, transferring a command issued on the document by the first participant on an in-band channel established between the first participant and the second participant, invoking the command by the second participant on the copy of the document by the second participant and displaying the result of invoking the command to the second participant.

The invention discloses an integrated P2P (Peer-To-Peer) VOD (Video-On-Demand) system and a partner node selecting method. The invention adopts network topology comprising a directory server, a content server and client nodes, wherein the directory server searches nodes in a node list according to user VOD segment information in a request of a client node and returns a node list containing a search result, and the client node selects an optimal node according to the returned node list, sends a request for establishing a connection and uses the remaining nodes as spare father nodes. The methodcomprises the following steps of: receiving a node with a connection request, judging whether the condition for establishing the connection is allowable and establishing the connection with the requesting node and enabling the requesting node to start receiving video data if the condition for establishing the connection is allowable; reselecting from the spare father nodes if the connection is unsuccessfully established; and directly requesting to the content server for establishing a connection by the requesting client node if all the spare father nodes fail. According to the invention, the extendible network node topology can be constructed so that the system has rapid interrupt recovery capability.

A method for recording a complete stream of live data packets from a server in a media cache with reduced server-cache bandwidth includes utilizing a first amount of server-cache bandwidth to receive only a portion of the complete stream of live data packets from the server, determining when the stream of live data packets from the server finishes, thereafter utilizing a second amount of server-cache bandwidth to receive missing portions of the complete stream of live data packets, and combining the portion of the complete stream of live data packets and the missing portions of the complete stream of live data packets to form the complete stream of live data packets in the memory.

A method and apparatus for adaptively obtaining bandwidth requests in a broadband wireless communication system, The method and apparatus includes dynamically varying technique combinations enabling a plurality of users to efficiently request bandwidth from a shared base station. A user may “piggyback” a new bandwidth request upon, or set a “poll-me bit” within, presently allocated bandwidth. A base station may poll users, individually or in groups, by allocating unrequested bandwidth for new requests. Polling may respond to a “poll-me bit,” and / or it may be adaptively periodic at a rate based on communication status parameters, such as recent communication activity and connection QoS levels Group polling permits a possibility of collisions. Polling policies may be established for dynamically varying user groups, or may be determined for each user. Dynamic selection of appropriate polling techniques makes use of efficiency benefits associated with each technique.

A system is provided where a number of representative video snapshots are displayed on a timeline indicating a position to jump to in a video using control buttons, such as fast forward, reverse, or a timeline scroll bar. The video snapshots are obtained by opening a low resolution connection to a video server to receive forward looking video segments. The forward looking video segments are summarized and the representative video snapshots are selected and displayed to provide a reference frame for the user to select a timeline position, or snapshots directly linked to positions in the higher resolution video. Backward looking video segments may be similarly summarized from the low resolution connection, or alternatively from video previously played. As the video progresses, new forward looking video segments are received and new representative video snapshots are summarized and displayed in close proximity with the video being played.

Different bits in a payload of data to be transmitted from a sending application receive different classes of treatment. The payload data is divided into a first group of bits associated with a first treatment class and a second group of bits associated with a second treatment class. A first packet is created which includes the first group of bits and a first header that identifies the first packet with the first treatment class. A second packet is created that includes the second group of bits and second header that identifies the second packet with the second treatment class. Using the first header, the first packet is mapped to a first bearer that is configured to support the first treatment class. Using the second header, the second packet is mapped to a second bearer configured to support the second treatment class.

A method and apparatus for adaptively obtaining bandwidth requests in a broadband wireless communication system. The method and apparatus includes dynamically varying technique combinations enabling a plurality of users to efficiently request bandwidth from a shared base station. A user may “piggyback” a new bandwidth request upon, or set a “poll-me bit” within, presently allocated bandwidth. A base station may poll users, individually or in groups, by allocating unrequested bandwidth for new requests. Polling may respond to a “poll-me bit,” and / or it may be adaptively periodic at a rate based on communication status parameters, such as recent communication activity and connection QoS levels Group polling permits a possibility of collisions. Polling policies may be established for dynamically varying user groups, or may be determined for each user. Dynamic selection of appropriate polling techniques makes use of efficiency benefits associated with each technique.

An apparatus having a server is disclosed. The server may be configured to (i) receive via a network a first clip of video generated by a camera, (ii) receive via the network first information to edit the first clip, (iii) receive via the network one or more segments of a second clip of video generated by the camera as identified by the first information and (iv) create a third clip of video by editing the segments according to the first information. The second clip is generally a higher resolution version of the first clip. The third clip may have the higher resolution.

The invention relates to a method for the transfer of policy control information during handover in a communication system. A session between a terminal and a remote node via a first network node has been established previously. The session comprising media components transmitted via the first gateway using first media component bearers. A handover condition is detected and a signaling connection is established between the terminal and the second gateway. Information on a second network node is obtained by the terminal, which determines if a proxy for the session has changed. If it has, information on media components is sent to a policy decision entity associated with the second network node. The policy decision entity authorizes second media component bearers with the information provided. Finally, the second media component bearers are established between the terminal and the second gateway.

A distributed push-pull information service system comprises an information service server and at least one client device. The server provides at least a first kind of information in a pushing basis by means of broadcasting and a second kind of information in a pulled basis by means of user demand. The client device can receive the broadcasted first kind of information and send a pulling request to the server for acquiring the second kind of information. The first and second kinds of information are transmitted by means of compressed and encrypted raw data. The client device further comprises a graphic user interface module for transforming at least part of the transmitted raw data into a graphic which is then displayed on the client device. The pulling request includes a search request which contains at least a specific term and a specific time period to be searched. Any information stored in the server meets that specific term during that specific period of time will be transmitted back to the client device as a result of search. The distributed information service system of the present invention also discloses the concept of “Intelligent Pull”, when the user makes a pull request, only the information which is absent in the memory of client device will be pulled, and thus the usage of bandwidth is highly efficient.

The invention discloses a transaction quick confirmation method and device based on a block chain technology, wherein, the method comprises the following steps: step S1, confirming the node identity and electing a consensus committee and a committee leader; S2, submitting the transaction to the committee, so that the committee leader initiates a round of BLS aggregation signatures for the transaction, and broadcasting the total signatures for the transaction on the whole network to quickly confirm the transaction; Step S3, packaging and summarizing the confirmed transactions by the committee leader, forming a current round block by the transaction package, the transaction proof, the previous block hash and the current unspent transaction pool, sending the current round block and the blockhash value to the members of the committee, and operating the consensus within the committee to generate a new block. The method can realize the fast confirmation of the transaction, and effectively improves the practicability and reliability of the transaction, which is simple and easy to realize.

Characters of the invention are that when receiving message of member relation report in Internet group management protocol (IGMP) sent from connected host, the three layer exchanger checks-up attribute of port, which receives the message. If the said port is not a port on pointed route connected to interface network segment, which belongs to the three layer exchanger, when receiving multicast data stream of multicast group from the port, the three layer exchanger through the port forwards multicast data stream to the said host directly. The invention saves bandwidth consumption effectively so as to raise efficiency for forwarding multicast stream.

The size of packet payloads are varied according to the amount of congestion in a packet network. More data is put in packet payloads when more congestion exits in the packet network. When network congestion is high, less network bandwidth is available for transmitting packets. Accordingly, the packet payloads are transmitted with larger payloads to reduce the percentage of overhead in each packet. When there is little or no network congestion smaller packet payloads are transmitted. The additional overhead created in transmitting smaller packets is acceptable when there is little or no network congestion because the network currently has excess bandwidth. Thus, the packet payloads are dynamically adjusted to use network resources more effectively.

Disclosed is a method, system and device for searching active nodes in P2P(peer to peer) streaming media system. Selectable nodes briefly and efficiently report their own subblocks information to a tracker device, such as the number of the continuous buffered subblocks, the sequence number of the first subblock of the continuous subblocks and the total number information of the buffered subblocks; the tracker device can select suitable candidate nodes for a request node according to the subblocks information of the selectable nodes, therefore the request node can determine active nodes without sending a large amount of detections to the candidate nodes; the waste of communication resources is avoided and the bandwidth cost is reduced; also, the selectable nodes can report characters of the networks where they locate, and the tracker device can select nodes in wired network to be candidate nodes first, therefore, the transmission speed of the whole P2P system is improved and the waiting delay of the request node is reduced.

The invention proposes an efficient duplicate removal method for repeated redundant data in a cloud storage system. The method comprises the following steps: multiple clients receive data uploaded by a user, take a data superblock as a data route unit, and extract route feature fingerprints for data route selection from the data; a metadata server and a data server cluster handle data route selection requests of the clients according to a route policy, wherein the data server cluster performs similar fingerprint matching on the route feature fingerprints to determine similar route nodes, and the metadata server determines a final data route address according to a load balancing policy; and the clients interact with corresponding data servers, and the data servers receiving similar redundant data perform efficient and quick duplicate removal on the redundant data. According to the method, the cloud storage system can achieve an efficient repeated redundant data removal effect while keeping high-performance, large-scale and high-throughput system properties, the disk utilization rate is increased, and the data management cost is reduced.

Various embodiments are described to address the need for providing substantially reduced PTT call setup times and more efficient wireless bandwidth utilization for PTT sessions utilizing an IP-based protocol. The use of non-IP messaging between an originating MS (101) and PCF (131) and a target MS (102) and PCF (132), the use of IP-based messaging between the PCFs, the use of access channel signaling by the originating MS, and the generation of SIP responses by a target PCF on behalf of the target MS are described. Embodiments incorporating some or all of these protocol changes, can provide either, or both, reduced end-to-end call setup time for PTT as it presently exists in IS-2000 systems or reduced bandwidth consumption.

The invention discloses an IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method, which relates to the field of wireless sensor networks and comprises the following steps of: a, when a 6LoWPAN sensor node is added into the network, establishing a root node of tree topology, and configuring the basic information of the network to the root node; b, adding other ordinary nodes into the network; and c, forming routing. Moreover, the step c comprises the following steps of: under any one of the three conditions of leaf node invalidation or leaving, non-leaf node invalidation or leaving and node movement, triggering a routing restoring process; and under any one of the three conditions of no leaf node invalidation or leaving, no non-leaf node invalidation or leaving and no node movement, finishing the processing. In the 6LoWPAN neighbor discovery-based tree routing method, an additional routing protocol message is not required to be transmitted and received, so the bandwidth and the routing calculation overhead are reduced, energy consumption produced in the message transmission of the nodes is saved, and the energy consumption and routing overhead of the whole network are further reduced.

The embodiment of the invention provides a communication processing method and device, a computer readable medium and an electronic device. The communication processing method comprises the followingsteps: acquiring a scheduling request data packet from terminal device, wherein a destination address of the scheduling request data packet is a network address of an appointed service scheduler; replacing the source address of the scheduling request data packet with the network address of the edge computing device to obtain a target data packet; sending the target data packet to a specified service scheduler, so that the specified service scheduler returns a scheduling feedback data packet containing a network address of an edge computing device; and receiving the scheduling feedback data packet, replacing the destination address of the scheduling feedback data packet with the network address of the terminal device, and sending the scheduling feedback data packet to the terminal device, so that the terminal device initiates a service access request to the edge computing equipment according to the network address of the edge computing equipment. According to the technical scheme of theembodiment of the invention, the service access delay of the terminal device can be effectively reduced through the edge computing equipment.

The invention relates to route method based on tree structure. It includes the following steps: judging data source after grouping; for the lower level node checking up run routing list, selecting one node as relay node, and transmitting the data grouping into the upper level node; for the upper level node checking the down run routing list, selecting one route reached to destination node, and transmitting the data grouping to the next jump node. The up run routing list records the node ID, jump number and the neighbor node ID and jump number. The down one records upper layer node list, peer node list, down run chain route information. The invention has the advantages of little control spending, high data transmitting efficiency, low bandwidth consumption, suiting for network topology dynamic change.