EP4222453A1

EP4222453A1 - Apparatus and methods for controlling the arrival of consumers and/or parcels

Info

Publication number: EP4222453A1
Application number: EP20790040.8A
Authority: EP
Inventors: Wael ELATTAR
Original assignee: Kepler Gate Ltd
Current assignee: Kepler Gate Ltd
Priority date: 2020-10-02
Filing date: 2020-10-02
Publication date: 2023-08-09
Also published as: WO2022069847A1

Abstract

A computer-implemented method for controlling the flow of packets at a receiving node in a communication network of nodes, the method comprising the steps of: receiving, from the receiving node, processing information comprising information relating to the processing rate of packets at the receiving node; determining, at a delivery node, a travel time for a packet sent to the receiving node; determining, at the delivery node, a manner and time for sending the packet to the receiving node such that the packet is processed upon arrival at the receiving node.

Description

APPARATUS AND METHODS FOR CONTROLLING THE ARRIVAL OF CONSUMERS AND/OR PARCELS

The present disclosure relates to apparatus and methods for controlling the arrival of packets at a node such that the rate of processing of packets at said node is optimised.

Background

For most apparatus for receiving and processing packets, it is important to openly and freely receive packets for processing. Imparting restrictions on receipt of packets creates negative implications for capacity elsewhere and for the future demand of the receiving apparatus.

However, such freely operating systems and their management are often blighted with the inherent fluctuations of incoming packets. Like many freely operating systems, there are peaks and troughs in demand which create a necessary compromise of the capacity of the receiving apparatus.

On one hand timely processing of packets is preferred and therefore capacity to deal with the peaks of demand is sought. However, such capacity is rendered obsolete during periods of low demand and therefore the cost involved in installing and maintaining the increased capacity is not justified as utilisation over time is low.

Summary

According to a first aspect of the disclosure there is provided a computer-implemented method for controlling the flow of packets at a receiving node in a communication network of nodes, the method comprising the steps of: receiving, from the receiving node, processing information comprising information relating to the processing rate of packets at the receiving node; determining, at a delivery node, a travel time for a packet sent from the delivery node to the receiving node; determining, at the delivery node, a manner and time for sending a packet from the delivery node to the receiving node such that the packet is processed upon arrival at the receiving node. Embodiments of the present disclosure may provide for an optimised arrival of packets such that the waiting time for packets at the receiving node is reduced or entirely eliminated. They may also allow for the better management of the capacity of the receiving node to ensure that the peaks of demand are offset to times of low demand and therefore occupancy is consistently maintained, and the capacity of the receiving node is efficiently utilised.

In some embodiments, the receiving node may be geographically fixed and may be, for example, a retail merchant device. The delivery node may be a server and/or a personal telecommunications device. Equally, a packet control node may be a personal telecommunications device and such a personal telecommunications device may be a portable device.

The processing information may further comprise information relating to the number of packets received at the receiving node and may further comprise information relating to the capacity of the receiving node for processing packets. The processing information may further comprise a location of the receiving node.

Optionally, the method may further comprise the step of: sending, to a packet control node, instructions for sending the packet in the determined manner and time. The method may further comprise the step of: receiving, at the delivery node, travel data. Such travel data may comprise at least one of: traffic data and public transport information and the travel data may comprise realtime travel data.

Optionally, the packet is a consumer and/or the packet may be a parcel.

The method may further comprise the step of: sending, from the delivery node, packet information. Such packet information may comprise at least one of the following: packet identification, packet location, packet size, packets processing requirement, packet estimated time of arrival, packet sequence position, packet travel time.

The method may further comprise the step of: sending, to the receiving node, the packet according to the determined manner and time for sending the packet. Optionally, the determined manner and time for sending the consumer may be such that upon arrival COVID-19 safety measures are maintained.

The method may further comprise the step of: delaying sending, to the receiving node, the packet until capacity for processing the packet is available at the receiving node and may further comprise the step of: receiving, from the receiving node, instructions to send the packet.

The manner for sending the packet may comprise sending the packet by means of at least one of the following: by train, by car, by bike, by plane, by bus, by boat, by foot, by any other means of transport public or otherwise.

