اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBreaking the Legend: Maxmin Fairness notion is no longer effective
42
0
0.0
(
0
)
نشر من قبل
Secretary Aircc Journal
تاريخ النشر
2010
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of the bandwidth which adopted by all previous scheduling mechanism. It rather adopt the opposition approach be proposing the notion of Maxmin-charge which fairly distribute the congestion. Furthermore, analytical proposition of novel mechanism named as Just Queueing is been demonstrated.
قيم البحث
اقرأ أيضاً
We present multi-wavelength observations that trace more than 40 years in the life of the active galactic nucleus (AGN) in Mrk 590, traditionally known as a classic Seyfert 1 galaxy. From spectra recently obtained from HST, Chandra, and the Large Bin
ocular Telescope, we find that the activity in the nucleus of Mrk 590 has diminished so significantly that the continuum luminosity is a factor of 100 lower than the peak luminosity probed by our long baseline observations. Furthermore, the broad emission lines, once prominent in the UV/optical spectrum, have all but disappeared. Since AGN type is defined by the presence of broad emission lines in the optical spectrum, our observations demonstrate that Mrk 590 has now become a changing look AGN. If classified by recent optical spectra, Mrk 590 would be a Seyfert ~1.9-2, where the only broad emission line still visible in the optical spectrum is a weak component of Halpha. As an additional consequence of this change, we have definitively detected UV narrow-line components in a Type 1 AGN, allowing an analysis of these emission-line components with high-resolution COS spectra. These observations challenge the historical paradigm that AGN type is only a consequence of the line of sight viewing angle toward the nucleus in the presence of a geometrically-flattened, obscuring medium (i.e., the torus). Our data instead suggest that the current state of Mrk 590 is a consequence of the change in luminosity, which implies the black hole accretion rate has significantly decreased.
Using a shallow, two-color survey carried out with the Dark Energy Camera, we detect the southern, possibly trailing arm of the Orphan Stream. The stream is reliably detected to a declination of $-38^circ$, bringing the total known length of the Orph
an stream to $108^circ$. We find a slight offset or S shape in the stream at $delta simeq -14^circ$ that would be consistent with the transition from leading to trailing arms. This coincides with a moderate concentration of $137 pm 25$ stars (to $g = 21.6$) that we consider a possible remnant of the Orphan progenitor. The position of this feature is in agreement with previous predictions.
In this paper we build upon the recent observation that the 802.11 rate region is log-convex and, for the first time, characterise max-min fair rate allocations for a large class of 802.11 wireless mesh networks. By exploiting features of the 802.11e
/n MAC, in particular TXOP packet bursting, we are able to use this characterisation to establish a straightforward, practically implementable approach for achieving max-min throughput fairness. We demonstrate that this approach can be readily extended to encompass time-based fairness in multi-rate 802.11 mesh networks.
There has been much work on exhibiting mechanisms that implement various bargaining solutions, in particular, the Kalai-Smorodinsky solution cite{moulin1984implementing} and the Nash Bargaining solution. Another well-known and axiomatically well-stud
ied solution is the lexicographic maxmin solution. However, there is no mechanism known for its implementation. To fill this gap, we construct a mechanism that implements the lexicographic maxmin solution as the unique subgame perfect equilibrium outcome in the n-player setting. As is standard in the literature on implementation of bargaining solutions, we use the assumption that any player can grab the entire surplus. Our mechanism consists of a binary game tree, with each node corresponding to a subgame where the players are allowed to choose between two outcomes. We characterize novel combinatorial properties of the lexicographic maxmin solution which are crucial to the design of our mechanism.
This paper presents a modified proportional fairness (PF) criterion suitable for mitigating the textit{rate anomaly} problem of multirate IEEE 802.11 Wireless LANs employing the mandatory Distributed Coordination Function (DCF) option. Compared to th
e widely adopted assumption of saturated network, the proposed criterion can be applied to general networks whereby the contending stations are characterized by specific packet arrival rates, $lambda_s$, and transmission rates $R_d^{s}$. The throughput allocation resulting from the proposed algorithm is able to greatly increase the aggregate throughput of the DCF while ensuring fairness levels among the stations of the same order of the ones available with the classical PF criterion. Put simply, each station is allocated a throughput that depends on a suitable normalization of its packet rate, which, to some extent, measures the frequency by which the station tries to gain access to the channel. Simulation results are presented for some sample scenarios, confirming the effectiveness of the proposed criterion.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
