Dynamic resource sharing among multiple wireless devices

Information

  • Patent Grant
  • 9398089
  • Patent Number
    9,398,089
  • Date Filed
    Thursday, December 11, 2008
    16 years ago
  • Date Issued
    Tuesday, July 19, 2016
    8 years ago
Abstract
A system and method that enables two or more hosts so that they can share a resource, such as a display. Client allocates a portion of the resource to each of the eligible hosts. This allocated size is negotiable among host(s) and the client. Client may request the hosts to scale down/up resource utilization based on the allocated portion of the resource being shared. This helps keep the client implementation simple. In this case, client maintains the allocation vector for each host. This allocation vector is used to keep track of the resource sharing. While this is a preferred approach, it is possible that “intelligent” client may actually modify resource utilization for a given host based on the negotiated allocation.
Description
REFERENCE TO CO-PENDING APPLICATIONS FOR PATENT

The present Application for Patent is related to the following U.S. patent applications:


“Wireless Architecture for a Traditional Wire-Based Protocol”, U.S. patent application Ser. No. 12/179,411, filed Jul. 24, 2008, which claims priority to “Wireless Architecture for a Traditional Wire-Based Protocol”, U.S. Provisional Patent Application Ser. No. 60/951,919 filed Jul. 25, 2007; and


“Apparatus and Methods for Establishing Client-Host Associations Within a Wireless Network”, U.S. patent application Ser. No. 12/098,025, filed Apr. 4, 2008.


BACKGROUND

1. Field


The presently claimed invention relates to ad-hoc networks, and more specifically to dynamically sharing resources as hosts enter and leave the network, and a system for negotiation and allocation of resources among hosts.


2. Background


When a wireless device needs to access a resource or service provided by another wireless device, they need to pair up and establish dedicated ad-hoc service between them. With the increased use of wireless ad-hoc networks, it is desirable to have the ability to share such resource and/or service provided by one client among multiple ad-hoc hosts.


At present, a solution is available where a wireless host can copy the data to a remote hard disk after establishing a wireless ad-hoc network. However, it is desirable that two or more users can archive their data from their portable devices to the same hard disk simultaneously. The presently claimed invention provides a solution by making a remote hard disk “just intelligent enough” so multiple users can share its memory.


There are proposals that would allow a wireless host to access the remote screen and render its own images onto this bigger remote screen. However, it is desirable that two or more hosts can setup the ad-hoc network and share the remote display. With the claimed invention, they can negotiate the amount of sharing, and coordinate their sharing.


Another classic example is some TV sets support picture-in-picture where multiple channels share the display area. However, a lot of “intelligence” is required inside the TV set. The TV set can only handle a fixed number of sources. Also, the sharing of display regions is fixed. This proposal enables simple clients to share the display by controlling the images' resolution sent by the ad-hoc hosts, dynamically. It also allows as many hosts as possible to access the resources in an ad-hoc manner. The resource allocation is flexible based on the negotiation among the hosts.


SUMMARY

Aspects disclosed herein address the above stated needs by a method, system, and computer program product for dynamically sharing a client resource among two or more hosts. The client allocates a portion of the resource, such as a portion of a display, to each of the hosts. This allocation can be negotiated between the hosts and the client. The client can request one or more hosts to scale up or down the use of resource. For example, the client can command that two or more hosts scale down the image area being used by each host to fill the maximum total display area. An allocation vector is maintained by the client for each host. This allocation vector is used to track the resource sharing amongst the hosts. Alternately, a client can dynamically scale the resource usage based on the allocated portion of the resource.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 shows an exemplary allocation of client resources.



FIG. 2 describes the establishment of a shared session.



FIG. 3 describes the negotiation of the shared allocation.



FIG. 4 shows how the allocated shares are rebalanced after a host departs the system.





DETAILED DESCRIPTION

The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any aspect described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects.


Aspects disclosed herein address the above stated problem by providing a system for product for dynamically sharing a client resource among two or more hosts. Wireless devices/equipments interact amongst each other within a wireless network. Often, a wireless device (host) accesses one or more service(s) from another wireless device (client). In order to access and monitor the service(s), the host or the client initiates an association. This way, the host and the client establish a temporary wireless association between them. During the period of the association, the host exclusively uses the service (e.g., display) provided by the client. However, at times, it is desirable to have the ability to share the client resource (e.g., display) among multiple host devices.


The claimed invention enables two or more hosts so that they can share a client resource, such as a display as shown in FIG. 1. Client 10 allocates a portion of the resource (e.g., a fraction of display) to each of the eligible hosts 12, 14, and 16. As shown in the exemplary aspect in FIG. 1, Host_112 is allocated fifty percent (50%) of client resources 18, Host_214 is allocated twenty five percent (25%) of client resources 20 and Host_316 is allocated the remaining twenty five percent (25%) of client resources 22. The following is merely an example, thus the allocation can include more or less hosts and an infinite number of percentages of allocations. This allocated size is negotiable among host(s) 12, 14 and 16 and client 10. Client 10 may request hosts 12, 14, and 16, to scale down/up size of the image(s) being sent based on the allocated size of the display area being shared. This helps keep the client implementation simple. In this case, client 10 maintains an allocation vector for each host. This allocation vector is used to render the image at the allocated area. While this is a preferred approach, an optional system provides an “intelligent” client 10 that can scale down/up incoming image(s) based on the size of the allocated area for the image.


Hosts 12, 14, and 16 can specify “share-mode” at the time of establishing an association with client 10. The “share-mode” can include, but is not limited to following the modes:


Exclusive use—This mode implies that the host does not wish to share the resource with other hosts. In this case, client rejects any new request to share the resource including “exclusive use” request.


For example, if a client is in “exclusive use” association with a host, it will reject any type of share request from another host. In addition, if a client is in “non-exclusive use” association with a host, it will reject any request with “exclusive use” because the client is already in use.


Time Sliced Primary Tenant (TSPT)—In this mode, the TSPT exclusively uses the client resource(s). However, when Time Sliced Secondary Tenants (TSST) request permission to use the client resource(s), TSPT may grant the permission so that TSST can use the client resource(s) exclusively for the time being. However, TSPT can seize the client resources any time or when the TSST relinquishes the permission to use the client resource(s). Preferably, this mode should be used in Owner-Tenant fashioned cluster, as described below.


Primary Tenant—This mode implies that this host is the primary tenant. Hence, by default, it will consume a significant portion of the resource.


Time Sliced Secondary Tenants (TSST)—In this mode, TSST acquires the permission to exclusively use the client resources from the TSPT. However, it may have to relinquish the permission at the will of TSPT. As with TSPT, this mode should be used in Owner-Tenant fashioned cluster.


Secondary Tenant—This mode implies that this host would use a smaller portion of the resource, whereas a significant portion of the display area/resource will be occupied by the primary tenant. The secondary tenant can request to become primary tenant. Client may or may not grant it depending upon permission granted by the current primary tenant.