Optionally, the method may further comprise the step of: receiving, from receiving node, confirmation that the packet has been received. Receiving confirmation from the receiving node may comprise scanning a code, such as a QR code, at the receiving node.

Optionally, the method may further comprise the step of: modulating the capacity of the receiving node to process packets in response to the packet information.

In the context of the present disclosure, the concept of “packets” includes any one or more of data packets, physical parcels or letters, and consumers i.e. natural persons. The processing of packets therefore may include any one or more of the processing of data packets, the delivery of physical parcels or letters, and the carrying out of a transaction with a consumer.

Embodiments of the present disclosure may further provide an advantage of increasing the occupancy of the capacity of the receiving node over time.

Brief Description of the Drawings

Embodiment of the disclosure will now be described, by way of example only, and with reference to the figures in which:

Figure 1 schematically illustrates a communication network of nodes according to an embodiment of the present disclosure; Figure 2 schematically illustrates a network-based system comprising a server and a plurality of terminals on which the method of the present disclosure may be executed;

Figure 3 schematically illustrates a receiver node according to an embodiment of the present disclosure;

Figure 4 schematically illustrates a delivery node according to an embodiment of the present disclosure;

Figure 5 schematically illustrates a packet control node according to an embodiment of the present disclosure;

Figures 6 to 14 provide a series of procedural flow diagrams each depicting various steps of a method according to an embodiment of the present disclosure;

Figure 15 illustrates a functional block diagram according to an embodiment of the present disclosure;

Figures 16a and 16b provide a procedural flow diagram separated into two parts and depicting various steps of the embodiment illustrated in Figure 15;

Figure 17 illustrates a functional block diagram according to another embodiment of the present disclosure;

Figures 18a and 18b provide a procedural flow diagram separated into two parts and depicting various step of the embodiment illustrated in Figure 17;

Figures 19 to 23 illustrate a sequence of screenshots depicting the operation of a packet control node according to an embodiment of the present disclosure;

Figure 24 illustrates a graph comparing an arrival pattern of packets without implementation of the present disclosure (original arrival pattern) with an arrival pattern of packets with implementation of the present disclosure (Adjusted arrival pattern);

Figure 25 illustrates a table corresponding to the graph of Figure 24.

Detailed Description

To control the flow of packets at a receiving node in a communication network of nodes, embodiments of the present disclosure provides a computer-implemented method comprising the steps of receiving processing information comprising information relating to the processing rate of packets, determining a travel time for a packet sent to the receiving node and determining a manner and time for sending the packet to the receiving node such that the packet is processed upon arrival at the receiving node. The compute-implemented method may be provided as a computer program. The computer program may be supplied on a computer-readable medium (e.g. a non-transitory computer- readable recording medium such as a CD or DVD) having computer-readable instructions thereon. The computer program may, also or alternatively, be provided in a downloadable format, over a network such as the Internet, or may be hosted on a server.

Figure 1 shows a communication network of nodes 101 according to an embodiment of the present disclosure. The communication network of nodes 101 shown in Figure 1 includes several delivery nodes 103 arranged to send packets 104 to a single receiving node 102.

In other embodiments of the disclosure, there may be several receiving nodes 102 and a single or several delivery nodes 103.

As can be seen from the embodiment shown in Figure 1, the packets 104, 105, 106 are sent to the receiving node 102 such that they arrive in sequence with enough time between their arrival to allow each packet 104, 105, 106 to be processed before the arrival of the next packet 104, 105, 106 in the sequence of packets 104, 105, 106. Thereby, each packet 104, 105, 106 is processed upon arrival at the receiving node.

Figure 1 shows a packet that has arrived 106 at the receiving node 102 and is being processed, a packet that has not yet been sent 104 to the receiving node 102 and several packets that are travelling 105 to the receiving node 102.

Referring to Figure 2, the computer-implemented method may be executed on at least one node in a communication network of nodes 401. Such nodes may comprise, for example, a server 403, a portable and/or personal telecommunications device 109, 402a or a personal computer 402b. The nodes may be connected to and communicate with one another via a communication network 108 such as the Internet. The delivery node may also comprise a personal and/or portable telecommunications device.

In the embodiment shown in Figure 2 there are several receiving nodes 402a, 402b and a delivery node 403. In this embodiment the receiving nodes comprise a portable telecommunications device 402a and a personal computer 402b and the delivery node comprises a server 403.

