Two-slot dynamic length WFQ calendar

Abstract

A system and method of scheduling and servicing events in a communications network are described. To provide improved efficiency while maintaining fairness to all traffic a two slot dynamic length Weighted Fair Queuing (WFQ) calendar is implemented. The two slot calendar can transformed to provide fine granularity utilizing a hierarchical WFQ scheme.

Description

FIELD OF THE INVENTION [0001] This invention relates to the communication of information and more particularly to scheduling and servicing of high speed data traffic. BACKGROUND OF THE INVENTION [0002] Information, including data information, is conveniently communicated over communication channels. These channels may include one or more paths between entities allowing communication of information through one or more types of communication media, for example: wire line, fibre optic cables and wireless connections. Typically, a communication channel has a finite bandwidth, i.e., only a finite amount of information may be communicated through the channel in a given amount of time. Information from several sources may be communicated over a common communication channel by sequencing the information over time. [0003] Different types of information may be subject to different communication requirements. Examples of such requirements include a minimum amount of bandwidth, a maximum amount...

AI Technical Summary

Benefits of technology

The patent describes a method and system for scheduling events in a communication system. The method involves creating a calendar with multiple slots, where the length of each slot is adjusted based on the virtual theoretical emission time (VTET) of queues scheduled on the calendar. This allows for efficient scheduling of events, as the calendar can adapt to changes in the timing of queues. The technical effect of this invention is improved scheduling efficiency and flexibility in a communication system.

Problems solved by technology

As another example, file transfer application may tolerate substantial delay but require complete reliability of the information communicated.

However, such calendar structures have generally required storing and processing large amounts of overhead information to control the communication of information through a communication channel.

Such requirements have placed limits on the operating speed of the system used to allocate information to the channel.

In view of this, a large amount of memory is required for implementation and this large memory requirement leads to latency issues.

Although it does not require hundreds of calendar slots as in the n-slot WFQ calendar it still requires tens of calendar slots which as indicated previously raises latency issues.

One additional problem exists with both n-slot WFQ calendars and the architecture disclosed in the aforementioned application is that the number of calendar slots in a calendar is fixed.

This is a particular issue because internal memory is often used in the implementation to minimize latency.

It was desired that further 2 k WFQ calendars be implemented on the chip but this is not feasible due to the large amount of internal memory consumption.

Images