4,068 research outputs found
An Axiomatic Approach to Routing
Information delivery in a network of agents is a key issue for large, complex
systems that need to do so in a predictable, efficient manner. The delivery of
information in such multi-agent systems is typically implemented through
routing protocols that determine how information flows through the network.
Different routing protocols exist each with its own benefits, but it is
generally unclear which properties can be successfully combined within a given
algorithm. We approach this problem from the axiomatic point of view, i.e., we
try to establish what are the properties we would seek to see in such a system,
and examine the different properties which uniquely define common routing
algorithms used today.
We examine several desirable properties, such as robustness, which ensures
adding nodes and edges does not change the routing in a radical, unpredictable
ways; and properties that depend on the operating environment, such as an
"economic model", where nodes choose their paths based on the cost they are
charged to pass information to the next node. We proceed to fully characterize
minimal spanning tree, shortest path, and weakest link routing algorithms,
showing a tight set of axioms for each.Comment: In Proceedings TARK 2015, arXiv:1606.0729
Workload Equity in Vehicle Routing Problems: A Survey and Analysis
Over the past two decades, equity aspects have been considered in a growing
number of models and methods for vehicle routing problems (VRPs). Equity
concerns most often relate to fairly allocating workloads and to balancing the
utilization of resources, and many practical applications have been reported in
the literature. However, there has been only limited discussion about how
workload equity should be modeled in VRPs, and various measures for optimizing
such objectives have been proposed and implemented without a critical
evaluation of their respective merits and consequences.
This article addresses this gap with an analysis of classical and alternative
equity functions for biobjective VRP models. In our survey, we review and
categorize the existing literature on equitable VRPs. In the analysis, we
identify a set of axiomatic properties that an ideal equity measure should
satisfy, collect six common measures, and point out important connections
between their properties and those of the resulting Pareto-optimal solutions.
To gauge the extent of these implications, we also conduct a numerical study on
small biobjective VRP instances solvable to optimality. Our study reveals two
undesirable consequences when optimizing equity with nonmonotonic functions:
Pareto-optimal solutions can consist of non-TSP-optimal tours, and even if all
tours are TSP optimal, Pareto-optimal solutions can be workload inconsistent,
i.e. composed of tours whose workloads are all equal to or longer than those of
other Pareto-optimal solutions. We show that the extent of these phenomena
should not be underestimated. The results of our biobjective analysis are valid
also for weighted sum, constraint-based, or single-objective models. Based on
this analysis, we conclude that monotonic equity functions are more appropriate
for certain types of VRP models, and suggest promising avenues for further
research.Comment: Accepted Manuscrip
Allocation in Practice
How do we allocate scarcere sources? How do we fairly allocate costs? These
are two pressing challenges facing society today. I discuss two recent projects
at NICTA concerning resource and cost allocation. In the first, we have been
working with FoodBank Local, a social startup working in collaboration with
food bank charities around the world to optimise the logistics of collecting
and distributing donated food. Before we can distribute this food, we must
decide how to allocate it to different charities and food kitchens. This gives
rise to a fair division problem with several new dimensions, rarely considered
in the literature. In the second, we have been looking at cost allocation
within the distribution network of a large multinational company. This also has
several new dimensions rarely considered in the literature.Comment: To appear in Proc. of 37th edition of the German Conference on
Artificial Intelligence (KI 2014), Springer LNC
A New Combined Framework for the Cellular Manufacturing Systems Design
Cellular Manufacturing (CM) system has been recognized as an efficient and effective way to improve productivity in a factory. In recent years, there have been continuous research efforts to study different facet of CM system. The literature does not contain much published research on CM design which includes all design aspects. In this paper we provide a framework for the complete CM system design. It combines Axiomatic Design (AD) and Experimental Design (ED) to generate several feasible and potentially profitable designs. The AD approach is used as the basis for establishing a systematic CM systems design structure. ED has been a very useful tool to design and analyze complicated industrial design problems. AD helps secure valid input-factors to the ED. An element of the proposed framework is desmontrate through a numerical example for cell formation with alternative process.Cellular manufacturing; Design methodology Axiomatic Design; Experimental Design.
Applying Formal Methods to Networking: Theory, Techniques and Applications
Despite its great importance, modern network infrastructure is remarkable for
the lack of rigor in its engineering. The Internet which began as a research
experiment was never designed to handle the users and applications it hosts
today. The lack of formalization of the Internet architecture meant limited
abstractions and modularity, especially for the control and management planes,
thus requiring for every new need a new protocol built from scratch. This led
to an unwieldy ossified Internet architecture resistant to any attempts at
formal verification, and an Internet culture where expediency and pragmatism
are favored over formal correctness. Fortunately, recent work in the space of
clean slate Internet design---especially, the software defined networking (SDN)
paradigm---offers the Internet community another chance to develop the right
kind of architecture and abstractions. This has also led to a great resurgence
in interest of applying formal methods to specification, verification, and
synthesis of networking protocols and applications. In this paper, we present a
self-contained tutorial of the formidable amount of work that has been done in
formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial
Evaluation of e-learning web sites using fuzzy axiomatic design based approach
High quality web site has been generally recognized as a critical enabler to conduct online business. Numerous studies exist in the literature to measure the business performance in relation to web site quality. In this paper, an axiomatic design based approach for fuzzy group decision making is adopted to evaluate the quality of e-learning web sites. Another multi-criteria decision making technique, namely fuzzy TOPSIS, is applied in order to validate the outcome. The methodology proposed in this paper has the advantage of incorporating requirements and enabling reductions in the problem size, as compared to fuzzy TOPSIS. A case study focusing on Turkish e-learning websites is presented, and based on the empirical findings, managerial implications and recommendations for future research are offered
Distributed Computing with Adaptive Heuristics
We use ideas from distributed computing to study dynamic environments in
which computational nodes, or decision makers, follow adaptive heuristics (Hart
2005), i.e., simple and unsophisticated rules of behavior, e.g., repeatedly
"best replying" to others' actions, and minimizing "regret", that have been
extensively studied in game theory and economics. We explore when convergence
of such simple dynamics to an equilibrium is guaranteed in asynchronous
computational environments, where nodes can act at any time. Our research
agenda, distributed computing with adaptive heuristics, lies on the borderline
of computer science (including distributed computing and learning) and game
theory (including game dynamics and adaptive heuristics). We exhibit a general
non-termination result for a broad class of heuristics with bounded
recall---that is, simple rules of behavior that depend only on recent history
of interaction between nodes. We consider implications of our result across a
wide variety of interesting and timely applications: game theory, circuit
design, social networks, routing and congestion control. We also study the
computational and communication complexity of asynchronous dynamics and present
some basic observations regarding the effects of asynchrony on no-regret
dynamics. We believe that our work opens a new avenue for research in both
distributed computing and game theory.Comment: 36 pages, four figures. Expands both technical results and discussion
of v1. Revised version will appear in the proceedings of Innovations in
Computer Science 201
- …