In the embodiment shown in Figure 2 the network of nodes 101 further comprises a packet control node 109 which may be configured to receive instructions, from the delivery node 403, for sending a packet to at least one of the receiving nodes 402a, 402b. In some embodiments of the present disclosure, the packet control node 109 may accompany the packet to the receiving node 402a, 402b.

In the case of the receiving node comprising a personal computer 402b, the receiving node may not be portable and therefore may inherently be geographically fixed. However, the receiving node may also be geographically fixed in embodiments in which the receiving node comprises a portable device such as a portable telecommunications device 402a. This may be the case when the receiving node is fixed or associated with a location such as a commercial site, for example a vendor. The vendor itself may be movable but in use the receiving node 402a may fixed to the geographical location of the vendor. In this embodiment the receiving node may be a retail merchant device 402a, 402b such as a device for processing payments for the purchase of goods or services.

Figure 3 is a schematic illustration of an exemplary receiving node 102 according to embodiments of the present disclosure. As shown in the Figure 3, the receiving node 102 may comprise a processor 111, data storage 112, a packet processing unit 114, an output interface 113, memory (such as RAM and ROM) 115, a location determining unit 116, a communication interface 117, an input interface 118 and a packet retaining unit 119. It will be appreciated that the contents of the schematic illustration of the receiving node are not exhaustive, and that other components may also be present.

The input interface 118 of the receiving node 102 may comprise means for the user to interface with the node such as a touch screen, a keyboard, a mouse, or some other means. The output interface 113 may comprise means for the receiving node 102 to provide information, alerts or notifications to the user and may comprises a display and/or speakers.

As illustrated, the receiving node 102 comprises a processor 111 (e.g. CPU), memory (e.g. RAM and ROM) 115, data storage means 112 via which data can be stored on a storage device (either within or local to the receiving node 102, or in communication with the communication interface 117) and a communication interface 117 for connecting the receiving node 102 to the communication network of nodes 101 for example by means of the Internet or some other communications network 108 as shown in Figure 2.

The receiving node 102 further comprises a location determining unit 116, which may be configured to determine the location of the receiving node 102 and may also comprise location determining means such as a GPS module.

The receiving node 102 also comprises a packet processing unit 114 for processing packets and optionally comprises a packet retaining unit 119 for storing packets which may be awaiting processing. In some embodiments the packet processing unit 114 may comprise a scanner such as a barcode scanner or a QR code scanner such as a camera for processing a packet such as a parcel.

The packet processing unit 114 may process one packet at a time or several packets simultaneously. Once the processing of a packet is complete the capacity of the packet processing unit becomes available to process the next packet.

In some embodiments, the computer program, for executing the computer-implemented method of the present embodiments, causes the receiving node 102 to take on further functionality of a packet processing unit 114 and/or a packet retaining unit 119.

An internal bus (not shown) may connect the components 111, 112, 113, 114, 115, 116, 117, 118, 119 of the receiving node 102.

Figure 4 is a schematic illustration of an exemplary delivery node 103 according to embodiments of the present disclosure. It will be appreciated that the contents of the schematic illustration are not exhaustive, and that other components may also be present.

As illustrated, the delivery node 103 comprises a processor (e.g. CPU) 211, memory (e.g. RAM and ROM) 215 data storage means 212 via which data can be stored on a storage device (either within or local to the delivery node 103, or in communication with the communication interface 217) and a communication interface 217 for connecting the receiving node 102 to the communication network of nodes 101 for example by means of the Internet or some other communications network 108 as shown in Figure 2. The delivery node 103 may further comprise a user interface (not shown) such as the input interfaces and output interfaces of the packet control node 109 and the receiving node 102 (Figures 5 and 3, respectively), for example, in embodiments in which the delivery node 103 is a portable telecommunications device.

An internal bus (not shown) may connect the components 211, 212, 215, 217 of the delivery node 103.

Figure 5 schematically illustrates an exemplary packet control node 109 according to embodiments of the present disclosure. As illustrated the packet control node may comprise a processor 311, data storage means 312, an output interface 313, memory (such as RAM and ROM) 315, a location determining unit 316, a communication interface 317 and an input interface 318. It will be appreciated that the contents of the schematic illustration of the packet control node 109 are not exhaustive, and that other components may also be present.

