GB2584159A - Video delivery method, device and system - Google Patents

Video delivery method, device and system Download PDF

Info

Publication number
GB2584159A
GB2584159A GB1907406.1A GB201907406A GB2584159A GB 2584159 A GB2584159 A GB 2584159A GB 201907406 A GB201907406 A GB 201907406A GB 2584159 A GB2584159 A GB 2584159A
Authority
GB
United Kingdom
Prior art keywords
sender
receivers
data
transfer confirmation
register
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
GB1907406.1A
Other versions
GB201907406D0 (en
Inventor
Psarras Ioannis
Rene Sergi
Krol Michal
Kutscher Dirk
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Datahop Labs Ltd
Original Assignee
Datahop Labs Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Datahop Labs Ltd filed Critical Datahop Labs Ltd
Priority to GB1907406.1A priority Critical patent/GB2584159A/en
Publication of GB201907406D0 publication Critical patent/GB201907406D0/en
Publication of GB2584159A publication Critical patent/GB2584159A/en
Withdrawn legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • H04L67/1074Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
    • H04L67/1078Resource delivery mechanisms
    • H04L67/1082Resource delivery mechanisms involving incentive schemes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1095Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/60Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/61Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

A method for device-to-device (D2D) data transfer between a plurality of connected devices, each of which can operate as a sender and receiver, comprises sending 210 by at least two receivers 20 a data request to a sender 10, identifying 220 priority levels of the receivers, and sending 230 the requested data to the user with the highest priority level. When the data is received, the receiver generates a transfer confirmation and sends it 240 to the sender, and the priority level of a device is based on the number of received transfer confirmations. Hence devices are incentivised to participate in the system, as the device is rewarded with higher priority based on greater participation. The transfer confirmation may be registered 250 by the sender at a decentralised register 30, which may be based on blockchain technology, and establishing priority levels may involve requesting information from the register. The method may be used for video delivery and for ad hoc data synchronisation between distributed devices.

Description

Video Delivery Method, Device and System
Field of the Invention
The present invention relates generally to transmission of high volume data, for example, transmission and delivery of video files or streams, to mobile devices and more particularly to distributing content from device to device while enhancing security. The invention relates in particular to the distributed data synchronisation between collocated mobile devices in an ad hoc manner.
Background of the Invention
The following discussion of the prior art is intended to facilitate an understanding of the invention and to enable the advantages of it to be more fully understood. It should be appreciated, however, that any reference to prior art throughout the specification should not be construed as an express or implied admission that such prior art is widely known or forms part of common general knowledge in the field.
A content delivery/distribution network, CDN, is a geographically distributed network of servers and data storages. It is used to distribute service to end-users to provide high availability and high performance. CDNs serve a large portion of the Internet content today, including web pages, media files, software, documents, applications, live streaming media, on-demand streaming media, and social networks.
Ubiquitous, user-operated and distributed CDNs have been proposed recently and have been given the acronym ubiCDN. It is also noted that ubiCDN may be referred to as DataHop, and these terms may be used interchangeably throughout.
Currently, video delivery (or delivery of high-volume data more generally) to mobile devices is facing dramatic challenges. Users are reluctant to watch video when connected to the cell network, as they are limited by their mobile data plan.
Consequently, there is a need to adjust the transmission infrastructure. The previous broadcast model needs to be transformed to an "always-on-demand" communication model.
Current research, i.e. in the field of Opportunistic Networking, has not been able to provide solutions in this regard, because the technology to support device-to-device, D2D, communication is not mature enough. Furthermore, there is no sound, secure, and widely acceptable incentive model, which incentivises users to participate in a D2D communication model.
The increased demand for mobile data and the corresponding relatively high skewness in the popularity of the requested content has led to an increased interest in the area of data offloading through opportunistic communication with or without the assistance of the cellular infrastructure. It is known that a cellular assisted mechanism can serve user requests from other mobile users located geographically close, by clustering crowded places in data spots and by tracking the location of users, as well as the content cached in their devices. An alternative approach is the usage of vehicles as mobile caches, as a cheap and more versatile approach to small cells. User interests are delayed in a controlled fashion so that a passing by vehicle may fulfil their interests, otherwise their interests are served by the cellular network in an attempt to minimize infrastructure load and guarantee maximum delays.
With the known concepts, such as a traditional centralised or even distributed database, it is impossible to keep track of the transfers that take place between mobile devices, in a device-to-device, D2D, manner. Accounting, billing and transfer of rewards to users that contribute to content distribution needs to take place in a completely decentralised manner with no trust between the individual participating parties, e.g. content providers and individual users.
Current systems also suggest arbitrary connections, which means that users moving in their daily routine meet other nodes with which they can connect with and exchange content. Given that in urban environments there are normally more than two devices in the vicinity at any given time, the decision about which device to connect to first, i.e. which devices will get connection priority, is commonly done arbitrarily and based on random device decisions. This effectively dis-incentivises users from participating as it provides no reward in case of more contribution to the network of mobile devices.
Some solutions have also been proposed to share information between mobile devices by passing the Internet infrastructure or the coordination through the cellular network. Finally, content sharing between users in crowded live events is known by realising a key-value store abstraction for applications, providing single-hop content discovery and sharing with the participation of local access points.
US patents 9,374,280 and 9,300,724 describe device-to-device content delivery that incentivises users by lowering costs. In US20120290650A1, a peer to peer communication mechanism for device to device communication is described. In US20140140296A1, a priority-based mechanism is used to decide which mobile nodes get to use the shared wireless medium. If two nodes want to send data, the one with the higher priority to use a wireless peer-to-peer medium gets the right to use it first. The nodes also monitor the interference level and if it is below a certain threshold, nodes with lower priority could choose to use the transmission channel.
In summary, it has been impossible to implement a secure and decentralised incentive scheme for mobile devices. It is impossible to track and reward users for their contribution to the mobile content distribution network without being prone to security attacks and malicious users that attempt to cheat the system in order to increase their reward.
D2D content transfer has also been studied before, but none of the existing prior art is a full solution to this problem, as none of these technologies enables transparent, i.e., without the users' intervention, connectivity and content transfer to users and devices that have not previously been connected. More importantly, users attempting to connect to other users/devices have no way to identify who to connect to in order to increase the efficiency of their connection. Acting rationally, users want to increase their revenue when contributing to the system. Finally, it has been impossible to identify the content in a remote device and connect directly to transfer the content itself, rather than merely connect to some device.
It is an objective of the present invention to overcome or substantially ameliorate one or more of the deficiencies of the prior art, or at least to provide a useful alternative.
Summary of the Invention
Accordingly, the invention provides a method and system for large-file, e.g., video file, delivery and distributed data synchronisation as defined in the independent claims. Further advantageous embodiments are set out in the dependent claims.
In a first embodiment, there is provided a computer-implemented method for device-todevice data transfer between a plurality of connected devices, each of which can operate as sender and receiver, the method comprising the steps of sending by at least two of a plurality of receivers a request for data to a sender, wherein each of the plurality of receivers is sending one request at a time; receiving the data requests by the sender; identifying priority levels of the receivers; selecting the receiver for which the highest priority level has been identified; sending the requested data to the selected receiver; receiving the data from the sender by the selected receiver; characterized by further comprising: generating a transfer confirmation by the selected receiver; sending the transfer confirmation by the selected receiver to the sender; and receiving the transfer confirmation by the sender; wherein the priority levels are based on the number of received transfer confirmations.
That is, the present invention provides a method for prioritising data synchronisation between a sender/user according to his participation in the system, as well as according to the specific addressable and self-identifiable that they possess. The method is robust against security attacks. The more a user participates in the system, the higher his mobile device's value becomes in the distribution system. Therefore, he gets priority to both receive and distribute content.
This provides the advantage that devices are given a connection priority in a systematic manner whilst being robust to security attacks. It also provides the performance advantage, according to which devices connect only when there is content of interest to synchronise with and not randomly to any other device. This mitigates the problems known with random, or arbitrary, prioritisation as discussed above and also brings savings in terms of energy consumption. Thus, users are incentivised to participate as a reward is provided as they engage with the network of devices, whilst remaining protected against security attacks.
Optionally, the method may also include the step of selecting the sender or receiver based directly on the self-identifiable content stored in their memory. Optionally, this step may take place between the steps of: selecting the receiver for which the highest priority level has been identified; and sending the requested data to the selected receiver.
Optionally, the step of sending the transfer confirmation by the selected receiver to the sender may also include sending the transfer confirmation by the selected receiver to a distributed ledger or blockchain. That is, the method may include the step of sending the transfer confirmation by the selected receiver to the sender and a distributed ledger or blockchain.
S
Optionally, where the method includes the step of sending the transfer confirmation by the selected receiver to the sender and a distributed ledger or blockchain, the priority levels may be based on the number of received transfer confirmations, as recorded on the distributed ledger or blockchain.
Optionally, the method may also comprise the step of identifying missing content in any or each of the plurality of receivers. Optionally, the step of identifying missing content in any or each of the plurality of receivers may take place between the steps of: identifying priority levels of the receivers; and selecting the receiver for which the highest priority level has been identified.
Optionally, the method may also comprise the step of selecting the receiver for which not all stored data is synchronised with the latest version of the data collection in the distributed storage system. Optionally, the step of selecting the receiver for which not all stored data is synchronised with the latest version of the data collection in the distributed storage system may take place between the steps of: selecting the receiver for which the highest priority level has been identified; and sending the requested data to the selected receiver.
Optionally, the method may further comprise the step of identifying which of the receivers are missing parts of the content collection and need to synchronise (i.e. require synchronisation).
Optionally, the method may further comprise the step of: registering the received transfer confirmation by the sender at a register; wherein, the register is storing the registered transfer confirmation in association with a unique identifier of the sender; and wherein, identifying priority levels of the receivers comprises requesting the information that is stored in association with the unique identifiers of the receivers from the register.
Optionally, the data requests of the receivers may be requests for the same or for different data.
Optionally, the devices may be connected by a wired connection or by a wireless connection.
Optionally, the step of generating the transfer confirmation by the selected receiver may comprise signing the transfer confirmation with a private key of the selected receiver.
Optionally, the register may be a decentralised data storage, preferably based on blockchain technology.
In accordance with another embodiment, there is provided a system for device-to-device data transfer between a plurality of connected devices, the devices comprising a sender and a plurality of receivers, wherein each of the devices can operate as sender and receiver, wherein: the sender is configured to receive at least two data requests from at least two of the receivers; to identify priority levels of the receivers from which the sender received data requests; to select the receiver with the highest priority level; to send the requested data to the selected receiver; and to receive a transfer confirmation from the selected receiver; wherein the priority levels of the receivers are based on the number of received transfer confirmations; and the receivers are configured to send the request for data to the sender; to receive the data from the sender; to generate the transfer confirmation; and to send the transfer confirmation to the sender.
That is, the present invention provides a system for prioritising a user according to his participation in the system. The system is robust against security attacks. The more a user participates in the system, the higher his mobile device's value becomes in the distribution system. Therefore, he gets priority to both receive and distribute content.
This provides the advantage that devices are given a connection priority in a systematic manner whilst being robust to security attacks. This mitigates the problems known with random, or arbitrary, prioritisation as discussed above. Thus, users are incentivised to participate as a reward is provided as they engage with the network of devices, whilst remaining protected against security attacks.
Optionally, the system may further be configured to select the receiver based directly on the self-identifiable content stored in their memory.
Optionally, the system may further be configured to identify which of the receivers are missing parts of the content collection and need to synchronise (i.e. require synchronisation).
Optionally, the system may further comprise a register, and the sender may further be configured to register the received transfer confirmation at the register; and wherein, the register may be configured to store the registered transfer confirmation in association with a unique identifier of the sender and/or a unique identifier of the transferred content; and wherein, the priority levels of the receivers may be based on the information stored in association with the unique identifier of the receivers at the register.
Optionally, the data requests of the receivers may be requests for the same or for different data.
Optionally, the devices may be connected by a wired connection or by a wireless connection.
Optionally, the receivers may further be configured to sign the transfer confirmation with a private key after or while generation of the transfer confirmation.
Optionally, the register may be a decentralised data storage, preferably based on blockchain technology.
In accordance with another embodiment, there is provided a computer program product including a program for a processing device, comprising software code portions for performing the steps of the method described herein when the program is run on the processing device.
Preferably, the computer program product may include a computer-readable medium on which the software code portions are stored, wherein the program may be directly loadable into an internal memory of the processing device.
By using the technology this invention as described herein, the problem of incentivizing users to participate in the system as much as possible is solved, but at the same time, it avoids sybil and fake identity attacks to the system. For example, blockchain technology could be used for instance, as such technology makes tracking, billing and accounting possible.
The present invention solves the problem of users wanting to increase their value, and thereby enhance their own device's technical capabilities of transfer, when contributing to the system, by allowing to connect to the user that will give the most return for the contribution to the system, i.e. file/content transfer.
Brief Description of the Drawings
Preferred embodiments of the invention will now be described, by way of example only, with reference to the accompanying drawings in which: Figure 1 is an exemplary system for device-to-device data transfer. Figure 2 is a flowchart of a method for device-to-device data transfer.
Figure 3 is a data flow diagram for a method and system of device-to-device data transfer.
Detailed Description
The present invention provides a mobile file distribution and data synchronisation infrastructure between mobile, collocated devices, which is based on user-devices. Content providers (which can range from national broadcasters to individual users) proactively push content to selected mobile users, which are also called sources. Content then hops from device to device, D2D, and spreads in the network to destination nodes that have the distribution infrastructure application installed.
Sources and destinations synchronize through the data-centric connectivity software solution. With this approach it is ensured that content spreads independently of the cellular connection. Therefore, challenged connectivity and data limits are not a barrier to the distribution of large volumes of data and content can still be synchronised between devices even when the devices are "offline".
Source and destination nodes effectively share unused memory in their mobile devices to build a file distribution network, which does not depend on the network infrastructure. The devices are not passive end-user data consumers but become active network nodes.
In the current/traditional client-server model, content is pulled from the CDN server upon the user's request. Instead, ubiCDN attempts to prefetch, distribute and make content available to users by default, without an active update request. While normal prefetching could waste a considerable amount of bandwidth resources, ubiCDN utilises local D2D connectivity to complete content transfers. Such connections are established via Bluetooth, Bluetooth Low Energy, WiFi Direct or other wireless internet connections, which are usually not metered. Therefore, no network bandwidth resources are consumed, and the impact on the device's energy consumption is negligible, as the cellular connection uses also more energy than the wireless connections for the close vicinity. ubiCDN consists of following type of nodes: Source nodes, which receive updates directly from the content/application providers in a push mode. Their job is to disseminate the content further to users that have the same application installed on their device or are subscribed to receive the same data. Examples could be video-channels, music-channels, news-channels, RSS-feeds, local social networks where users share content of interest to other participants (e.g., in festivals or sports events), or a tool to share meeting material (e.g., in conferences or lecture theatres) etc. Destination nodes, which are passive nodes that have a number of applications installed on their device or are subscribed to aforementioned channel type information and expect to receive updates on those. Local D2D data transfers take place when a source node meets a destination node whose application or channel has outdated content.
Relay nodes are destination nodes that temporarily become or act like source nodes once they get updated. This mode of operation reduces the number of source nodes needed and accelerates significantly the distribution of content in the mobile, D2D domain.
As the ubiCDN becomes more efficient if more users participate as source and relay nodes, users need to be encouraged to participate. If a user who contributes more to the network by acting as a source or relay node can become a preferred destination node who receives updates earlier than a user who contributes less, an incentive is given.
Thus, by contributing to the network, the priority of the user rises, and he will be preferred over users with lower priority. As the underlying system to evaluate priority, a blockchain system is employed. The system is employed similar to a bitcoin system, which refers to money transactions from digital wallets. In ubiCDN, users exchange transfer confirmation data similar to bitcoin, but the information does not refer to interchangeable currency, but is merely an indication of active participation and contribution to the system in terms of data exchange and relay. If more transfer confirmations are associated with a user, his priority level is higher. In reference to the bitcoin model, where a user would accumulate wealth, the priority level accumulated with the ubiCDN network could be referred to as Prestige, which is a form of "social capital".
With the virtual currency model, a user receives entities of the virtual currency, so-called coins, for performing useful work. In the ubiCDN network, users receive transfer confirmations for sending or relaying data. Similar to the bitcoin model, it is not desirable that a user creates, or duplicates, transfer confirmations and increases his priority level without having performed the action to be awarded the transfer confirmation.
With the presently known virtual currencies, so-called Proof-of-X Consensus concepts are known, which determine the conditions for a participant to be awarded a reward. Following concepts are known: Proof of Work: Reward is determined by resources, i.e. CPU time, used to perform the task. Proof of Stake: With this concept, while a user having more transfer confirmations will be assigned a high priority value the flow of transfer confirmation will be impeded, if it's circular. Proof of Space-Time: Users are required to generate proofs of storing files over time. The reward is therefore not associated with transfers.
The object is to award nodes for transferring files, which is difficult to prove in a decentralised network when the file has been transferred between two nodes that have no means of establishing trust with each other.
Also, in order to avoid fake transfers, the confirmations of a transfer by two nodes cannot be trusted alone. The confirmation method is susceptible to certain attacks, like a sybil attack, a collude attack or a generation attack.
A sybil attack is when a malicious user generates multiple (fake) identities under his control and pretends to send files between them. He eventually would get the reward for all fake transfers. A collude attack is when two malicious users, but with valid identities or accounts can submit a (fake) file transfer between them to gain more reward in the network. A generation attack is when a user generates random files and distributes them between colluding devices to increase their reward.
The invention will now be described with reference to the Figures.
With reference to Figure 1, there is provided a system for device-to-device data transfer between a plurality of connected devices, the devices comprising a sender (10) and a plurality of receivers (20), wherein each of the devices can operate as sender and receiver. Furthermore, the sender (10) is configured to: receive at least two data requests from at least two of the receivers (20); to identify priority levels of the receivers (20) from which the sender (10) received data requests; to select the receiver (20) with the highest priority level; to send the requested data to the selected receiver (20); and to receive a transfer confirmation from the selected receiver (20). The priority levels of the receivers (20) are based on the number of received transfer confirmations.
Moreover, the receivers (20) are configured to send the request for data to the sender (10); to receive the data from the sender (10); to generate the transfer confirmation; and to send the transfer confirmation to the sender (10).
The system may also include a register (30), and the sender (10) is also further configured to register the received transfer confirmation at the register (30). The register (30) is configured to store the registered transfer confirmation in association with a unique identifier of the sender (10). The priority levels of the receivers (20) are also based on the information stored in association with the unique identifier of the receivers (20) at the register (30).
The data requests of the receivers can be requests for the same or for different data.
As described in relation to Figures 2 and 3, the devices can be connected by any appropriate means, for example, by a wired connection or by a wireless connection.
The receivers (20) are also configured to sign the transfer confirmation with a private key after or while generation of the transfer confirmation.
The register (30) of the system is a decentralised data storage which, in the described example, may be based on blockchain technology.
Referring now to Figures 2 to 3, with further reference to the system of Figure 1, a computer-implemented method (100, 200) is described for device-to-device data transfer between a plurality of connected devices, each of which can operate as sender and receiver. That is, each of the plurality of connected devices may act as both a sender and a receiver.
The method generally includes the steps of sending (110, 210), by at least two of a plurality of receivers (20), a request for data to a sender (10), wherein each of the plurality of receivers (20) is sending one request at a time; receiving (120, 210) the data requests by the sender (10); identifying (130, 220) priority levels of the receivers (20); selecting (140) the receiver (20) for which the highest priority level has been identified; sending (150, 230) the requested data to the selected receiver (20); receiving (160, 230) the data from the sender (10) by the selected receiver (20). The method also includes the steps of generating (170) a transfer confirmation by the selected receiver (20); sending (180, 240) the transfer confirmation by the selected receiver (20) to the sender (10); and receiving (190, 240) the transfer confirmation by the sender (10); wherein the priority levels are based on the number of received transfer confirmations.
The method may also include the steps of registering (195, 250) the received transfer confirmation by the sender (10) at a register (30) (refer to Figure 1). The register (30) is storing the registered transfer confirmation in association with a unique identifier of the sender (10). The method may include, as part of identifying (130, 220) priority levels of the receivers (20), the step of requesting the information that is stored in association with the unique identifiers of the receivers (20) from the register (30). The data requests of the receivers may be requests for the same or for different data. The devices may be connected by any appropriate means, such as by a wired connection or by a wireless connection.
The step of generating (170) the transfer confirmation by the selected receiver (20) may include signing the transfer confirmation with a private key of the selected receiver (20).
Referring most particularly to Figure 1, the register (30) is a decentralised data storage, which, in the described example, may be based on blockchain technology.
There may also be provided a computer program product including a program for a processing device, comprising software code portions for performing the steps of the described computer-implemented method, when the program is run on the processing device.
The computer program product may also include a computer-readable medium on which the software code portions are stored, wherein the program is directly loadable into an internal memory of the processing device.
This invention is integrating the choice of which device to connect to in the D2D connectivity solution, by means of credit or value. It solves the problem of arbitrary connections between devices which is not based on any prior history of the device and is therefore not providing incentives for users to participate.
The presented invention creates verifiability (proof of transfer) in distributed device-to-device communication systems in a completely decentralized way, without needing any external central servers.
Unless specifically stated otherwise, as apparent from the following discussions, it is appreciated that throughout the specification discussions utilizing terms such as "processing," "computing," "calculating," "determining", analysing" or the like, refer to the action and / or processes of a computer or computing system, or similar electronic computing component, that manipulate and / or transform data represented as physical, such as electronic, quantities into other data similarly represented as physical quantities.
It will be understood that the steps of methods discussed are performed in one embodiment by an appropriate processor (or processors) of a processing (i.e., computer) system executing instructions (computer-readable code) stored in storage. It will also be understood that the invention is not limited to any particular implementation or programming technique and that the invention may be implemented using any appropriate techniques for implementing the functionality described herein. The invention is not limited to any particular programming language or operating system.
Reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment but may. Furthermore, the particular features, structures or characteristics may be combined in any suitable manner, as would be apparent to one of ordinary skill in the art from this disclosure, in one or more embodiments.
Furthermore, while some embodiments described herein include some, but not other features included in other embodiments, combinations of features of different embodiments are meant to be within the scope of the invention, and form different embodiments, as would be understood by those skilled in the art. For example, in the following claims, any of the claimed embodiments can be used in any combination.

Claims (19)

  1. CLAIMS1. A computer-implemented method for device-to-device data transfer between a plurality of connected devices, each of which can operate as sender and receiver, the method comprising the steps of: sending (110, 210) by at least two of a plurality of receivers (20) a request for data to a sender (10), wherein each of the plurality of receivers (20) is sending one request at a time; receiving (120, 210) the data requests by the sender (10); identifying (130, 220) priority levels of the receivers (20); selecting (140) the receiver (20) for which the highest priority level has been identified; sending (150, 230) the requested data to the selected receiver (20); receiving (160, 230) the data from the sender (10) by the selected receiver (20); characterized by further comprising: generating (170) a transfer confirmation by the selected receiver (20); sending (180, 240) the transfer confirmation by the selected receiver (20) to the sender (10); and receiving (190, 240) the transfer confirmation by the sender (10); wherein the priority levels are based on the number of received transfer confirmations.
  2. 2. A method according to claim 1, further comprising the step of: selecting the sender or receiver based directly on the self-identifiable content stored in their memory.
  3. 3. A method according to claim 1 or 2, further comprising the step of: identifying missing content in any or each of the plurality of receivers.
  4. 4. A method according to any one of the previous claims, further comprising the step of: selecting the receiver for which not all stored data is synchronised with the latest version of the data collection in the distributed storage system.
  5. 5. A method according to any one of the previous claims, further comprising the step of: identifying which of the receivers are missing parts of the content collection and require synchronisation.
  6. 6. A method according to any one of the previous claims, further comprising the step of: registering (195, 250) the received transfer confirmation by the sender (10) at a register (30); wherein, the register (30) is storing the registered transfer confirmation in association with a unique identifier of the sender (10); and wherein, identifying (130, 220) priority levels of the receivers (20) comprises requesting the information that is stored in association with the unique identifiers of the receivers (20) from the register (30).
  7. 7. A method according to any one of the previous claims, wherein the data requests of the receivers can be requests for the same or for different data.
  8. 8. A method according to any one of the previous claims, wherein the devices can be connected by a wired connection or by a wireless connection.
  9. 9. A method according to any one of the previous claims, wherein generating (170) the transfer confirmation by the selected receiver (20) can comprise signing the transfer confirmation with a private key of the selected receiver (20).
  10. 10. A method according to any one of the previous claims, wherein the register (30) is a decentralised data storage, preferably based on blockchain technology.
  11. 11. A system for device-to-device data transfer between a plurality of connected devices, the devices comprising a sender (10) and a plurality of receivers (20), wherein each of the devices can operate as sender and receiver, wherein: the sender (10) is configured to receive at least two data requests from at least two of the receivers (20); to identify priority levels of the receivers (20) from which the sender (10) received data requests; to select the receiver (20) with the highest priority level; to send the requested data to the selected receiver (20); and to receive a transfer confirmation from the selected receiver (20); wherein the priority levels of the receivers (20) are based on the number of received transfer confirmations; and the receivers (20) are configured to send the request for data to the sender (10); to receive the data from the sender (10); to generate the transfer confirmation; and to send the transfer confirmation to the sender (10).
  12. 12. A system according to claim 11, wherein the sender (10) is further configured to identify which of the receivers are missing parts of the content collection and require synchronisation.
  13. 13. A system according to claim 11 or 12, further comprising a register (30), and wherein the sender (10) is further configured to register the received transfer confirmation at the register (30); and wherein, the register (30) is configured to store the registered transfer confirmation in association with a unique identifier of the sender (10) and/or a unique identifier of the transferred content; and wherein, the priority levels of the receivers (20) are based on the information stored in association with the unique identifier of the receivers (20) at the register (30).
  14. 14. A system according to any one of claims 11 to 13, wherein the data requests of the receivers can be requests for the same or for different data.
  15. 15. A system according to any one of claims 11 to 14, wherein the devices can be connected by a wired connection or by a wireless connection.
  16. 16. A system according to any one of claims 11 to 15, wherein the receivers (20) are further configured to sign the transfer confirmation with a private key after or while generation of the transfer confirmation.
  17. 17. A system according to any one of claims 11 to 16, wherein the register (30) is a decentralised data storage, preferably based on blockchain technology.
  18. 18. A computer program product including a program for a processing device, comprising software code portions for performing the steps of any one of claims 1 to 10 when the program is run on the processing device.
  19. 19. The computer program product according to claim 18, wherein the computer program product comprises a computer-readable medium on which the software code portions are stored, wherein the program is directly loadable into an internal memory of the processing device.
GB1907406.1A 2019-05-24 2019-05-24 Video delivery method, device and system Withdrawn GB2584159A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
GB1907406.1A GB2584159A (en) 2019-05-24 2019-05-24 Video delivery method, device and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GB1907406.1A GB2584159A (en) 2019-05-24 2019-05-24 Video delivery method, device and system

Publications (2)

Publication Number Publication Date
GB201907406D0 GB201907406D0 (en) 2019-07-10
GB2584159A true GB2584159A (en) 2020-11-25

Family

ID=67385468

Family Applications (1)

Application Number Title Priority Date Filing Date
GB1907406.1A Withdrawn GB2584159A (en) 2019-05-24 2019-05-24 Video delivery method, device and system

Country Status (1)

Country Link
GB (1) GB2584159A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020198929A1 (en) * 2001-06-25 2002-12-26 International Business Machines Corporation Method and apparatus to encourage client into a distributed peer to peer sharing technology
US20050273511A1 (en) * 2004-06-08 2005-12-08 Hewlett-Packard Development Company, L.P. Equitable resource sharing in grid-based computing environments
WO2009125760A1 (en) * 2008-04-09 2009-10-15 日本電気株式会社 Content distribution system and content distribution method used for the same
EP2136534A1 (en) * 2008-06-17 2009-12-23 THOMSON Licensing System, sharing node, server, and method for content distribution
GB2540434A (en) * 2015-07-17 2017-01-18 Fujitsu Ltd Content delivery over D2D links

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020198929A1 (en) * 2001-06-25 2002-12-26 International Business Machines Corporation Method and apparatus to encourage client into a distributed peer to peer sharing technology
US20050273511A1 (en) * 2004-06-08 2005-12-08 Hewlett-Packard Development Company, L.P. Equitable resource sharing in grid-based computing environments
WO2009125760A1 (en) * 2008-04-09 2009-10-15 日本電気株式会社 Content distribution system and content distribution method used for the same
EP2136534A1 (en) * 2008-06-17 2009-12-23 THOMSON Licensing System, sharing node, server, and method for content distribution
GB2540434A (en) * 2015-07-17 2017-01-18 Fujitsu Ltd Content delivery over D2D links

Also Published As

Publication number Publication date
GB201907406D0 (en) 2019-07-10

Similar Documents

Publication Publication Date Title
US10771524B1 (en) Methods and systems for a decentralized data streaming and delivery network
Saxena et al. Named data networking: a survey
US20210035098A1 (en) Methods and systems for micropayment support to blockchain incentivized, decentralized data streaming and delivery
Nandi et al. Scrivener: Providing incentives in cooperative content distribution systems
Rajahalme et al. On name-based inter-domain routing
Hamdaoui et al. IoTShare: A blockchain-enabled IoT resource sharing on-demand protocol for smart city situation-awareness applications
US20220046072A1 (en) Tracker server in decentralized data streaming and delivery network
US20200082405A1 (en) Method and system for client support in a blockchain network
CN103931160A (en) Verification of content possession by an announcing peer in a peer-to-peer content distribution system
Alouache et al. Credit based incentive approach for V2V cooperation in vehicular cloud computing
Kazemzadeh et al. Publiy+: A peer-assisted publish/subscribe service for timely dissemination of bulk content
Wang et al. Peer-assisted social media streaming with social reciprocity
GB2584159A (en) Video delivery method, device and system
Lareida et al. Augmenting home routers for socially-aware traffic management
Sun et al. A proactive on-demand content placement strategy in edge intelligent gateways
Raman et al. Consume local: Towards carbon free content delivery
Gupta et al. Service differentiation in peer-to-peer networks utilizing reputations
Xu et al. A multilevel reputation system for peer-to-peer networks
Wang et al. Incentive based cooperative content caching in Social Wireless Networks
Stocker et al. Content may be king, but (peering) location matters: A progress report on the evolution of content delivery in the internet
Chow Running on karma–P2P reputation and currency systems
Zhao et al. Edge-node assisted live video streaming: A coalition formation game approach
Malandrino et al. Discovery and provision of content in vehicular networks
CN113630456B (en) Inter-domain cooperation caching method based on Lagrange dual decomposition and Nash bargaining game
Manzato et al. Incentive mechanism for the CoopNet network

Legal Events

Date Code Title Description
WAP Application withdrawn, taken to be withdrawn or refused ** after publication under section 16(1)