Flow control is the dominant technique currently used in communication networks for preventing excess traffic from flooding the network, and for handling congestion. In ratebased flow control, transmission rates of sessions are adjusted in an end-to-end manner through a sequence of operations. In this work, we present a theory of max-min fair, ratebased flow control sensitive to priorities of d...

This paper outlines how to compute community priority indices in the context of multicriteria decision making in community settings. A simple R function was developed and validated with community needs assessment data. Particularly, the first part of this paper briefly overviews the existing methods for priority setting and reviews the utility of a multicriteria decision-making approach for com...

This paper deals with multi-criteria decision making (MCDM) problems with multiple priorities, in which priority weights associated with the lower priority criteria are related to the satisfactions of the higher priority criteria. To do so, we first propose a prioritized weighted aggregation operator based on ordered weighted averaging (OWA) operator and triangular norms (t-norms). In order to ...

A maximum priority matching is a matching in an undirected graph that maximizes a priority score defined with respect to given vertex priorities. An earlier paper showed how to find maximum priority matchings in unweighted graphs. This paper describes an algorithm for bipartite graphs that is faster when the number of distinct priority classes is limited. For graphs with k distinct priority cla...