Distributed scheduling algorithm for CPRI over ethernet
AssigneeTelefonaktiebolaget LM Ericsson (publ)
InventorsMahmoud Mohamed Bahnasy, Halima Elbiaze
Life of this patent
Estimating the term…
Abstract
Systems and methods are provided for scheduling the transmission of data in a datapath. A source node can send a registration request indicating its preferred sending time for data transmission. Intermediate nodes can determine if there are overlaps in timeslot reservations and adjust, and schedule, the requested preferred sending time accordingly.
Claims21
A method for scheduling data transmission performed by an intermediate node in a data path, the method comprising:
- receiving, from a preceding node in the data path, a timeslot registration request message requesting a preferred sending time for scheduling at least one data transmission;
- determining if a conflict exists between the requested preferred sending time and any previously scheduled timeslots;
- responsive to determining there is a conflict between the requested preferred sending time and a first previously scheduled timeslot, determining a next available timeslot that satisfies the received timeslot registration request;
- scheduling the determined next available timeslot for the data transmission;
- transmitting, to the preceding node, an update message indicating a modification to the requested preferred sending time;
- and
- forwarding, to a subsequent node in the data path, a modified timeslot registration request message requesting the determined next available timeslot for scheduling the data transmission.
A network node comprising circuitry including a processor and a memory, the memory containing instructions executable by the processor whereby the network node is operative to:
- receive, from a preceding node in a data path, a timeslot registration request message requesting a preferred sending time for scheduling at least one data transmission;
- determine if a conflict exists between the requested preferred sending time and any previously scheduled timeslots;
- responsive to determining there is a conflict between the requested preferred sending time and a first previously scheduled timeslot, determine a next available timeslot that satisfies the received timeslot registration request;
- schedule the determined next available timeslot for the data transmission;
- transmit, to the preceding node, an update message indicating a modification to the requested preferred sending time;
- and
- forward, to a subsequent node in the data path, a modified timeslot registration request message requesting the determined next available timeslot for scheduling the data transmission.
A method for scheduling data transmission performed by an intermediate node in a data path, the method comprising:
- receiving, from a preceding node in the data path, a timeslot registration request message requesting a preferred sending time for scheduling at least one data transmission;
- determining if a conflict exists between the requested preferred sending time and any previously scheduled timeslots;
- responsive to determining there is no conflict between the requested preferred sending time and the previously scheduled timeslots, scheduling the timeslot for the data transmission;
- forwarding the timeslot registration request message to a subsequent node in the data path;
- receiving, from the subsequent node in the data path, an update message indicating a modification to the requested preferred sending time;
- modifying the scheduled timeslot for the data transmission in accordance with the update message;
- and
- forwarding, to the preceding node, the update message.
Dependencies are inferred from the claim text.