Settlers of Alpha Centari

Slides:



Advertisements
Similar presentations
Presentation of Designing Efficient Irregular Networks for Heterogeneous Systems-on-Chip by Christian Neeb and Norbert Wehn and Workload Driven Synthesis.
Advertisements

© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Addressing the Network – IPv4 Network Fundamentals – Chapter 6.
P2P-DIET: One-time and Continuous Queries in Super-Peer Networks By Stratos Idreos, Manolis Koubarakis and Christos Tryfonopoulos Intelligent Systems Laboratory.
Routing: Cores, Peers and Algorithms
A Scalable Virtual Registry Service for jGMA Matthew Grove CCGRID WIP May 2005.
Graph Theory ITEC 320 Lecture 21. Graph Theory Review Higher level usage of pointers –Factories –Flyweight –Disk pool Rationale Benefits / Downsides.
ITEC 320 Lecture 12 Higher level usage of pointers.
An Innovative Approach to Content Search Across P2P Inter-Networks Potharaju S.R.P Saradhi Mohmed Nazuruddin Shaik Potharaju S R Aditya Under The Guidance.
UNIT-IV Computer Network Network Layer. Network Layer Prepared by - ROHIT KOSHTA In the seven-layer OSI model of computer networking, the network layer.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
R-Mancala Srinivas Krishnan & Kiranjit Sidhu. Outline Design Details Refactoring Experience Demo.
Graph Analysis with High Performance Computing by Bruce Hendrickson and Jonathan W. Berry Sandria National Laboratories Published in the March/April 2008.
HyperCuP – P2P Network Boyko Syarov. 2 Outline  HyperCup: What is it?  Basic Concepts  Broadcasting Algorithm  Topology Construction  Ontology Based.
Progress Report 11/1/01 Matt Bridges. Overview Data collection and analysis tool for web site traffic Lets website administrators know who is on their.
1 Review of Important Networking Concepts Introductory material. This module uses the example from the previous module to review important networking concepts:
Hermes: A Distributed Event- Based Middleware Architecture Peter Pietzuch and Jean Bacon 1st DEBS Workshop, Vienna,
Graphs Chapter 28 Copyright ©2012 by Pearson Education, Inc. All rights reserved.
Internet Architecture Two computers, anywhere in the world, following certain hardware, software, protocol specifications, can communicate, reliably even.
The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.
1 Review of Important Networking Concepts Introductory material. This slide uses the example from the previous module to review important networking concepts:
Quoridor Classic Game Manager Kevin Dickerson April 2004.
Properties of networks to be considered in their visualization Jan Terje Bjørke.
NetworkProtocols. Objectives Identify characteristics of TCP/IP, IPX/SPX, NetBIOS, and AppleTalk Understand position of network protocols in OSI Model.
Chapter 27 sections CS 332 Spring Link-state Routing Q: Could you go over link-state routing (like OSPF)? A: Each router constructs a graph of the.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
Institute of Computer and Communication Network Engineering OFC/NFOEC, 6-10 March 2011, Los Angeles, CA Lessons Learned From Implementing a Path Computation.
Getting to Know TiVo: The Home Media Engine (HME SDK) Eric M. Upchurch CS 525 Spring 2008.
Introduction Distributed Algorithms for Multi-Agent Networks Instructor: K. Sinan YILDIRIM.
Computers Are Your Future Tenth Edition Chapter 8: Networks: Communicating & Sharing Resources Copyright © 2009 Pearson Education, Inc. Publishing as Prentice.
Networks – Network Architecture Network architecture is specification of design principles (including data formats and procedures) for creating a network.
Computer Networks (CS 132/EECS148) General Networking Example Karim El Defrawy Donald Bren School of Information and Computer Science University of California.
CSC 600 Internetworking with TCP/IP Unit 8: IP Multicasting (Ch. 17) Dr. Cheer-Sun Yang Spring 2001.
Spring 2006Computer Networks1 Chapter 2 Network Models.
Internet Protocol B Bhupendra Ratha, Lecturer School of Library and Information Science Devi Ahilya University, Indore
© Jörg Liebeherr, Organization Addresses TCP/IP Protocol stack Forwarding Internet.
1 Week 5 Lecture 2 IP Layer. 2 Network layer functions transport packet from sending to receiving hosts transport packet from sending to receiving hosts.
Visualizing Peer-to-Peer Networks Final Presentation By Team SPEW.
Chapter 3 - VLANs. VLANs Logical grouping of devices or users Configuration done at switch via software Not standardized – proprietary software from vendor.
The University of Bolton School of Games Computing & Creative Technologies LCT2516 Network Architecture CCNA Exploration LAN Switching and Wireless Chapter.
1 Chapters 2 & 3 Computer Networking Review – The TCP/IP Protocol Architecture.
COS 420 Day 15. Agenda Finish Individualized Project Presentations on Thrusday Have Grading sheets to me by Friday Group Project Discussion Goals & Timelines.
Spring RabbitMQ Martin Toshev.
Active Message Application: CONNECT Presented by Xiaozhou David Zhu Oommen Regi July 6, 2001.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 1 Module 10 Routing Fundamentals and Subnets.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
P2P Search COP P2P Search Techniques Centralized P2P systems  e.g. Napster, Decentralized & unstructured P2P systems  e.g. Gnutella.
Graphs Chapter 28 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. Data Structures and Abstractions with Java, 4e Frank Carrano.
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
- 1 - DPNM Review of Important Networking Concepts J. Won-Ki Hong Dept. of Computer Science and Engineering POSTECH Tel:
1 3/21/2016 MATH 224 – Discrete Mathematics First we determine if a graph is connected.
1 Deploying Measurement Systems in ESnet Joint Techs, Feb Joseph Metzger ESnet Engineering Group Lawrence Berkeley National Laboratory.
Python Driven Sensor Observation Service Benjamin Welton NASA USRP.
Building Distributed Educational Applications using P2P
Constraint-Based Routing
Distributed Systems.
Board Game Editor and Player Framework
Distributed Systems CS
What is a router? A router is a device that connects multiple computers together. Not to be confused with a switch Routers transmit packets of data across.
CHAPTER 3 Architectures for Distributed Systems
ECE 544 Protocol Design Project 2016
File Transfer Protocol
Algorithms for Exploration
Review of Important Networking Concepts
Chapter 3 VLANs Chaffee County Academy
1 TRANSMISSION CONTROL PROTOCOL / INTERNET PROTOCOL (TCP/IP) K. PALANIVEL Systems Analyst, Computer Centre Pondicherry University, Puducherry –
Distributed Systems CS
Connecting to the Network
COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.
Amir Kouretchian Peter Turschmid Chris Byszeski
Review of Important Networking Concepts
Presentation transcript:

Settlers of Alpha Centari Peter Smith Software Architecture – Spring 2011

Project Goals Clone of popular board game Settlers of Catan Ability to host extendible AI players Enhanced network reliability

Approach Developed a P2P event driven Java application based on MVC pattern Utilized some existing libraries: JGraphT, JDOM, and Jython Default AI Player written in Python

Basic Game Architecture

Game Board Data Structure Game Board is composed of tiles with 6 vertices each, yields a very natural Graph Structure Each tile is assigned a number Settlements are built on vertices Roads are built on edges JGraphT provides container classes for this graph as well as common graph algorithms like breadth first and dijsktra’s shortest path 6 8 4

P2P Architecture Player #1 Player #3 Event driven Represent TCP\IP Connection Player #1 Player #3 Event driven Each peer is connected to every other peer Player #2

P2P Arch. Adding a new player 1) New Player connects to any of the existing nodes by knowing an existing node’s IP Address Player #2 New Player Join Request 2) New Player retrieves list of other players from the node it initially connected to and forms connections with the rest of the nodes in the network . It also receives initial game state from the node it initially connected to.

P2P Arch. Playing the game Player #1 Placed Settlement at Vtx #5 – Player #1 Player #3 All actions in game are published to other players via events. Events are broadcasted (sent to every other player). There are around 19 total different game events Placed Settlement at Vtx #5 – Player #1 Player #2

Problems encountered Existing bugs in implementation of network voting system to handle timed out\dropped players Not enough time to properly design AI strategies to play game

Future Work Enhance network robustness – allow for partially connected network topologies with routing of events between peers Allow for player rejoin on hangup\time out Explore AI Strategies to play this strategy game Allow for user defined game engine rules for injectable logic and user game customization (i.e. a game board editor)

Demo Any questions???