The input interface 318 of the packet control node 109 may comprise means for the user to interface with the node such as a touch screen, a keyboard, a mouse, or some other means. The output interface 313 may comprise means for the packet control node 109 to provide information, alerts or notifications to the user and may comprises a display and/or speakers.

As illustrated, the packet control node 109 comprises a processor 311 (e.g. CPU), memory (e.g. RAM and ROM) 315, data storage means 312 via which data can be stored on a storage device (either within or local to the packet control node 109, or in communication with the communication interface 317) and a communication interface 317 for connecting the packet control node 302 to the communication network of nodes 101 for example by means of the Internet or some other communications network 108 as shown in Figure 2.

The packet control node 109 further comprises a location determining unit 316, which may be configured to determine the location of the packet control node 109 and may also comprise location determining means such as a GPS module.

An internal bus (not shown) may connect the components 311, 312, 313, 315, 316, 317, 318 of the packet control node 109.

Figure 6 is a procedural flow diagram of a computer-implemented method 601 for controlling the flow of packets at a receiving node 102 according to embodiments of the present disclosure, in which a manner and time for sending packets such that the packets are processed upon arrival at the receiving node is determined.

The overall method 601 comprises three main steps: receiving processing information 602, determining travel time 603 and determining a manner and time for sending the packet 604.

Following initiation of the method 601, which may be triggered by a request of a delivery node 103 to send a packet 104, a receiving node 102 sends at 602 to at least one delivery node 103 processing information comprising information relating to the processing rate of packets at the said receiving node 102.

The processing information may further comprise information relating to the number of packets 106 received at the receiving node 102, information relating to the capacity of the receiving node for processing packets and/or a location of the receiving node.

Continuing with the method 601 illustrated in Figure 6, once the processing information has been received by the delivery node 103, the delivery node 103 determines at 603 a travel time for a packet 104 sent to the receiving node 102. The packet 104 may be sent from the delivery node 103 or may be sent from or with the packet control node 109.

Following the determination of travel time 603 for the packet 104, the delivery node 103 determines at 604 a manner and time for sending the packet 104 to the receiving node 102 such that the packet 104 is processed upon arrival at the receiving node 102.

Referring now to Figure 7, in addition to the steps outlined above in relation to Figure 6, computer-implemented methods 701 of the present embodiments may further comprise the step of sending instructions for sending the packet 705.

After determination 604 of the manner and time for sending the packet 104, the delivery node 103 may at 705 send to a packet control node 109 instructions for sending the packet in said determined manner and time.

Referring now to Figure 8, alternatively or in addition to the optional step 705 of the method of Figure 7, computer-implemented methods 801 of the present embodiments may further comprise the step of receiving travel data 806. After receiving processing information 602 but before determining a travel time 603, the delivery node 103 may receive travel data.

Such travel data may be received from a third-party server. Such travel data may comprise at least one of: traffic data and public transport information and such travel data may comprise real-time travel data.

Referring now to Figure 9, alternatively or in addition to the optional steps of the methods of Figures 7 and/or 8, computer-implemented methods 901 of the present embodiments may further comprise the step of sending packet information 907.

After determining a manner and time for sending packet data 604 at the delivery node 103, the delivery node 103 may at 907 send packet information to the receiving node 102.

Such packet information may comprise at least one of the following: packet identification, packet location, packet size, packets processing requirement, packet estimated time of arrival, packet sequence position, packet travel time.

Referring now to Figure 10, alternatively or in addition to the optional steps of the methods of Figures 7, 8 and/or 9, computer-implemented methods 1001 of the present embodiments may further comprise the step of sending the packet 104 according to the determined manner and time 1008.

After determining a manner and time for sending packet data 604 at the delivery node 103, the delivery node 103 or the packet control node 109 may send the packet 104 to the receiving node 102 according to the determined manner and time for sending the packet at 1008.

The manner for sending the packet may comprises sending the packet by means of at least one of the following: by train, by car, by bike, by plane, by bus, by boat, by foot, by any other means of transport public or otherwise.

Referring now to Figure 11, alternatively or in addition to the optional steps of the methods of Figures 7, 8, 9 and/or 10, computer-implemented methods 1101 of the present embodiments may further comprise the step of delaying sending the packet until capacity is available at the receiving node 1109.