Equal Share Tenant—This mode implies that client will make sure to allocate equal amounts of the resource to each of the sharing hosts.


In another aspect, a host provides the resource sharing preferences to the client. Hosts may specify their preferences while requesting an association or negotiate it at anytime during the life of the association. If possible, client would accept the preferences as requested. Otherwise, hosts can negotiate the preferences with the client at a later time. These preferences include but are not limited to the following scenarios.


Preferred Portion—A host can specify a particular portion of the resource (e.g., a particular portion of a display surface) it desires to use. If there is no conflict, client grants the preference. However, if there is a conflict, client may negotiate the allocation with the current tenant (e.g., host currently using the specified location).


This sharing cluster may be established in “owner-tenant” or “all-tenant” fashion.


Owner-Tenant—In this case, a host becomes owner of the resource based on the predefined criteria (e.g., first host to establish the association with the client). Any other hosts sharing the resource are considered tenants. If the client receives requests to share the resource from other hosts, it would get the permission from the owner only, regardless of the number of tenants sharing the resource. If the current owner leaves the association, it transfers the ownership to another host using the predefined procedure using a wireless association ownership handover using any type of handover system, such as the one described in “Apparatus and Methods for Establishing Client-Host Associations Within a Wireless Network”, U.S. patent application Ser. No. 12/098,025, filed Apr. 4, 2008.


All-Tenant—In this case, all the hosts sharing the device are considered tenants. If client receives another request to share the resource, it seeks the permission from all the active tenants (e.g., currently sharing the resource).


If one or more host(s), sharing the resource, leave(s) the shared cluster, client would recoup the resource occupied by the leaving host and rebalance the sharing among active hosts. Client also notifies the respective updated share information to each of the active hosts. Accordingly, host(s) may scale up/down their resource usage.


In another aspect, if client reaches a specified limit on the number of owner and/or tenants, it may reject any new requests to share the resource. While this is a preferred method, it is possible that client may choose to drop sharing with an existing host in favor of a new request based on the predefined criteria (e.g., sharing priority).


In one more aspect, a qualifying host based on predefined criteria (e.g., owner or highest priority), may request to access entire resource. In this event, the client may drop the rest of the host(s) from sharing the resource.


While the above description assumes that the sharing events are brokered through the client, it is possible that hosts can negotiate sharing among themselves.


Operation—The operation of the claimed invention is described by the following examples. Although these examples only describe two hosts, it is anticipated that the system operates similarly with any number of hosts, and these exemplary aspects are meant for simple explanation of the system and not a limitation. The implementation of the claimed invention requires that a shared session be established and is depicted in FIG. 2. Initially, an association 24 exists between Host_112 and a client 10. An association request 30 can be made by another host, such as Host_214. Host_214 specifies one of the share-modes in a request to share, as specified above. Client 10 may accept (or reject) the request depending upon the type of the specified share-mode and whether there are any other hosts using the client 10 resource. When Host_214, requests to share the client resource while sending the association request to share 30, client seeks the permission 26 from the current owner (or all tenants), in this case Host_112, to allow the entry. If current owner (or all tenants) grant(s) the permission, client 10 accepts the association request with grant to share-mode 28 and provides an acknowledgment of the association 32. Client updates and sends the sharing information 34 and 34′ (e.g., size, location of the shared area, instruction to scale down/up resource usage) to Host_112 including the new one, Host_214. Upon acceptance, new Host_214 and existing Host_112 make the necessary changes (e.g., scales down the resource consumption) and start/continue using the client services using updated traffic mode 36 and 36′.


The negotiation of the allocation of the client 10 resources is shown in FIG. 3. When one of the hosts, in this case Host_214, is already engaged in association with client 10 and wants to change the sharing of the client resource (e.g., display), Host_214 sends a “ReqToUpdateShare” 40 to client 10. Client 10 seeks permission to update share 42 from the other host(s) (e.g., owner or all tenants), in this case Host_112, for the change in share. If the other host(s), Host_112, grants the permission 44, client 10 acknowledges the “ReqToUpdateShare” by sending Ack 46 to Host_214. Client 10 also sends the updated sharing information to all the hosts having active association with the client using “UpdateSharedInfo” 48 and 48′. Client includes the necessary change request (e.g., scale down/up) in this message. When host(s), Host_112 and Host_214, receive the “UpdateSharedInfo” 48 and 48′ message, they take necessary action and respond with “UpdateSharedInfoAck” 50 and 50′ to client 10. Then, they start sending the updated traffic 52 and 52′. The “UpdateSharedInfo” 48 and 48′ can also be activated at certain predetermined time intervals to insure the system is balanced.



FIG. 4 shows the system for rebalancing the allocated shares of client 10 resources. When client 10 receives the “UpdateSharedInfoAck” 50 and 50′ of FIG. 3, it updates the allocation vector 54 and continues processing updated traffic 52 and 52′ (e.g., displays images using new share). When Host_214 leaves the association 56, client 10 rebalances the resource allocation 58 amongst remaining hosts, in this case Host_112. It sends the “UpdateShareInfo” 48 signal to all the remaining hosts, in this case Host_112, as described in the description of FIG. 3. When Host_112 receives the “UpdateShareInfo” 48, it and client 10 make necessary changes as described in the negotiate allocation section of FIG. 3.


