NetKnack: A simulator for Window-games between TCP Flows

• Team: Lazaros Tsavlidis and Pavlos Efraimidis

• Downloads:
  • NetKnack
    • Symmetric NE in Window-games between AIMD flows
    • Search for general NE in Window-games between AIMD flows
    • Symmetric NE in One-shot window-games between general flows

    Runnable jar file: netknack.jar (v0.14)
    Readme.doc
    For source code (Java) send me an e-mail.

• NetKnackSimple
  • Simple-game simulation between two AIMD flows on a Drop-tail, Prince or MaxMin router
  • Runnable jar file: NetKnackSimple.jar (v0.21)
  • Usage:

    <NetKnackSimple> <Capacity> <NumberOfPlayers> <DROPTAIL | PRINCE | MAXMIN > <AIMD> <n-1 flows alpha> <Nth flow alpha> <GameRounds>
    Example 1: java -jar NetKnackSimple.jar 100 2 DROPTAIL AIMD 1 2 100000
    Example 2: java -jar NetKnackSimple.jar 1000 10 PRINCE AIMD 1 2 10000
    Example 3: java -jar NetKnackSimple.jar 1000 10 MAXMIN AIMD 1 2 100000

    For source code (Java) send me an e-mail.

   

• Mathematica notebooks

WindowGame - DropTail with 2 flows.nb

WindowGame - OneShot DropTail.nb

 

• Related publications (to obtain the papers see publications):
  • P.S. Efraimidis, L. Tsavlidis and George B. Mertzios, Window-Games between TCP flows, accepted in Theoretical Computer Science (TCS), 2010, doi:10.1016/j.tcs.2010.03.031.
  • Preliminary results presented in SAGT 2008: P.S. Efraimidis, L. Tsavlidis, Symposium on Algorithmic Game Theory (SAGT 2008), Lecture Notes in Computer Science (LNCS) 4997, Springer, pages 95-108, 2008.