System and Method for Scheduling and Arbitrating Events in Computing and Networking

A method for ensuring weighted fair queuing in a heap-like tree structure, comprising:

• allocating a first service time duration to a first queue having a first event;
• allocating a second service time duration to a second queue having a second event;
• if no more events are present in the first queue, comprising:
• removing the first queue;
• and
• redistributing the first service time duration;
• and
• if no more events are present in the second queue, comprising:
• removing the second queue;
• and
• redistributing the second service time duration, wherein at least one operation of the method is executed through a processor.

A method for traffic shaping in a pile, comprising:

• providing, in a first node, a first queue having a first sort index and a first data field, the first sort index having a first priority and a first timestamp, the first timestamp representing a next transmission time for the first queue in the first node, the first data field having a first event queue identifier, the first queue being given a maximum average rate of transmission;
• providing, in a second node, a second queue having a second sort index and a second data field, the second sort index having a second priority and a second timestamp, the second timestamp representing a next transmission time for the second queue in the second node the second data field having a second event queue identifier, the second queue being given the maximum average rate of transmission;
• and
• dispatching an event based on the first queue and the second queue, wherein at least one operation of the method is executed through a processor.