Tycho

Results: 254



#Item
31

The Power of Two in Consistent Network Updates: Hard Loop Freedom, Easy Flow Migration Klaus-Tycho F¨orster∗ Roger Wattenhofer

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-05-08 10:30:56
    32Graph connectivity / Emerging technologies / Network architecture / SIGCOMM / Software-defined networking / Stress testing / Algorithm / Reachability / Mathematics / Computing / Academia

    Destroying networks for fun (and profit) Nick Shelly∗§, Brendan Tschaen†, Klaus-Tycho Förster∗, Michael Chang‡, Theophilus Benson†, Laurent Vanbever∗ ∗ ETH Zürich, ‡Princeton University, †Duke Unive

    Add to Reading List

    Source URL: www.tik.ee.ethz.ch

    Language: English - Date: 2015-10-22 14:59:53
    33

    Consistent Updates in Software Defined Networks: On Dependencies, Loop Freedom, and Blackholes Klaus-Tycho Förster, Ratul Mahajan, and Roger Wattenhofer ETH Zurich – Distributed Computing – www.disco.ethz.ch

    Add to Reading List

    Source URL: www.tik.ee.ethz.ch

    - Date: 2016-05-16 16:44:26
      34Computing / Computer networking / Technology / Computer architecture / Network architecture / Emerging technologies / Ethernet / Configuration management / Software-defined networking / Network switch / Traffic flow / Router

      Augmenting Anycast Network Flows Sebastian Brandt, Klaus-Tycho Förster, Roger Wattenhofer January 06, 2016 @ ICDCNSingapore ETH Zurich – Distributed Computing – www.disco.ethz.ch

      Add to Reading List

      Source URL: www.tik.ee.ethz.ch

      Language: English - Date: 2016-01-06 03:53:06
      35Computing / Computer networking / Computer architecture / Network architecture / Networking hardware / SIGCOMM / Software-defined networking / Router / Traffic flow / Network switch

      On Consistent Migration of Flows in SDNs Sebastian Brandt, Klaus-Tycho Förster, Roger Wattenhofer April 12, 2016 @ INFOCOM 2016 – San Francisco ETH Zurich – Distributed Computing – www.disco.ethz.ch

      Add to Reading List

      Source URL: www.tik.ee.ethz.ch

      Language: English - Date: 2016-04-21 02:33:13
      36Graph connectivity / Engineering / Failure / Emerging technologies / Network architecture / Systems engineering / SIGCOMM / Design / Stress testing / Software-defined networking / Algorithm / Reachability

      Destroying networks for fun (and profit) Nick Shelly∗§, Brendan Tschaen†, Klaus-Tycho Förster∗, Michael Chang‡, Theophilus Benson†, Laurent Vanbever∗ ∗ ETH Zürich, ‡Princeton University, †Duke Unive

      Add to Reading List

      Source URL: www.vanbever.eu

      Language: English - Date: 2015-10-30 21:51:01
      37

      Klaus-Tycho Förster Office ETZ G95, GloriastrZurich, Switzerland Phone + / +http://www.disco.ethz.ch/members/foklaus.html

      Add to Reading List

      Source URL: disco.ethz.ch

      Language: English - Date: 2016-05-24 02:05:03
        38

        European Astronomical Society 2016 Prizes Tycho Brahe Prize The 2016 Tycho Brahe Prize is awarded to Prof. Joachim Trümper in recognition of his visionary development of X-ray instrumentation, from balloon experiments a

        Add to Reading List

        Source URL: eas.unige.ch

        Language: English - Date: 2016-05-02 04:02:44
          39NP-complete problems / Dominating set / Approximation algorithm / Domination / Connected dominating set / Domatic number

          Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch

          Add to Reading List

          Source URL: www.tik.ee.ethz.ch

          Language: English - Date: 2015-05-18 12:16:33
          40Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Dominating set / Independent set / Vertex cover / Connected dominating set / Set cover problem / Line graph / Metric k-center / Domatic number

          Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

          Add to Reading List

          Source URL: www.tik.ee.ethz.ch

          Language: English - Date: 2015-05-18 12:16:23
          UPDATE