Before sending the packet according to the determined manner and time 1008, the delivery node

103 or the packet control node 109 may at 1109 delay sending the packet 104 to the receiving node 102 until capacity for processing the packet is available at the receiving node 102, thereby reducing and/or eliminating the likelihood of the packet 104 being rejected upon arrival at the receiving node 102.

Referring now to Figure 12, alternatively or in addition to the optional steps of the methods of Figures 7, 8, 9, 10 and/or 11, computer-implemented methods 1201 of the present embodiments may further comprise the step 1210 of receiving instructions to send the packet.

After determining a manner and time for sending packet data 604 at the delivery node 103, the delivery node 103 may receive instructions to send the packet 104 from the receiving node 102. If the receiving node 102 is available or processing packets it may send out a call for any packets

104 that are waiting to be sent.

Referring now to Figure 13, alternatively or in addition to the optional steps of the methods of Figures 7, 8, 9, 10, 11 and/or 12, computer-implemented methods 1301 of the present embodiments may further comprise the step 1311 of receiving confirmation that the packet has been received.

After sending the packet according to the determined manner and time 1008, the receiving node 102 may send a confirmation that the packet 106 has been received. Such confirmation may be received by the delivery node 103 and/or the packet control node 109.

Referring now to Figure 14, alternatively or in addition to the optional steps of the methods of Figures 7, 8, 9, 10, 11, 12 and/or 13, computer-implemented methods 1401 of the present embodiments may further comprise the step 1412 of modulating the capacity of the receiving node to process packets.

After receiving packet information sent to the receiving node from the delivery node 907, the capacity of the receiving node to process packets may be modulated.

Such modulation may include increasing or decreasing capacity in response to the demand for packet processing from the at least one delivery node 103.

Referring to Figure 15, according to an embodiment of the present disclosure, the delivery node 1503 may be communicatively connected to the packet control node 1509, the receiving node 1502 and the third-party server 1531. The receiving node 1502 may also be communicatively connected directly to the packet control node 1509. This arrangement is suitable for carrying out methods of the present disclosure according to Figures 16a and 16b.

Figure 16a shows a first part of a computer-implemented method according to the present disclosure and suitable for implementation using the arrangement shown in Figure 15.

The method illustrated in Figures 16a and 16b begins with a packet send request 1602 or packet send appointment 1603. The packet control node 1509 and or the delivery node 1503 may indicate to the receiving node 1502 that there is packet to be sent either by imminent request, as in the case of a packet send request 1602 or by prearranged packet send appointment 1603.

The receiving node 1502 may then send out processing information which may include the packet send requests 1602 and packet send appointments 1603 of other packets.

The delivery node 1503 may then sequence 1604, 1605 the packets into an order for delivery to the receiving node 1502. The delivery node 1503 may then send packet information 1606 to the packet control node 1509 and the receiving node 1502. The packet information may include an estimated time of arrival for the packet at the receiving node 1502.

Movement of the packet may then be tracked 1607 by the packet control node 1509 which may accompany the packet to the receiving node 1502. The packet control node 1509 may provide to the delivery node 1503 real time travel data 1608. Upon departure of the packet, the packet control node 1509 may indicate to the delivery node 1503 that the packet location has changed 1609. This may trigger the delivery node 1503 to request travel time information 1610 from a third-party server 1531, 1611.

In the event that the packet’s location remains unchanged, the delivery node 1503 may compare 1612 the estimated delivery time of the packet with the travel time information 1610 it has received from the third-party server 1611 and the location information 1609 provided by the packet control node 1509. If the estimated delivery time is equal to the travel time, the delivery node 1503 or the packet control node 1509 will send the packet 1613. If the estimated delivery time is not equal to the travel time, then the packet control node 1509 or the delivery node 1503 will provide to the packet a timer indicated an expected send time 1614 and once this time has expiredl615, the packet may be sent 1613. The packet may eventually arrive at the receiving node 1616.

