The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We propose a novel AOS virtual channels scheduling algorithm based on frame urgency. Compared to the conventional scheduling algorithms, the proposed algorithm considers not only the time that frames have been waiting for in virtual channel buffers, but also the maximum time delay that the scheduling module allowed. Frame Urgency is then defined as the difference of the two factors multiplies the...
Maintaining scheduling parameters only in each packet's header make it difficult for core-stateless networks to provide deterministic (zero loss) fair bandwidth allocation to each flow. Based on VCSGR, this paper presents a new algorithm, called FVCSGR (fair-VCSGR). In a network of FVCSGR, the arriving traffic of each flow is divided at the ingress node into a set of layers according to its reserved...
The core-stateless packet scheduling scheme has both scalability and the ability of fine granularity QoS guarantees. However, maintaining scheduling parameters only in the packet header make it difficult for core-stateless networks to provide deterministic (zero loss) fair bandwidth allocation to each flow. To address this problem, we conceptually separate bandwidth allocation into two steps: the...
The core-stateless packet scheduling scheme has both scalability and the ability of fine granularity QoS guarantees. However, maintaining scheduling parameters only in the packet header make it difficult for core-stateless networks to provide deterministic (zero loss) fair bandwidth allocation to each flow. To address this problem, we conceptually separate bandwidth allocation into two steps: the...
Maintaining scheduling parameters only in each packet's header make it difficult for core-stateless networks to provide deterministic (zero loss) fair bandwidth allocation to each flow. Based on VCSGR, this paper presents a new algorithm, called FVCSGR (fair-VCSGR). In a network of FVCSGR, the arriving traffic of each flow is divided at the ingress node into a set of layers according to its reserved...
There is an increasing need for scalability in high-speed networks. The core-stateless approaches based on DPS (dynamic packet state) technique offer great promise in terms of both scalability and fine-grained service guarantees. But, such core-stateless schemes proposed in the literature can not provide accurate rate guarantee to flows due to the loss of a large part of per-flow state. In this paper,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.