ToNC workshop Next generation architecture H. Balakrishnan, A. Goel, D. Johnson, S. Muthukrishnan, S.Tekinay, T. Wolf DAY 2, Feb 17 2005.

Slides:



Advertisements
Similar presentations
© Antônio M. Alberti 2011 Host Identification and Location Decoupling: A Comparison of Approaches Bruno Magalhães Martins Antônio Marcos Alberti.
Advertisements

P2P data retrieval DHT (Distributed Hash Tables) Partially based on Hellerstein’s presentation at VLDB2004.
Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.
Page 1 / 14 The Mesh Comparison PLANET’s Layer 3 MAP products v.s. 3 rd ’s Layer 2 Mesh.
The Future Internet: A clean-slate design? Nicholas Erho.
University of Cincinnati1 Towards A Content-Based Aggregation Network By Shagun Kakkar May 29, 2002.
CS541 Advanced Networking 1 Wireless Mesh Networks Neil Tang 1/26/2009.
Jang, Donghyun 2011/4/4 1/21.
Internet Indirection Infrastructure Ion Stoica UC Berkeley.
SING* and ToNC * Scientific Foundations for Internet’s Next Generation Sirin Tekinay Program Director Theoretical Foundations Communication Research National.
Topics in Reliable Distributed Systems Fall Dr. Idit Keidar.
The Future of Internet Research Scott Shenker (on behalf of many networking collaborators)
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
Focus on Distributed Hash Tables Distributed hash tables (DHT) provide resource locating and routing in peer-to-peer networks –But, more than object locating.
Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.
Kick-off meeting 3 October 2012 Patras. Research Team B Communication Networks Laboratory (CNL), Computer Engineering & Informatics Department (CEID),
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Mobility in the Virtual Office: A Document-Centric Workflow Approach Ralf Carbon, Gregor Johann, Thorsten Keuler, Dirk Muthig, Matthias Naab, Stefan Zilch.
1 EL736 Communications Networks II: Design and Algorithms Class11: Multi-Hour and Multi-Layer Network Design 12/05/2007.
SKA-cba-ase NSF and Science of Design Avogadro Scale Engineering Center for Bits & Atoms November 18-19, 2003 Kamal Abdali Computing & Communication.
Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.
Introduction to the Mobile Security (MD)  Chaitanya Nettem  Rawad Habib  2015.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
Network Layer (3). Node lookup in p2p networks Section in the textbook. In a p2p network, each node may provide some kind of service for other.
NSF Workshop on Bridging the Gap between Networking and Physical Layer Research Breakout Group #2 Reston, VA Aug 27-28, 2007.
End-to-end resource management in DiffServ Networks –DiffServ focuses on singal domain –Users want end-to-end services –No consensus at this time –Two.
Networking & the Internet. 2 What is a Network? □ A computer network allows computers to communicate with many other computers and to share resources.
COLUMBIA UNIVERSITY Department of Electrical Engineering The Fu Foundation School of Engineering and Applied Science IN THE CITY OF NEW YORK Networking.
NSF Critical Infrastructures Workshop Nov , 2006 Kannan Ramchandran University of California at Berkeley Current research interests related to workshop.
The Center for Autonomic Computing is supported by the National Science Foundation under Grant No NSF CAC Seminannual Meeting, October 5 & 6,
Distributed Computation in MANets Robot swarm developed by James Rice University.
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
Wireless Mesh Network 指導教授:吳和庭教授、柯開維教授 報告:江昀庭 Source reference: Akyildiz, I.F. and Xudong Wang “A survey on wireless mesh networks” IEEE Communications.
BitTorrent enabled Ad Hoc Group 1  Garvit Singh( )  Nitin Sharma( )  Aashna Goyal( )  Radhika Medury( )
1 Distributed Hash Tables (DHTs) Lars Jørgen Lillehovde Jo Grimstad Bang Distributed Hash Tables (DHTs)
Networking & the Internet. 2 What is a Network? □ A computer network allows computers to communicate with many other computers and to share resources.
AKARI New Generation Network Architecture SeungHo Lee.
Computer-Based Communications Systems and Networks IS250 Spring 2010 John Chuang
March 12, 2008© Copyright 2008 John Buford SAM Overlay Protocol draft-buford-irtf-sam-overlay-protocol-01.txt John Buford, Avaya Labs Research IETF 71.
Objectives Functionalities and services Architecture and software technologies Potential Applications –Link to research problems.
Distributed Systems and Algorithms Sukumar Ghosh University of Iowa Spring 2011.
Covilhã, 30 June Atílio Gameiro Page 1 The information in this document is provided as is and no guarantee or warranty is given that the information is.
Internet Real-Time Laboratory Arezu Moghadam and Suman Srinivasan Columbia University in the city of New York 7DS System Design 7DS system is an architecture.
1 Detecting and Reducing Partition Nodes in Limited-routing-hop Overlay Networks Zhenhua Li and Guihai Chen State Key Laboratory for Novel Software Technology.
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
TANGO TANGO ALTERNATE NETWORK GRAPH ORGANIZER Olof Hellqvist Zak Blacher.
REU 2004 Computer Science and Engineering Department The University of Texas at Arlington Research Experiences for Undergraduates in Distributed Rational.
Automated P2P Backup Group 1 Anderson, Bowers, Johnson, Walker.
Workpackage 3 New security algorithm design ICS-FORTH Ipswich 19 th December 2007.
1 A Context Discovery Middleware for Context-Aware Applications with Heterogeneous Sensors Yu-Min Tseng.
Introduction to Grids By: Fetahi Z. Wuhib [CSD2004-Team19]
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
ICS362 – Distributed Systems Dr. Ken Cosh Week 2.
Emergency Services Workshop, 21th-24 th of October, Vienna, Austria Page 1 IP-Based Emergency Applications and Services for Next Generation Networks PEACE.
Current state of affairs No framework for theoretical analysis of (some) protocols –chaos small changes make a lot of difference difficult to tune - or.
Mobile Computing and Wireless Communication Pisa 26 November 2002 Roberto Baldoni University of Roma “La Sapienza”
Distributed Computing Systems CSCI 4780/6780. Scalability ConceptExample Centralized servicesA single server for all users Centralized dataA single on-line.
Data Communications and Networks Chapter 9 – Distributed Systems ICT-BVF8.1- Data Communications and Network Trainer: Dr. Abbes Sebihi.
Peer-to-Peer Systems: An Overview Hongyu Li. Outline  Introduction  Characteristics of P2P  Algorithms  P2P Applications  Conclusion.
Middleware issues: From P2P systems to Ad Hoc Networks
Wikipedia Edit. Internet of Things It is the idea of enabling everyday objects with software, sensors and network connectivity. The connectivity would.
PeerNet: Pushing Peer-to-Peer Down the Stack Jakob Eriksson, Michalis Faloutsos, Srikanth Krishnamurthy University of California, Riverside.
Breakout Group 1 Summary NSF workshop on Bridging the Gap between Wireless Networking Technologies at the Physical Layer Aug
Querying the Internet with PIER CS294-4 Paul Burstein 11/10/2003.
Multicast in Information-Centric Networking March 2012.
Networking & Communications Prof. Javad Ghaderi
CHAPTER 3 Architectures for Distributed Systems
Plethora: Infrastructure and System Design
Task Manager & Profile Interface
Distributed Systems and Algorithms
Presentation transcript:

ToNC workshop Next generation architecture H. Balakrishnan, A. Goel, D. Johnson, S. Muthukrishnan, S.Tekinay, T. Wolf DAY 2, Feb

Agenda What is architecture? Broad outlines? –Focused problems Outreach Mechanisms and logistics

What is Architecture (Systems) What are the optimum design decisions Functionality: where and why? –Example: How much application-specific processing should be done at the core? State -- allocation of state among components; by functionality –What scales better? –Cross-layering vs re-layering –Example: autonomous system structure? Do not take TCP, IP addresses as given

What is Arch. (theory) Also study optimality, algorithmic details, lower and upper bounds Also, topology, network design

Why study architecture? Systems issues -- Current Internet is broken. Theory point -- also ask, are there cliffs we are approaching?

Broad topics Naming and Addressing Communication abstractions and primitives –Overlays Measurement and Diagnostics Other networks -- sensor, adhoc Autonomy Interaction of economics with network architecture Topology and network design decisions

Naming and Addressing Motivation: Mobility and multi-homing –interesting parallels to phone networks What should be permanent/transient? –Should we route based on names? Should we have topological identifiers? –Identifiers serve two purposes: Routing and identification Algorithmic and implementation questions are key in making the decision –Routing efficiency; Lookup efficiency Interactions with security? –Capabilities and address based access control

Primitives and abstractions? Is Layering Fundamental? What is the optimum layering structure? –What state should be exposed (if any) to end nodes? Example of a different architecture –Put/get in addition to and in place of send/receive (eg. web, distributed hash tables) –Initial design of the Internet was motivated by telnet –Content/Attribute based addressing –Implications for load balancing problems –Implications for routing and distributed data structures

Primitives and abstractions What are the right primitives for network tasks? –Characterize capabilities/functionality? –How should they be implemented? –What primitives should the network provide to facilitate peer-to-peer applications? Automated mapping of tasks –Given abstract primitives, what is the best mapping of task on to architecture /primitives NSF program for DDDAS (Distributed data driven application systems) –Covers natural, social, biological, and communication networks

Measurement and Diagnostics Measurement based decision making –Quantifiable benefits of measurement –Massive data set analysis –Optimum response to measurements/interpreting measurements? –Forensic measurements? What are the right queries to issue? How do you architect networks to facilitate measurement? Self-administering and the role of measurements

Autonomous systems, architecture, and economics Do autonomous systems need to exist? Is the current structure optimal? –Degree of autonomy/centralization? –Are there more monolithic models that still allow for individual latitude? –Connections to the phone network –Interaction of network organization and network economics Volume based charging and its implication for architecture?

Other broad areas Wireless and sensor net architecture Topology issues –Network design –Optical networks Application level networks (P2P)

Outreach CS looks at the world through discrete lens. EE reduces everything to convex optimization –More serious discrete modeling –More serious versions of continuous algorithms Outreach goal: Not be isolationist –More proposals to Nets –Already, good collaborations with network systems researchers. Build on that. More co-teaching etc. –More integration with EE theory