Referring now to Figure 16b, upon arrival 1616 of the packet at the receiving node 1502, the receiving node 1502 may carry out a check to determine that the packet has indeed arrived 1617. If the packet is determined to have arrived, the receiving node 1502 may send the packet for processing 1618. If the packet has not yet arrived, the receiving node 1502 will check whether the estimated delivery time (estimated time of arrival) has been exceeded 1619. If the estimated delivery time has not been exceeded, the receiving node 1502 will wait for arrival 1620. If the call time is exceeded 1619 or if the packet has been sent for processing 1618 following arrival, the receiving node 1502 carries out a check as to whether the packet has failed to arrive 1621.

In the event that the packet has not failed to arrive then the packet continues to processing and completion of this embodiment of the present disclosure 1628. However, if the packet if determined to have failed to arrive 1621, the receiving node 1502 considers the next packet in the sequence of packets 1605 for processing 1623.

The receiving node 1502 then determines whether or not the next packet has arrived 1624. If no next packet has arrived then an invitation may be sent out 1625 to the delivery node 1503 and/or the packet control node 1509, inviting the delivery node 1503 and/or the packet control node 1509 to send the next packet.

If such an invitation is accepted or if the next packet has indeed arrived, then the receiving node 1502 may update the call time (estimated delivery time) for all the next packets 1627 in the sequence of packets 1605.

Queue Management Embodiment

Referring now to Figures 17 to 23, an embodiment of the present disclosure may include the control or management of the flow of customers or consumers at a good or services provider.

Referring to Figure 17, according to an embodiment of the present disclosure, the delivery node is a server 1703 which may be communicatively connected to the packet control node which is a customer’s portable device 1709, the receiving node which is a customer service point 1702 and the third-party server in this embodiment is a location API 1731. The customer service point 1702 may be communicatively connected directly to the customer’s portable device 1709. This arrangement is suitable for carrying out methods of the present disclosure according to Figures 18a and 18b.

Figure 18a shows a first part of a computer-implemented method according to the present disclosure and suitable for implementation on the arrangement shown in Figure 17.

The method illustrated in Figures 18a and 18b begins with a same day booking (queue) 1802 or appointment 1803. The customer’s portable device 1709 and or the server 1703 may indicate to the customer service point 1702 that there is customer to be sent either by imminent request, as in the case of a same day booking (queue) 1802 or by prearranged appointment 1803.

The customer service point 1702 may then send out processing information which may include the customer same day booking (queue) requests 1802 and appointments 1803 of other customers.

The server 1703 may then create a queue of customers 1804, 1805 into an order for arrival at the customer service point 1702. The server 1703 may then send a call time 1806 to the customer’s portable device 1709 and the customer service point 1702 which may include an estimated time of arrival for the customer at the customer service point 1702.

Movement of the customer (user) may then be tracked 1807 by the customer’s portable device 1709 which may accompany the customer to the customer service point 1702. The customer’s portable device 1709 may provide to the server 1703 real time commute data 1808. Upon departure of the customer, the customer’s portable device 1709 may indicate to the server 1703 that the customer location has changed 1809. This may trigger the server 1703 to request commute time information 1810 from the location API 1731, 1811.

In the event that the customer’s location remains unchanged, the server 1703 may compare 1812 the commute time 1610 of the customer with the travel time it has received from the location API 1811 and the location information 1809 provided by the customer’s portable device 1709. If the commute time is equal to the travel time, the server 1703 or the customer’s portable device 1709 will notify the customer to move 1813. If the commute time is not equal to the travel time, then the customer’s portable device 1709 or the server 1703 will provide to the customer a timer indicating an expected move time 1814. Once this time is over 1815, the customer may be notified to move 1813. The customer may eventually check-in at the customer service point 1816.

Referring now to Figure 18b, upon check-in 1816 of the customer at the customer service point 1702, the customer service point 1702 may carry out a check to determine that the customer has indeed checked-in 1817. If the customer is determined to have checked- in, the customer service point 1702 may call the customer for service 1818. If the customer has not yet checked-in, the customer service point 1702 will check whether the call time (estimated time of arrival) has been exceeded 1819. If the call time has not been exceeded, the customer service point 1702 will wait for check-in 1820. If the call time is exceeded 1819 or if the customer has been called for service 1818 following check-in, the customer service point 1702 carries out a check as to whether the customer has failed to appear 1821.

