نتایج جستجو برای: strict congestion
تعداد نتایج: 54518 فیلتر نتایج به سال:
Implicit hop-by-hop congestion control is a novel congestion control paradigm for wireless multihop networks. Implemented in the CXCC protocol, it has already proven its performance in simulations and measurements. Since CXCC makes extensive use of the properties of an inherently unreliable medium, it is, however, vitally necessary to validate the correctness of the protocol. Indeed, an early v...
in trading electrical energy in deregulated power systems, violation of operation constraints such as transmission lines flow limits is possible. these conditions have been called “congestion”. one of the most important responsibility of independent system operator (iso) is congestion management in a manner that all the system equipments be operated in their nominal ranges. in this paper, usi...
Under strict net neutrality Internet service providers (ISPs) are required to carry data without any differentiation and at no cost to the content provider. We provide a simple framework with a monopoly ISP to evaluate different net neutrality rules. Content differs in its sensitivity to delay. Content providers can use congestion control techniques to reduce delay for their content, but do not...
Congestion on roads results in infrastructural deficiencies including massive delays, greater fatalities, and enhanced mental stresses, reduced transit efficiency, increased travel costs. Traffic is a major problem specifically the central area of Lahore city. This study aimed at understanding traffic congestion from stakeholders' perspective suggesting mitigation measures. A sample 365 respond...
For—according to the lore—any attempt at pullingoff this featwill reduce themtomaterial implicationand that is decidedlynot agoodwayof assigning truth-conditions to ordinary indicative if s. That is too bad since it seems like they are bounded from above by strict implication (they are true when their antecedents straight out imply their consequents), are bounded from below by material implicat...
This paper discusses some serious difficulties for what we shall call the standard account of various kinds of relative necessity, according to which any given kind of relative necessity may be defined by a strict conditional necessarily, if C then p where C is a suitable constant proposition, such as a conjunction of physical laws. We argue, with the help of Humberstone (Reports on Mathematica...
We study repeated games where players employ an exponential learning scheme in order to adapt to an ever-changing environment. If the game’s payoffs are subject to random perturbations, this scheme leads to a new stochastic version of the replicator dynamics that is quite different from the “aggregate shocks” approach of evolutionary game theory. Irrespective of the perturbations’ magnitude, we...
The incrementally extensible hypercube (IEH) graph is a generalization of binary hypercube networks in that the number of nodes can be arbitrary in contrast to a strict power of 2. In this paper, the authors present an efficient model to fulfill the embedding of a full binary tree into a full IEH graph. As the model the authors proposed, an algorithm is developed for the embedding with expansio...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید