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.
In this paper, we present the Fair Early Drop (FED) scheme which aims to prevent the unfairness problem generated by unresponsive flows and treat the various kinds of transport traffic “fairly”. Unresponsive flows are managed by making sure they do not consume more than their fair share of network resources; that is, by dropping more packets from them. The dropping decision is simple with O(1) complexity...
The provision of quality of service (QoS) in computing and communication environments has increasingly focused the attention from academia and industry during the last decades. Some of the current interconnection technologies include hardware support that, adequately used, allows to offer QoS guarantees to the applications. The egress link scheduling algorithm is a key part of that support. Apart...
CICQ (Combined Input-Crosspoint Queued) switch fabric is an ideal solution for high-speed routers, which brings its nice distributed parallel scheduling property with no internal speedup required. Studying through resent scheduling algorithms for CICQ, it is shown that the basic reason leading to instability and performance decrease of throughput under nonuniform traffic is the imbalance of input...
This paper considers the delay-optimal power and transmission threshold control design in S-ALOHA network with FSMC fading channels. The random access system consists of an access point with K competing users, each has access to the local channel state information (CSI) and queue state information (QSI) as well as the common feedback (ACK/NAK/Collision) from the access point. We seek to derive the...
Efficiency and effectiveness are always the emphases of a scheduler, for both link and processor scheduling. Well-known scheduling algorithms such as surplus round robin (SRR) and elastic round robin (ERR) suffer from two fold shortcomings: 1) additional pre-processing queuing delay and post-processing resequencing delay are incurred due to the lack of short-term load-balancing; 2) bursty scheduling...
In this correspondence, we consider the problem of delay optimal rate allocation in a (potentially asymmetric) multiaccess channel. The rate feasibility region of such a network is well studied and is shown to be of a polymatroid structure. We consider this problem with unsaturated sources, i.e., jobs arrive at sources at random times and the source has the possibility of being empty. In such a setting,...
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.