In the event that the customer has not failed to appear then the customer continues to start service 1822 and completion 1828 of this embodiment of the present disclosure. However, if the customer is determined to have failed to appear 1821, then at 1823 the customer service point 1702 considers the next customer in the queue 1805 for service. The customer service point 1702 then determines whether or not the next customer has checked-in 1824. If no next customer has checked-in, then an invitation may be sent out 1825 to the server 1703 and/or the customer’s portable device 1709, inviting the server 1703 and/or the customer’s portable device 1709 to notify the next customer.

If such an invitation is accepted or if the next customer has indeed checked-in, then the customer service point 1702 may update the call time (estimated delivery time) for all the next customers 1827 in the queue 1805.

A packet control node 1909 according to the present embodiment is depicted in Figures 19 to 23. In this embodiment the packet 104 is a customer, consumer or user and the packet control node 1909 is a personal portable telecommunications device 1909 of the user 104 such as a smart phone 1909.

As shown in Figure 19, the smart phone 1909 includes a touch-sensitive display 1918 and is configured to display on the touch-sensitive display 1918 a map 1921 showing the geographical location 1922 of a receiving node. In the present embodiment the receiving node is “Paddington Green Health Centre”

Referring now to Figure 20, selection of this receiving node by the user may provide information 1923 on the touch-sensitive screen 1918 regarding the receiving node and may also provide the consumer with actions for selection 1924 such as “select queue”, “join queue” and/or “book appointment”.

Referring to Figure 21, selection of “select queue” may provide the user with several queues or packet processing units 1925 which may also display processing rate of users at the “Paddington Green Health Centre”.

Referring to Figure 22, upon selection of the relevant queue or packet processing unit, the determined packet information is displayed on the touch-sensitive screen 1918 and includes the user sequence position 1926, the user estimated call time 1927 and the estimated time of departure for the user 1928. Referring to Figure 23, upon arrival at the receiving node, “Paddington Green Health Centre”, the user may scan a QR code 1929 at the receiving node and thereby confirm that the packet (user) has been received.

Parcel Delivery Embodiment

Another embodiment of the present disclosure may include the management or control or the flow of parcels to their delivery destination such as to the front doors of customers or consumers.

Variations and Alternatives

Especially in light of the COVID-19 pandemic of 2020 the determined manner and time for sending a consumer to a receiving node may be such that upon arrival, COVID-19 safety measures may be maintained. Additionally, or alternatively the determined manner and time for sending a consumer to a receiving node may be such that upon arrival, safety measures to reduce the transmission of any contagious virus may be maintained. Such a manner and time may be such that there are fewer, minimal or no other consumers waiting to be processed upon arrival at the receiving node.

Detailed embodiments and some possible alternatives have been described above. As those skilled in the art will appreciate, a number of modifications and further alternatives can be made to the above embodiments whilst still benefiting from the disclosures embodied therein. It will therefore be understood that the invention is not limited to the described embodiments and encompasses modifications apparent to those skilled in the art lying within the scope of the claims appended hereto.

Acknowledgement of Registered Trade Marks

Registered trade marks UK00002139445, UK00002356641, UK00002527994 and UK00003299196 have been used in the accompanying Figures 19 to 22 by way of example only.

Advantages of the present disclosure Figure 24 depicts a graph showing an arrival pattern of packets at a receiving node without a computer-implemented method of the present disclosure being implemented (original arrival pattern) in contrast with an arrival pattern of packets at a receiving node with the implementation of a computer-implemented method of the present disclosure (adjusted arrival pattern). These patterns are shown over time. Also shown on the graph is an indication of the capacity of the receiving node for processing packets.

As can be seen from Figure 24, there may be an occupancy gain of the receiving node as a result of the implementation of embodiments of the present disclosure.

The extent of the occupancy gain is shown more clearly in the corresponding table in Figure 25 which shows 5 columns: the time, the number of processing units, the capacity, the occupancy according to an original arrival pattern and an occupancy according to an adjusted arrival pattern i.e. the arrival pattern in accordance with the present disclosure.

As can be seen from this table, in this example the occupancy gain achieved with the adjusted arrival pattern in accordance with the present embodiment is 12.5%.

The second table in Figure 25 provides an indication of the average, low and high incidence of packets per hour.

Such an occupancy gain may be at least 10% and may be between 10% and 20%.

