Competitive Packet Routing with Priority Lists
نویسندگان
چکیده
منابع مشابه
Competitive Packet Routing with Priority Lists
In competitive packet routing games, packets are routed selfishly through a network and scheduling policies at edges determine which packages are forwarded first if there is not enough capacity on an edge to forward all packages at once. We analyze the impact of priority lists on the worst-case quality of pure Nash equilibria. A priority list is an ordered list of players that may or may not de...
متن کاملIsing Model for Priority Routing Control of Packet Flow
An Ising model is proposed for a packet routing control with priority links for computer networks within a framework of statistical physics. An energy function for the Ising model is defined in order to express competition among a queue length and a distance from a node, where a packet exists, to a destination node of that packet. We use a mean-field approximation for the system in order to int...
متن کاملConditional Source Coding with Competitive Lists
A new lossless source coding algorithm was developed that achieves a compression ratio slightly better than the Lempel-Ziv-Welch algorithm, but requires as little as 250 kBytes of storage. The algorithm is based on the context-tree approach, encoding one input symbol at a time. Thus, its throughput lies in a range comparable to the PPM algorithm. The very low memory requirement is achieved by e...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملCompetitive Local Routing with Constraints
Let P be a set of n points in the plane and S a set of non-crossing line segments between vertices in P , called constraints. Two vertices are visible if the straight line segment connecting them does not properly intersect any constraints. The constrained θm-graph is constructed by partitioning the plane around each vertex into m disjoint cones, each with aperture θ = 2π/m, and adding an edge ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Economics and Computation
سال: 2018
ISSN: 2167-8375,2167-8383
DOI: 10.1145/3184137