US2006168302A1PendingUtilityA1

System for distributing objects to multiple clients

47
Assignee: BOSKOVIC RONALDPriority: Jun 27, 2002Filed: Feb 17, 2006Published: Jul 27, 2006
Est. expiryJun 27, 2022(expired)· nominal 20-yr term from priority
H04L 65/1101H04L 47/30H04L 47/15H04N 7/152H04L 65/4053
47
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A method for updating a set of presentation images through a single-buffered multipoint dispatcher over a network to multiple clients is provided. Each screen of a set of screens included in the presentation is divided into tiles. Packets respectively corresponding to the tiles of a first screen are stored in a single buffered multipoint dispatcher according to a time sorted hierarchy, a top packet having a most recent time value and a bottom packet having a least recent time value. Each tile of the first screen is compared with a corresponding tile of a second screen to identify any non-matching tile pairs. For each non-matching tile of the second screen, a packet corresponding to that non-matching tile is provided to the single buffered multipoint dispatcher. Then, non-matching tiles of the first screen are replaced with the respective non-matching tiles of the second screen, while maintaining the time sorted hierarchy. Such replacement supports clients with different connection speeds at different frame rates.

Claims

exact text as granted — not AI-modified
1 . A method for updating a set of images for a presentation through a single-buffered multipoint dispatcher over a network to multiple clients, comprising: 
 dividing each screen of a set of screens included in a presentation into tiles;    storing packets respectively corresponding to the tiles of a first screen in a single buffered multipoint dispatcher according to a time sorted hierarchy, wherein a top packet has a most recent time value and a bottom packet has a least recent time value;    comparing each tile of the first screen with a corresponding tile of a second screen to identify any non-matching tile pairs;    providing, for each non-matching tile of the second screen, a packet corresponding to that non-matching tile to the single buffered multipoint dispatcher; and    replacing each packet corresponding to a non-matching tile of the first screen with the packet corresponding to the paired non-matching tile of the second screen, while maintaining the time sorted hierarchy, wherein the replacing packets while maintaining the time sorted hierarchy supports clients with different connection speeds at different frame rates.    
   
   
       2 . The method of  claim 1 , wherein the method operation of storing includes: 
 placing the packets in a fixed size queue according to a time introduced into the single buffered multipoint dispatcher.    
   
   
       3 . The method of  claim 1 , wherein the method operation of providing includes: 
 grouping multiple packets together to define a single packet to be provided to the single buffered multipoint dispatcher.    
   
   
       4 . The method of  claim 3 , wherein the multiple packets are grouped according to a time stamp and an index.  
   
   
       5 . The method of  claim 1 , wherein in response to replacing packets, the method includes: 
 identifying a pointer pointing at one of the replaced packets; and    moving the pointer to point at a packet below the one of the replaced packets.    
   
   
       6 . The method of  claim 1 , wherein the single buffered multipoint dispatcher includes a bandwidth control channel configured to support a regulating protocol enabling the single buffered multipoint dispatcher to notify a process feeding the packets to modify a delivery speed based upon a client latency.

Cited by (0)

No later patents cite this yet.

References (0)

No backward citations on record.