In an established ad-hoc network, if a host wants to modify its share mode, such as upgrading or downgrading to higher privilege mode (e.g. secondary tenant to primary tenant), or a lower privilege mode it sends the request to the client to modify its (host's) own share mode. The client grants the requests if there is no other active host with the requested privilege mode. If a host with the same share mode present in the ad-hoc network, the client will seek the permission from the host. The host may grant it while specifying new share mode for itself or reject it. If the host grants the permission, the client allows the requesting host to upgrade its share mode. Alternately, if a host with higher privilege (e.g. primary) mode intends to depart the ad-hoc network, it may send a request to the client to nominate another active host for the privileges it had. The client may select a host to assign these privileges based on predetermined criteria or by polling the all the active hosts within the ad-hoc network


Those of skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.


Those of skill in the art would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the aspects disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above, generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the presently claimed invention.


The various illustrative logical blocks, modules, and circuits described in connection with the aspects disclosed herein may be implemented or performed with a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.


The steps of a method or algorithm described in connection with the aspects disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in Random Access Memory (RAM), flash memory, Read Only Memory (ROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.


The previous description of the disclosed aspects is provided to enable any person skilled in the art to make or use the presently claimed invention. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects without departing from the spirit or scope of the claimed invention. Thus, the presently claimed invention is not intended to be limited to the aspects shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims
  • 1. A method for sharing resources among at least two devices in a digital communication system, the method comprising: establishing a shared session;receiving a request to share a client resource from at least one active host in a first predetermined share mode;receiving a request to share the client resource from at least one inactive host in a second predetermined share mode;requesting permission from the at least one active host to share the client resource with the at least one inactive host;receiving a response to the request for permission from the at least one active host;sending a client resource allocation vector to the at least one active host and the at least one newly active host;allocating a first portion of the client resource to the at least one active host and a second portion of the client resource to the at least one newly active host; andnegotiating the allocation with the at least one active host and the at least one newly active host, wherein the step of negotiating further comprises transferring of permissions and preferences.
  • 2. The method of claim 1, further comprising maintaining the client resource allocation vector.
  • 3. The method of claim 1, further comprising acknowledging the response to the at least one active host.
  • 4. The method of claim 1, wherein the response comprises a rejection.
  • 5. The method of claim 1, wherein the at least one active host, comprising at least one tenant, has a use of a full or partial client resource.
  • 6. The method of claim 5, wherein the at least one tenant comprises a member from the group consisting of an exclusive use tenant, a primary tenant, a secondary tenant, a time sliced primary tenant, a time sliced secondary tenant and an equal share tenant.
  • 7. The method of claim 5, wherein the at least one active host grants permission to the at least one inactive host, comprising the at least one tenant, to use the full or partial client resource.
  • 8. The method of claim 5, wherein the at least one tenant relinquishes the permission.
  • 9. The method of claim 1, further comprising updating the resource allocation vector.
  • 10. The method of claim 9, wherein the updating occurs at predetermined instances.
  • 11. The method of claim 1, wherein the client resource comprises a display.
  • 12. The method of claim 11, wherein the client resource comprises a surface area of the display and a location on the display.
  • 13. The method of claim 1, further comprising reallocating the client resource upon addition or subtraction of active and newly active hosts.
  • 14. The method of claim 13, further comprising notifying the at least one active host of the reallocation.
  • 15. The method of claims 1, wherein the response comprises a delayed start for using the client resource.
  • 16. An apparatus for sharing resources among at least two devices in a digital communication system, comprising: means for establishing a shared session;means for receiving a request to share a client resource from at least one active host in a first predetermined share mode;means for receiving a request to share the client resource from at least one inactive host in a second predetermined share mode;means for requesting permission from the at least one active host to share the client resource with the at least one inactive host;means for receiving a response to the request for permission from the at least one active host;means for sending a client resource allocation vector to the at least one active host and the at least one newly active host;means for allocating a first portion of the client resource to the at least one active host and a second portion of the client resource to the at least one newly active host; andmeans for negotiating the allocation with the at least one active host and the at least one newly active host, wherein the means for negotiating further comprises means for transferring of permissions and preferences.
  • 17. The apparatus of claim 16, further comprising a means for maintaining an allocation vector.
  • 18. The apparatus of claim 16 further comprising a means for a acknowledging the sought permission to the at least one active host.
  • 19. The system apparatus of claim 16, wherein the response comprises a rejection.
  • 20. The system apparatus of claim 16, wherein the at least one active host, comprising at least one tenant, has a use of a full or partial client resource.
  • 21. The apparatus of claim 20, wherein the at least one tenant comprises a member from the group consisting of an exclusive use tenant, a primary tenant, a secondary tenant, a time sliced primary tenant, a time sliced secondary tenant and an equal share tenant.
  • 22. The system apparatus of claim 20, wherein the at least one active host grants permission to the at least one inactive host, comprising the at least one tenant, to use the full or partial client resource.
  • 23. The system apparatus of claim 20, wherein the at least one tenant relinquishes the permission.
  • 24. The system apparatus of claim 16, further comprising a means for updating the resource allocation vector.
  • 25. The system apparatus of claim 24, wherein the means for updating is activated at predetermined instances.
  • 26. The system of claim 16, wherein the client resource comprises a display.
  • 27. The system of claim 16, wherein the client resource comprises a surface area of the display and a location on the display.
  • 28. The system of claim 16, further comprising a means for reallocating the client resource upon addition or subtraction of active and newly active hosts.
  • 29. The system of claim 28, further comprising a means for notifying the at least one active host of the reallocation.
  • 30. The system of claims 16, wherein the response comprises a delayed start for using the client resource.
  • 31. A non-transitory storage media comprising program instructions which are computer-executable to implement sharing of resources among at least two devices in a digital communication system, the storage media comprising: program instructions to establish a shared session;program instructions to receive request to share a client resource from at least one active host in a first predetermined share mode;program instructions to receive a request to share the client resource from at least one inactive host in a second predetermined share mode;program instructions to request permission from the at least one active host to share the client resource with the at least one inactive host;program instructions to receive a response to the request for permission from the at least one active host;program instructions to send a client resource allocation vector to the at least one active host and the at least one newly active host;program instructions to allocate a first portion of the client resource to the at least one active host and a second portion of the client resource to the at least one newly active host; andprogram instructions to negotiate the allocation with the at least one active host and the at least one newly active host, wherein the program instructions to negotiate further comprise program instructions to transfer permissions and preferences.
  • 32. The storage media of claim 31, further comprising program instructions to maintain an allocation vector.
  • 33. The storage media of claim 31, further comprising program instructions to acknowledge the response to the at least one active host.
  • 34. The storage media of claim 31, wherein the response comprises a rejection.
  • 35. The storage media of claim 31, wherein the at least one active host, comprising at least one tenant, has a use of a full or partial client resource.
  • 36. The storage media of claim 35, wherein the at least one tenant comprises a member from the group consisting of an exclusive use tenant, a primary tenant, a secondary tenant, a time sliced primary tenant, a time sliced secondary tenant and an equal share tenant.
  • 37. The storage media of claim 35, wherein the at least one active host grants permission to the at least one inactive host, comprising the at least one tenant, to use the full or partial client resource.
  • 38. The storage media of claim 35, wherein the at least one tenant relinquishes the permission.
  • 39. The storage media of claim 31, further comprising program instructions to update the resource allocation vector.
  • 40. The storage media of claim 39, further comprising program instructions to update the resource allocation vector at predetermined instances.
  • 41. The storage media of claim 31, wherein the client resource comprises a display.
  • 42. The storage media of claim 41, wherein the client resource comprises a surface area of the display and a location on the display.
  • 43. The storage media of claim 31, further comprising program instructions to reallocate the client resource upon addition or subtraction of active and newly active hosts.
  • 44. The storage media of claim 43, further comprising program instructions to notify the at least one active host of the reallocation.
  • 45. The storage media of claims 31, wherein the response comprises a delayed start for using the client resource.
  • 46. A method for sharing resources among at least two devices in a digital communication system, the method comprising: establishing a shared session;requesting a client resource by a first host from a client in a first predetermined share mode;receiving a request for permission from the client to share the client resource with a next host;providing a response to the request for permission to the client;negotiating an allocation of the client resource with the next host, wherein the negotiating further comprises transferring of permissions and preferences; andreceiving a client resource allocation vector from the client.
  • 47. The method of claim 46, wherein the negotiating comprises negotiating between the first host and the next host brokered through the client.
  • 48. The method of claim 46, wherein the negotiating comprises directly negotiating between the first host and the next host.
  • 49. The method of claim 48, comprising sending information on the allocated first portion and the first host to the next host.
  • 50. The method of claim 48, further comprising the providing an updated allocation vector to the client.
  • 51. An apparatus for sharing resources among at least two devices in a digital communication system, comprising: means for establishing a shared session;means for requesting a client resource by a first host from a client in a first predetermined share mode;means for receiving a request for permission from the client to share the client resource with a next host;means for providing a response to the request for permission to the client;means for negotiating an allocation of the client resource with the next host, wherein the means for negotiating further comprises a means for transferring of permissions and preferences; andmeans for receiving a client resource allocation vector from the client.
  • 52. The apparatus of claim 51, wherein the means for negotiating comprises a means for negotiating between the first host and the next host brokered through the client.
  • 53. The apparatus of claim 51, wherein the means for negotiating comprises a means for directly negotiating between the first host and the next host.
  • 54. The apparatus of claim 53, further comprising a means for sending information on the allocated first portion and the first host to the next host.
  • 55. The apparatus of claim 53, further comprising a means for providing an updated allocation vector to the client.
  • 56. A non-transitory storage media comprising program instructions which are computer-executable to implement sharing of resources among at least two devices in a digital communication system, the storage media comprising: program instructions to establish a shared session;program instructions to request a client resource by a first host from a client in a first predetermined share mode;program instructions to receive a request for permission from the client to share the client resource with a next host;program instructions to provide a response to the request for permission to the client;program instructions to negotiate an allocation of the client resource with the next host, wherein the program instructions to negotiate further comprise program instructions to transfer permissions and preferences; andprogram instructions to receive a client resource allocation vector from the client.
  • 57. The storage media of claim 46, wherein the program instructions to negotiate comprise program instructions to negotiate between the first host and the next host brokered through the client.
  • 58. The storage media of claim 46, wherein the program instructions to negotiate comprise program instructions to directly negotiate between the first host and the next host.
  • 59. The storage media of claim 58, comprising program instructions to send information on the allocated first portion and the first host to the next host.
  • 60. The storage media of claim 58, further comprising program instructions to provide an updated allocation vector to the client.
  • 61. A method for sharing resources among at least two devices in a digital communication system, the method comprising: requesting a client resource from a client in a first predetermined share mode, wherein at least a first portion of the client resource is allocated to at least one active host;negotiating an allocation of the client resource, wherein the step of negotiating further comprises transferring of permissions and preferences;receiving an allocation of a second portion of the client resource from the client; andreceiving a client resource allocation vector from the client.
  • 62. The method of claim 61, wherein the negotiating comprises negotiating with the at least one active host brokered through the client.
  • 63. The method of claim 61, wherein the negotiating comprises directly negotiating with the at least one active host.
  • 64. The method of claim 63, further comprising acquiring information on the allocated first portion, the second portion, and the at least one active host.
  • 65. An apparatus for sharing resources among at least two devices in a digital communication system, comprising: means for requesting a client resource from a client in a first predetermined share mode, wherein at least a first portion of the client resource is allocated to at least one active host;means for negotiating an allocation of the client resource, wherein the step of negotiating further comprises transferring of permissions and preferences;means for receiving an allocation of a second portion of the client resource from the client; andmeans for receiving a client resource allocation vector from the client.
  • 66. The apparatus of claim 65, wherein the means for negotiating comprises means for negotiating with the at least one active host brokered through the client.
  • 67. The apparatus of claim 65, wherein the means for negotiating comprises means for directly negotiating with the at least one active host.
  • 68. The apparatus of claim 67, further comprising means for acquiring information on the allocated first portion, the second portion, and the at least one active host.
  • 69. A non-transitory storage media comprising program instructions which are computer-executable to implement sharing of resources among at least two hosts in a digital communication system, the storage media comprising: program instructions to request a client resource in a first predetermined share mode, wherein at least a first portion of the client resource is allocated to at least one active host;program instructions to negotiate an allocation of the client resource, wherein the step of negotiating further comprises transferring of permissions and preferences;program instructions to receive an allocation of a second portion of the client resource from the client; andprogram instructions to receive a client resource allocation vector from the client.
  • 70. The storage media of claim 69, wherein the program instructions to negotiate comprise program instructions to negotiate with the at least one active host brokered through the client.
  • 71. The storage media of claim 69, wherein the program instructions to negotiate comprise program instructions to directly negotiate with the at least one active host.
  • 72. The computer-readable storage media of claim 71, further comprising program instructions to acquire information on the allocated first portion, the second portion, and the at least one active host.
US Referenced Citations (293)
Number Name Date Kind
4791554 Hirota et al. Dec 1988 A
5828370 Moeller et al. Oct 1998 A
5835723 Andrews et al. Nov 1998 A
5925137 Okanoue et al. Jul 1999 A
6014706 Cannon et al. Jan 2000 A
6049549 Ganz et al. Apr 2000 A
6195680 Goldszmidt et al. Feb 2001 B1
6252889 Patki et al. Jun 2001 B1
6266690 Shankarappa et al. Jul 2001 B1
6400720 Ovadia et al. Jun 2002 B1
6424626 Kidambi et al. Jul 2002 B1
6515992 Weston et al. Feb 2003 B1
6594699 Sahai et al. Jul 2003 B1
6608841 Koodli Aug 2003 B1
6748195 Phillips Jun 2004 B1
6760772 Zou et al. Jul 2004 B2
6801530 Brandt et al. Oct 2004 B1
6876857 Nee et al. Apr 2005 B1
6917976 Slaughter et al. Jul 2005 B1
6963921 Yang et al. Nov 2005 B1
7035281 Spearman et al. Apr 2006 B1
7072984 Polonsky et al. Jul 2006 B1
7080151 Borella et al. Jul 2006 B1
7085420 Mehrotra Aug 2006 B2
7324462 Page et al. Jan 2008 B1
7328021 Satapathy Feb 2008 B1
7333464 Yang et al. Feb 2008 B2
7366204 Kang et al. Apr 2008 B2
7373415 DeShan et al. May 2008 B1
7376155 Ahn et al. May 2008 B2
7477659 Nee et al. Jan 2009 B1
7519470 Brasche et al. Apr 2009 B2
7529823 Trufinescu et al. May 2009 B2
7565357 Rao Jul 2009 B2
7688859 Chen et al. Mar 2010 B2
7696980 Piot et al. Apr 2010 B1
7712670 Sauerwein, Jr. et al. May 2010 B2
7716385 Saint-Hilaire et al. May 2010 B2
7719972 Yuan et al. May 2010 B2
7720096 Klemets May 2010 B2
7768536 Hyatt Aug 2010 B2
7835406 Oran et al. Nov 2010 B2
7881315 Haveson et al. Feb 2011 B2
7929475 Simonson et al. Apr 2011 B2
8001384 Yamamoto et al. Aug 2011 B2
8102849 Martinez Bauza et al. Jan 2012 B2
8157168 Sauerwein, Jr. et al. Apr 2012 B2
8364201 Fujisaki Jan 2013 B1
8406961 Pathak et al. Mar 2013 B2
8428048 Walker et al. Apr 2013 B2
8437347 Casaccia et al. May 2013 B2
8466870 Cohen et al. Jun 2013 B2
8517251 Cohen et al. Aug 2013 B2
8593996 Lee et al. Nov 2013 B2
8605048 Ye et al. Dec 2013 B2
8605584 Leung et al. Dec 2013 B2
8612619 Guo et al. Dec 2013 B2
8724696 Byford et al. May 2014 B2
8966131 Huang et al. Feb 2015 B2
20020007494 Hodge Jan 2002 A1
20020035621 Zintel et al. Mar 2002 A1
20020097718 Korus et al. Jul 2002 A1
20030031152 Gohda et al. Feb 2003 A1
20030064752 Adachi et al. Apr 2003 A1
20030110297 Tabatabai et al. Jun 2003 A1
20030142631 Silvester Jul 2003 A1
20030152098 Zhu Aug 2003 A1
20030167171 Calderone et al. Sep 2003 A1
20030225737 Mathews Dec 2003 A1
20040039934 Land et al. Feb 2004 A1
20040071169 Abe et al. Apr 2004 A1
20040083284 Ofek et al. Apr 2004 A1
20040103282 Meier et al. May 2004 A1
20040147264 Ogawa Jul 2004 A1
20040160967 Fujita et al. Aug 2004 A1
20040202249 Lo et al. Oct 2004 A1
20040214571 Hong Oct 2004 A1
20050021810 Umemura et al. Jan 2005 A1
20050044142 Garrec et al. Feb 2005 A1
20050058090 Chang et al. Mar 2005 A1
20050060750 Oka et al. Mar 2005 A1
20050085239 Cedervall Apr 2005 A1
20050096086 Singamsetty May 2005 A1
20050102699 Kim et al. May 2005 A1
20050111361 Hosein May 2005 A1
20050130611 Lu et al. Jun 2005 A1
20050136990 Hardacker et al. Jun 2005 A1
20050138193 Encarnacion et al. Jun 2005 A1
20050144225 Anderson et al. Jun 2005 A1
20050149976 Lupoi et al. Jul 2005 A1
20050152330 Stephens et al. Jul 2005 A1
20050166241 Kim et al. Jul 2005 A1
20050175321 Aridome et al. Aug 2005 A1
20050176429 Lee et al. Aug 2005 A1
20050184993 Ludwin et al. Aug 2005 A1
20050198663 Chaney et al. Sep 2005 A1
20050219266 Koutani et al. Oct 2005 A1
20050266798 Moloney et al. Dec 2005 A1
20050267946 An et al. Dec 2005 A1
20060002320 Costa-Requena et al. Jan 2006 A1
20060002395 Araki et al. Jan 2006 A1
20060013182 Balasubramanian et al. Jan 2006 A1
20060028398 Willmore Feb 2006 A1
20060050640 Jin et al. Mar 2006 A1
20060053459 Simerly et al. Mar 2006 A1
20060058003 Lee Mar 2006 A1
20060069797 Abdo et al. Mar 2006 A1
20060098593 Edvardsen et al. May 2006 A1
20060101146 Wang May 2006 A1
20060103508 Sato May 2006 A1
20060133414 Luoma et al. Jun 2006 A1
20060136963 Oh et al. Jun 2006 A1
20060146009 Syrbe et al. Jul 2006 A1
20060187964 Li et al. Aug 2006 A1
20060198448 Aissi et al. Sep 2006 A1
20060199537 Eisenbach Sep 2006 A1
20060202809 Lane et al. Sep 2006 A1
20060203805 Karacali-Akyamac et al. Sep 2006 A1
20060206340 Silvera et al. Sep 2006 A1
20060209787 Okuda Sep 2006 A1
20060218298 Knapp et al. Sep 2006 A1
20060222246 Murai et al. Oct 2006 A1
20060223442 Stephens Oct 2006 A1
20060233191 Pirzada et al. Oct 2006 A1
20060236250 Gargi Oct 2006 A1
20060256851 Wang et al. Nov 2006 A1
20060268869 Boers et al. Nov 2006 A1
20060270417 Chi Nov 2006 A1
20060288008 Bhattiprolu et al. Dec 2006 A1
20070004387 Gadamsetty et al. Jan 2007 A1
20070008922 Abhishek et al. Jan 2007 A1
20070016654 Bowles et al. Jan 2007 A1
20070022195 Kawano et al. Jan 2007 A1
20070037600 Fukuda Feb 2007 A1
20070043550 Tzruya Feb 2007 A1
20070057865 Song et al. Mar 2007 A1
20070057885 Kurumisawa et al. Mar 2007 A1
20070061433 Reynolds et al. Mar 2007 A1
20070104215 Wang et al. May 2007 A1
20070126715 Funamoto Jun 2007 A1
20070141984 Kuehnel et al. Jun 2007 A1
20070141988 Kuehnel et al. Jun 2007 A1
20070157283 Setlur et al. Jul 2007 A1
20070162945 Mills Jul 2007 A1
20070171910 Kumar et al. Jul 2007 A1
20070182728 Fujimori Aug 2007 A1
20070211041 Lai et al. Sep 2007 A1
20070259662 Lee et al. Nov 2007 A1
20070264988 Wilson, Jr. et al. Nov 2007 A1
20070264991 Jones et al. Nov 2007 A1
20070274400 Murai et al. Nov 2007 A1
20070291636 Rajagopal et al. Dec 2007 A1
20070292135 Guo et al. Dec 2007 A1
20070299778 Haveson et al. Dec 2007 A1
20080005348 Kosiba et al. Jan 2008 A1
20080013658 Lewis et al. Jan 2008 A1
20080018657 Montag Jan 2008 A1
20080031210 Abhishek et al. Feb 2008 A1
20080037506 Dharmaraju et al. Feb 2008 A1
20080037785 Gantman et al. Feb 2008 A1
20080045149 Dharmaraju et al. Feb 2008 A1
20080046944 Lee et al. Feb 2008 A1
20080109763 Lee May 2008 A1
20080115183 Zato et al. May 2008 A1
20080129879 Shao et al. Jun 2008 A1
20080130612 Gorokhov et al. Jun 2008 A1
20080155057 Khedouri et al. Jun 2008 A1
20080198847 Yamagishi et al. Aug 2008 A1
20080198848 Yamagishi Aug 2008 A1
20080205394 Deshpande et al. Aug 2008 A1
20080211766 Westerman et al. Sep 2008 A1
20080231595 Krantz et al. Sep 2008 A1
20080232402 Higuchi et al. Sep 2008 A1
20080270532 Billmaier et al. Oct 2008 A1
20080273485 Tsigler et al. Nov 2008 A1
20080291863 Agren Nov 2008 A1
20080304408 Kraemer et al. Dec 2008 A1
20080307349 Wang et al. Dec 2008 A1
20080310391 Schneidman et al. Dec 2008 A1
20090002263 Pasetto Jan 2009 A1
20090010259 Sirotkin Jan 2009 A1
20090013081 Laroia et al. Jan 2009 A1
20090031035 Dharmaraju et al. Jan 2009 A1
20090070404 Mazzaferri Mar 2009 A1
20090083431 Balachandran et al. Mar 2009 A1
20090089453 Bohan et al. Apr 2009 A1
20090091656 Kitaru et al. Apr 2009 A1
20090094317 Venkitaraman Apr 2009 A1
20090102838 Bullard et al. Apr 2009 A1
20090109974 Shetty et al. Apr 2009 A1
20090133122 Koo et al. May 2009 A1
20090141180 Kondo et al. Jun 2009 A1
20090141692 Kasslin et al. Jun 2009 A1
20090147139 Watanabe et al. Jun 2009 A1
20090153737 Glen Jun 2009 A1
20090162029 Glen Jun 2009 A1
20090189860 Su et al. Jul 2009 A1
20090191926 Doyle Jul 2009 A1
20090201423 Sugiyama et al. Aug 2009 A1
20090252130 Sheth et al. Oct 2009 A1
20090288125 Morioka Nov 2009 A1
20090300676 Harter, Jr. et al. Dec 2009 A1
20090323562 Cho et al. Dec 2009 A1
20100027467 Wu et al. Feb 2010 A1
20100073334 Cohen et al. Mar 2010 A1
20100105334 Terry et al. Apr 2010 A1
20100118200 Gelman et al. May 2010 A1
20100123826 Sagi May 2010 A1
20100127847 Evans et al. May 2010 A1
20100134312 Park et al. Jun 2010 A1
20100146143 Thorup Jun 2010 A1
20100146583 Prehofer et al. Jun 2010 A1
20100166017 Na et al. Jul 2010 A1
20100172320 Suzuki Jul 2010 A1
20100189131 Branam et al. Jul 2010 A1
20100199187 Lin et al. Aug 2010 A1
20100205321 Martinez Bauza et al. Aug 2010 A1
20100245296 Sip et al. Sep 2010 A1
20100257238 Jeon et al. Oct 2010 A1
20100257450 Go et al. Oct 2010 A1
20100281103 Imai et al. Nov 2010 A1
20100289871 Tatsuta et al. Nov 2010 A1
20100289872 Funabiki et al. Nov 2010 A1
20100293287 Kobayashi Nov 2010 A1
20100306344 Athas et al. Dec 2010 A1
20110002255 Dharmaraju et al. Jan 2011 A1
20110019620 Wang Jan 2011 A1
20110037447 Mair Feb 2011 A1
20110051602 Matthews et al. Mar 2011 A1
20110069720 Jacobs et al. Mar 2011 A1
20110072473 Funabiki et al. Mar 2011 A1
20110107388 Lee et al. May 2011 A1
20110115818 Chung et al. May 2011 A1
20110128442 Blanchard et al. Jun 2011 A1
20110145879 Rajamani et al. Jun 2011 A1
20110149806 Verma et al. Jun 2011 A1
20110157470 Tsuruga et al. Jun 2011 A1
20110164058 Lemay Jul 2011 A1
20110167176 Yew et al. Jul 2011 A1
20110167181 Minoo et al. Jul 2011 A1
20110182195 Oikawa Jul 2011 A1
20110186138 Hanna et al. Aug 2011 A1
20110205433 Altmann Aug 2011 A1
20110216239 Raveendran Sep 2011 A1
20110216785 Begen et al. Sep 2011 A1
20110216829 Raveendran Sep 2011 A1
20110281557 Choi et al. Nov 2011 A1
20110314168 Bathiche et al. Dec 2011 A1
20120036543 George et al. Feb 2012 A1
20120036549 Patel et al. Feb 2012 A1
20120038825 Kanonich Feb 2012 A1
20120044985 Tao et al. Feb 2012 A1
20120060100 Sherwood et al. Mar 2012 A1
20120084670 Momchilov Apr 2012 A1
20120099566 Laine et al. Apr 2012 A1
20120113113 Hong May 2012 A1
20120147799 Nagara et al. Jun 2012 A1
20120154386 Nagara et al. Jun 2012 A1
20120162537 Maddali et al. Jun 2012 A1
20120249575 Krolczyk et al. Oct 2012 A1
20130002949 Raveendran et al. Jan 2013 A1
20130003621 Huang et al. Jan 2013 A1
20130003622 Huang et al. Jan 2013 A1
20130003623 Raveendran et al. Jan 2013 A1
20130003624 Huang et al. Jan 2013 A1
20130009873 Huang et al. Jan 2013 A1
20130009887 Huang et al. Jan 2013 A1
20130009996 Raveendran et al. Jan 2013 A1
20130013318 Huang et al. Jan 2013 A1
20130033435 Raveendran et al. Feb 2013 A1
20130033496 Raveendran et al. Feb 2013 A1
20130047189 Raveendran et al. Feb 2013 A1
20130128948 Rabii et al. May 2013 A1
20130139210 Huang et al. May 2013 A1
20130174208 Lee et al. Jul 2013 A1
20130188632 Sheth et al. Jul 2013 A1
20130195119 Huang et al. Aug 2013 A1
20130215142 Park Aug 2013 A1
20130222301 Lee et al. Aug 2013 A1
20130227152 Lee et al. Aug 2013 A1
20130234913 Thangadorai et al. Sep 2013 A1
20130238702 Sheth et al. Sep 2013 A1
20130246565 Froelicher et al. Sep 2013 A1
20130246665 Lee et al. Sep 2013 A1
20130272628 Lee Oct 2013 A1
20130297936 Khosravi et al. Nov 2013 A1
20130304794 Verma et al. Nov 2013 A1
20140019653 Amchislavsky et al. Jan 2014 A1
20140022146 Thangadorai et al. Jan 2014 A1
20140096164 Bei et al. Apr 2014 A1
20140120829 Bhamidipati et al. May 2014 A1
20140210693 Bhamidipati et al. Jul 2014 A1
20140372620 Vedula et al. Dec 2014 A1
Foreign Referenced Citations (153)
Number Date Country
1437355 Aug 2003 CN
1561609 Jan 2005 CN
1592884 Mar 2005 CN
1596004 Mar 2005 CN
1656750 Aug 2005 CN
1662944 Aug 2005 CN
1774106 May 2006 CN
1832481 Sep 2006 CN
1893356 Jan 2007 CN
1983945 Jun 2007 CN
101002453 Jul 2007 CN
101018330 Aug 2007 CN
101083825 Dec 2007 CN
101247249 Aug 2008 CN
101247250 Aug 2008 CN
1206080 May 2002 EP
1233326 Aug 2002 EP
1235392 Aug 2002 EP
1325591 Jul 2003 EP
1333373 Aug 2003 EP
1385336 Jan 2004 EP
1423778 Jun 2004 EP
1507369 Feb 2005 EP
1517228 Mar 2005 EP
1550264 Jul 2005 EP
1653678 May 2006 EP
1944946 Jul 2008 EP
1959685 Aug 2008 EP
1959686 Aug 2008 EP
2012461 Jan 2009 EP
2037683 Mar 2009 EP
2190202 May 2010 EP
2383920 Jul 2003 GB
H06110424 Apr 1994 JP
H07104722 Apr 1995 JP
H07129364 May 1995 JP
H07240806 Sep 1995 JP
H08237628 Sep 1996 JP
H09325923 Dec 1997 JP
2000278320 Oct 2000 JP
2000354031 Dec 2000 JP
2001034250 Feb 2001 JP
2001282673 Oct 2001 JP
2001352533 Dec 2001 JP
2002064725 Feb 2002 JP
2002142210 May 2002 JP
2002165248 Jun 2002 JP
2002262341 Sep 2002 JP
2002330381 Nov 2002 JP
2003050761 Feb 2003 JP
2003102060 Apr 2003 JP
2003124991 Apr 2003 JP
2003143237 May 2003 JP
2003271279 Sep 2003 JP
2003304523 Oct 2003 JP
2004054783 Feb 2004 JP
2004505531 Feb 2004 JP
2004086550 Mar 2004 JP
2004120441 Apr 2004 JP
2004192140 Jul 2004 JP
2004199454 Jul 2004 JP
2004265329 Sep 2004 JP
2004274159 Sep 2004 JP
2004531916 Oct 2004 JP
2005049666 Feb 2005 JP
2005515714 May 2005 JP
2005142808 Jun 2005 JP
2005148450 Jun 2005 JP
2005204016 Jul 2005 JP
2006500860 Jan 2006 JP
2006060448 Mar 2006 JP
2006060589 Mar 2006 JP
2006060596 Mar 2006 JP
2006100885 Apr 2006 JP
2006514353 Apr 2006 JP
2006121562 May 2006 JP
2006155327 Jun 2006 JP
2006172423 Jun 2006 JP
2006197401 Jul 2006 JP
2006254328 Sep 2006 JP
2006285302 Oct 2006 JP
2007043685 Feb 2007 JP
2007082070 Mar 2007 JP
2007505580 Mar 2007 JP
2007088539 Apr 2007 JP
2007206644 Aug 2007 JP
2007271908 Oct 2007 JP
2007274150 Oct 2007 JP
2007282219 Oct 2007 JP
2007316405 Dec 2007 JP
2008508600 Mar 2008 JP
2008079139 Apr 2008 JP
2008191929 Aug 2008 JP
2008293361 Dec 2008 JP
2008301249 Dec 2008 JP
2008547264 Dec 2008 JP
2009021698 Jan 2009 JP
2009502067 Jan 2009 JP
2009033348 Feb 2009 JP
2009071580 Apr 2009 JP
2009083896 Apr 2009 JP
2009147893 Jul 2009 JP
2009537051 Oct 2009 JP
2010033548 Feb 2010 JP
2010068537 Mar 2010 JP
2010098344 Apr 2010 JP
2010178147 Aug 2010 JP
2012044746 Mar 2012 JP
2012525773 Oct 2012 JP
2014507862 Mar 2014 JP
100398610 Sep 2003 KR
1020050007533 Jan 2005 KR
20060060717 Jun 2006 KR
2207723 Jun 2003 RU
2005113275 Oct 2005 RU
2269873 Feb 2006 RU
496058 Jul 2002 TW
I234954 Jun 2005 TW
I239179 Sep 2005 TW
200618653 Jun 2006 TW
200838310 Sep 2008 TW
200943168 Oct 2009 TW
WO0184291 Nov 2001 WO
WO02010942 Feb 2002 WO
0223825 Mar 2002 WO
WO0249314 Jun 2002 WO
03030451 Apr 2003 WO
03061240 Jul 2003 WO
03104834 Dec 2003 WO
2004030351 Apr 2004 WO
2004034646 Apr 2004 WO
2004051962 Jun 2004 WO
2005107187 Nov 2005 WO
2005109781 Nov 2005 WO
WO2005122509 Dec 2005 WO
2006007352 Jan 2006 WO
2006020304 Feb 2006 WO
WO2006135289 Dec 2006 WO
2007009876 Jan 2007 WO
WO2007000757 Jan 2007 WO
2007013334 Feb 2007 WO
WO2007021269 Feb 2007 WO
2007033049 Mar 2007 WO
2007098425 Aug 2007 WO
2007133483 Nov 2007 WO
2008027724 Mar 2008 WO
2008087713 Jul 2008 WO
2009040918 Apr 2009 WO
2010120878 Oct 2010 WO
2010126727 Nov 2010 WO
2011002141 Jan 2011 WO
2011003089 Jan 2011 WO
2012096546 Jul 2012 WO
Non-Patent Literature Citations (37)
Entry
McKnight et al. (TPRC 30th Research Conference on Communication, Information and Internet Policy, Aug. 2002) Virtual Markets in Wireless Grids: Peering Policy Obstacles, hereinafter referred as McKnight, pp. 1 and 20.
Myers B.A. et al: “Collaboration using multiple PDAs connected to a PC,” Proceedings of the ACM Conference on Computer Supported Cooperative Work (CSCW), Nov. 14, 1998. XP002351264.
International Search Report, PCT/US2009/067632. International Searching Authority—European Patent Office. Apr. 29, 2010.
Written Opinion of the International Searching Authority, PCT/US2009/067632. International Searching Authority—European Patent Office. Apr. 29, 2010.
Euihyeok Kwon, et al., “An idle timeslot reuse scheme for IEEE 802.15.3 high-rate wireless personal area networks” Vehicular Technology Conference, 2005. VTC-2005-Fall. 2005 IEEE 62nd Dallas, TX, USA Sep. 25-28, 2005, Piscataway, NJ, USA, IEEE, Sep. 25.
Helmy A: “Architectural framework for large-scale multicast in mobile ad hoc networks” Proceedings of IEEE International Conference on Communications—Apr. 28-May 2, 2002—New York, NY, USA, IEEE, Piscataway, NJ, USA LNKDDOI: 10.1109/ICC.2002.997206, vol. 4, Apr. 28, 2002, pp. 2036-2042, XP010589844 ISBN: 978-0-7803-7400-3.
IEEE 802.15.3, “Part 15.3: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for High Rate Wireless Personal Area Networks (WPANs),” IEEE Computer Society, 2003.
Miller B., et al., “Mapping salutation architecture APIs to Bluetooth service discovery layer,” Bluetooth White Paper, [Online} pp. 1-25, Jul. 1, 1999, XP002511956.
Nordbotten, N.A. et al., “Methods for service discovery in Bluetooth scatternets,” Computer Communications, Elsevier Science Publishers BV, Amdsterdam, NL, vol. 27, No. 11, Jul. 1, 2004, pp. 1087-1096, XP004503638.
Zhanping Yin et al: “Third-party handshake protocol for efficient peer discovery in IEEE 802.15.3 WPANs” Broadband Networks, 2005 2nd International Conference on Boston, MA Oct. 3-7, 2005, Piscataway, NJ, USA IEEE, Oct. 3, 2005, pp. 902-911, XP010890303.
Apple, Safari Web Content Guide, Chapter 6, Handling Events, Oct. 12, 2011, retrieved from http://developer.apple.com/library/safari/#documentation/AppleApplications/Reference/SafariWebContent/HandlingEvents/HandlingEvents.html.
Basso et al., “RTP Payload Format for MPEG-4 Streams; draft-ietf-avt-mpeg4-multisi-03.txt”, vol. avt, No. 3, Nov. 1, 2001, XP015015620, ISSN: 0000-0004.
Brandenburg, et al., AVTCore, RTCP for inter-destination media syncronization, Internet Draft, draft-ietf-avtcore-idms-092.txt, Oct. 31, 2011.
Doerffel T., “User manual iTALC—Intelligent Teaching and Learning with Computers Version 1.0.4”, Jan. 29, 2008, pp. 1-17, XP55025785, Retrieved from the Internet: URL:http://italc.sourceforge.net/italc-manual-2007-01-29.pdf [retrieved on Apr. 26, 2012] the whole document.
Media Content Distribution (MCD); 3D 1-30 Gaming Graphics Delivery Overview, Technical Report, European Telecommunications Standards Institute (ETSI), 650, Route Des Lucioles; F-06921 Sophia-Antipolis; France, vol. MCD, No. V1. 1. 1, Dec. 1, 2010, XP014061814, section 5.
Mihai Mitrea et al: “Novel approaches to 1-30 remote display representations: BiFS-based solution and its deployment within the FP7 MobiThin project”, 87. MPEG Meeting; Feb. 2, 2009-Jun. 2, 2009; Lausanne; (Motion Picture Expert Group or ISO/IEC JTC1/SC29/WG11), No. M16058, Jan. 29, 2009, XP030044655, sections 2 and 3.
MSDN DirectShow, retrieved Nov. 28, 2011 from: http://msdn.microsoft.com/en-us/library/dd375454(VS.85).aspx.
MSDN Windows Sockets 2, retrieved Nov. 28, 2011 from: http://msdn.microsoft.com/en-us/library/ms740673(VS.85).aspx.
Nave I et al., “Games@large graphics streaming architecture”, Consumer Electronics, 2008. ISCE 2008. IEEE International Symposium on, IEEE, Piscataway, NJ, USA, Apr. 14, 2008, pp. 1-4, XP031283619, ISBN: 978-1-4244-2422-1 abstract col. 2-col. 6.
Schulzrinne, et al., “RTP: A Transport Protocol for Real-Time Applications”, rfc3550.txt, Jul. 1, 2003, XP015009332, ISSN: 0000-0003.
Shoji Y., et al., “Research and Standardization activty for IEEE802.15.3c mmW WPAN: (2) Target applications and Usage Models”, IEICE Tech. Rep., vol. 106, No. 555, RCS2006-279, pp. 179-182, Feb. 2007.
Wenger et al., “RTP Payload Format for H.264 Video,” Network Working Group, RFC 3984, Feb. 2005, 78 pp.
Co-pending U.S. Appl. No. 10/236,657, filed Sep. 6, 2002.
Video Electronics Standards Association (VESA) “Mobile Display Digital Interface Standard (MDDI),” Jul. 2004.
“Bluetooth Specification Version 1.1” published Feb. 22, 2001; Section 1 pp. 41-42; Section 2.1, p. 43; Section 4.1-2, pp. 47-50; Section 10.9, p. 120; and Section 11, pp. 126-137.
Byungjoo Lee, U.S. Appl. No. 61/433,942, filed Jan. 18, 2011.
Casner, S., et al., “Compressing IP/UDP/RTP Headers for Low-Speed Serial Links,” IETF Network Working Group, RFC 2508 (Feb. 1999).
Gentric., et al., “RTP Payload Format for MPEG-4 Streams”, Internet Engineering Task Force, draft-ietf-avt-mpeg4-multisl-03.txt, Nov. 2001, pp. 13,14,25 and 33.
Handley, M. et al., “SDP: Session Description Protocol” Network Working Group, Request for Comments: 2327, Category: Standards Track. ISI/LBNL, Apr. 1998, pp. 1-42.
DDJ., “Research on Windows Programming with Visual C++, Final Issue, Overcoming WIN32 Hook Processing in MFC Programming”, Feb. 1996 issue (vol. 5, No. 2, No. 61 in all), Shoeisha Co., Ltd., Feb. 1, 1996, pp. 66-77.
International Preliminary Report on Patentability—PCT/US2013/020155, The International Bureau of WIPO—Geneva, Switzerland, Jul. 17, 2014.
Wikipedia entry for UPnP List of UPnP AV media servers and clients (captured Aug. 20, 2010), pp. 1-10, Retrieved from the Internet < URL: web.archive.org/web/20100820133238/http://en.wikipedia.org/wiki/List—of—UPnP—AV—media—servers—and—clients >, whole document.
Wikipedia entry of header (captured Aug. 30, 2010), 1 Page, Retrieved from the Internet < URL: web.archive.org/web/20100830154156/http://en.wikipedia.org/wiki/Header—(computing) >, whole document.
“Raster Graphics” Wikipedia. Wikimedia Foundation, Jan. 29, 2011, Web, Apr. 1, 2015.
Hayakawa A., “Operate multiple machines by remote control software”, VNCThing, MAC POWER, Japan, ASCII Corporation, Jun. 1, 2003, vol. 14, No. 6, p. 86.
Kinoshita K., “The Software” Everyone knows, Read this and everything will be clear, Standard software with freedom., Mac Fan, Japan, Mainichi Communications Inc., Sep. 1, 2007, vol. 15, No. 9, pp. 212-219.
Ryo Yamaich I, Good to Remember! “Wisdom” for Troubleshooting, 68th Windows Q & A Hotline, Windows Server World, Japan, IDG Japan, Inc., Oct. 1, 2009, vol. 14, No. 10, pp. 104-107.
Related Publications (1)
Number Date Country
20100153553 A1 Jun 2010 US