Furthermore, in some embodiments of the present disclosure, the incidence of packets on the receiving node when the receiving node is at or above capacity may cause damage or overheating to the receiving node. For example, a receiving node going over capacity may cause the receiving node to crash.

By optimising the flow of packets at the receiving node, embodiments of the present disclosure may save energy, prevent damage caused by going over capacity, and reduce the frequency of nodes or devices in the communications network becoming overworked.

Claims

CLAIMS:

1. A computer-implemented method for controlling the flow of packets at a receiving node (102) in a communication network of nodes (101), the method comprising the steps of:

• receiving, from the receiving node (102), processing information comprising information relating to the processing rate of packets at the receiving node (102);

• determining, at a delivery node (103), a travel time for a packet (104) sent to the receiving node (102);

• determining, at the delivery node (103), a manner and time for sending the packet (104) to the receiving node (102) such that the packet (104) is processed upon arrival at the receiving node (102).

2. A computer-implemented method according to claim 1, wherein the receiving node (102) is geographically fixed.

3. A computer-implemented method according to any preceding claim, wherein the processing information further comprises information relating to the number of packets received at the receiving node (102).

4. A computer-implemented method according to any preceding claim, wherein the processing information further comprises information relating to the capacity of the receiving node (102) for processing packets.

5. A computer-implemented method according to any preceding claim, wherein the processing information further comprises a location of the receiving node (102).

6. A computer-implemented method according to any preceding claim, wherein in the delivery node (103) is a server.

7. A computer-implemented method according to any preceding claim, wherein the method further comprises the step of:

• sending, to a packet control node (109), instructions for sending the packet in the determined manner and time.

8. A computer-implemented method according to any preceding claim, wherein in the delivery node is a personal telecommunications device.

9. A computer-implemented method according to claim 7, wherein the packet control node is a personal telecommunications device.

10. A computer-implemented method according to any preceding claim, wherein the receiving node is a retail merchant device.

11. A computer-implemented method according to any preceding claim, wherein the packet is at least one of: a consumer or a parcel.

12. A computer-implemented method according to any of claims 8 and 9, wherein the personal telecommunications device is a portable device.

13. A computer-implemented method according to any preceding claim, wherein the method further comprises the step of:

• receiving, at the delivery node, travel data.

14. A computer-implemented method according to claim 13, wherein the travel data comprises at least one of: traffic data and public transport information.

15. A computer-implemented method according to claim 13, wherein the travel data comprises real-time travel data.

16. A computer-implemented method according to any preceding claim, wherein the method further comprises the step of:

• sending, from the delivery node, packet information.

17. A computer-implemented method according to claim 16, wherein the packet information comprises at least one of the following: packet identification, packet location, packet size, packets processing requirement, packet estimated time of arrival, packet sequence position, packet travel time.

18. A computer-implemented method according to any preceding claim, wherein the method further comprises the step of:

• sending, to the receiving node, the packet according to the determined manner and time for sending the packet.

19. A computer-implemented method according to claim 11, wherein the determined manner and time for sending the consumer is such that upon arrival COVID-19 safety measures, or any measures to reduce transmission of any other virus, are maintained.

20. A computer-implemented method according to any preceding claim, wherein the method further comprises the step of:

• delaying sending, to the receiving node, the packet until capacity for processing the packet is available at the receiving node, thereby reducing and/or eliminating the likelihood of the packet being rejected upon arrival at the receiving node.

21. A computer-implemented method according to any preceding claim, wherein the method further comprises the step of:

• receiving, from the receiving node, instructions to send the packet.

22. A computer-implemented method according to any preceding claim, wherein the manner for sending the packet comprises sending the packet by means of at least one of the following: by train, by car, by bike, by plane, by bus, by boat, by foot, by any other means of transport public or otherwise.

23. A computer-implemented method according to any preceding claim, wherein the method further comprises the step of:

• receiving, from the receiving node, confirmation that the packet has been received.

24. A computer-implemented method according to claim 23, wherein receiving confirmation from the receiving node comprises scanning a code, such as a QR code, at the receiving node.

25. A computer-implemented method according to any of claims 16 to 24, wherein the method further comprises the step of:

• modulating the capacity of the receiving node to process packets in response to the packet information.