Document Open Access Logo

A Dichotomy Result for Cyclic-Order Traversing Games

Authors Yen-Ting Chen, Meng-Tsung Tsai, Shi-Chun Tsai



PDF
Thumbnail PDF

File

LIPIcs.ISAAC.2018.29.pdf
  • Filesize: 483 kB
  • 13 pages

Document Identifiers

Author Details

Yen-Ting Chen
  • Department of Computer Science, National Chiao Tung University, Hsinchu City, Taiwan
Meng-Tsung Tsai
  • Department of Computer Science, National Chiao Tung University, Hsinchu City, Taiwan
Shi-Chun Tsai
  • Department of Computer Science, National Chiao Tung University, Hsinchu City, Taiwan

Cite AsGet BibTex

Yen-Ting Chen, Meng-Tsung Tsai, and Shi-Chun Tsai. A Dichotomy Result for Cyclic-Order Traversing Games. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 29:1-29:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.ISAAC.2018.29

Abstract

Traversing game is a two-person game played on a connected undirected simple graph with a source node and a destination node. A pebble is placed on the source node initially and then moves autonomously according to some rules. Alice is the player who wants to set up rules for each node to determine where to forward the pebble while the pebble reaches the node, so that the pebble can reach the destination node. Bob is the second player who tries to deter Alice's effort by removing edges. Given access to Alice's rules, Bob can remove as many edges as he likes, while retaining the source and destination nodes connected. Under the guide of Alice's rules, if the pebble arrives at the destination node, then we say Alice wins the traversing game; otherwise the pebble enters an endless loop without passing through the destination node, then Bob wins. We assume that Alice and Bob both play optimally. We study the problem: When will Alice have a winning strategy? This actually models a routing recovery problem in Software Defined Networking in which some links may be broken. In this paper, we prove a dichotomy result for certain traversing games, called cyclic-order traversing games. We also give a linear-time algorithm to find the corresponding winning strategy, if one exists.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph theory
  • Theory of computation → Design and analysis of algorithms
  • Networks → Network reliability
Keywords
  • st-planar graphs
  • biconnectivity
  • fault-tolerant routing algorithms
  • software defined network

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Fred S. Annexstein, Kenneth A. Berman, Tsan-Sheng Hsu, and Ram Swaminathan. A multi-tree routing scheme using acyclic orientations. Theoretical Computer Science, 240(2):487-494, 2000. Google Scholar
  2. Sanjeev Arora and Boaz Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2009. Google Scholar
  3. Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, and Andrea Ribichini. Max flow vitality in general and planar graphs. CoRR, abs/1710.01965, 2017. URL: http://arxiv.org/abs/1710.01965.
  4. Dimitri P. Bertsekas and Robert G. Gallager. Data Networks, Second Edition. Prentice Hall, 1992. Google Scholar
  5. Gary Chartrand and Frank Harary. Planar permutation graphs. Annales de l'Institut Henri Poincaré B, 3(4):433-438, 1967. Google Scholar
  6. Norishige Chiba, Takao Nishizeki, Shigenobu Abe, and Takao Ozawa. A linear algorithm for embedding planar graphs using PQ-Trees. Journal of Computer and System Sciences, 30(1):54-76, 1985. Google Scholar
  7. Reuven Cohen, Baiju V. Patel, Frank Schaffa, and Marc Willebeek-LeMair. The Sink Tree Paradigm: Connectionless Traffic Support on ATM LAN’s. IEEE/ACM Trans. Netw., 4(3):363-374, 1996. Google Scholar
  8. Ding-Zhu Du and Ker-I Ko. Theory of Computational Complexity, Second Edition. Wiley, 2014. Google Scholar
  9. Eli M. Gafni and Dimitri P. Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Trans. Comm., 29:11-18, 1981. Google Scholar
  10. Frank Harary. Graph theory. Addison-Wesley, 1991. Google Scholar
  11. John Hopcroft and Robert Tarjan. Algorithm 447: Efficient Algorithms for Graph Manipulation. Commun. ACM, 16(6):372-378, June 1973. URL: http://dx.doi.org/10.1145/362248.362272.
  12. John Hopcroft and Robert Tarjan. Efficient planarity testing. Journal of the Association for Computing Machinery, 21:549–568, 1974. Google Scholar
  13. Tsan-sheng Hsu and Ming-Yang Kao. A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity. J. Comb. Optim., 2(3):237-256, 1998. Google Scholar
  14. Bernhard Korte and Jens Vygen. Combinatorial Optimization: Theory and Algorithms. Springer Publishing Company, Incorporated, 6th edition, 2018. Google Scholar
  15. Casimir Kuratowski. Sur le problème des courbes gauches en Topologie. Fundamenta Mathematicae, 15(1):271-283, 1930. URL: http://eudml.org/doc/212352.
  16. A. Lempel, S. Even, and I. Cederbaum. An Algorithm for Planarity Testing of Graphs. In Theory of Graphs, International Symposium, pages 215-232, 1966. Google Scholar
  17. Y.-Z. Liao and S.-C. Tsai. Fast Failover with Hierarchical Disjoint Paths in SDN. In IEEE Global Communications Conference (GLOBECOM), 2018. Google Scholar
  18. Nick McKeown, Tom Anderson, Hari Balakrishnan, Guru Parulkar, Larry Peterson, Jennifer Rexford, Scott Shenker, and Jonathan Turner. OpenFlow: enabling innovation in campus networks. ACM SIGCOMM Computer Communication Review, 38:69-74, 2008. Google Scholar
  19. SDN. https://www.opennetworking.org/sdn-resources/sdn-definition. [Online].
  20. Pierre Rosenstiehl and Robert E. Tarjan. Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs. Discrete Comput. Geom., 1(4):343-353, December 1986. Google Scholar
  21. W.-K. Shih and W.-L Hsu. A new planarity test. Theo. Comput. Sci., 223:179–191, 1999. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail