IN-network state management of long running computations

Slides:



Advertisements
Similar presentations
Zhongxing Ming Dan Li Chumei Xia Mingwei Xu Tsinghua University.
Advertisements

Brewer’s Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services Authored by: Seth Gilbert and Nancy Lynch Presented by:
Binary Trees CSC 220. Your Observations (so far data structures) Array –Unordered Add, delete, search –Ordered Linked List –??
Multimedia and Mobile communications Laboratory CCN 1 DK Han Junghwan Song Computer Networks Practice.
Authors: Alexander Afanasyev, Priya Mahadevany, Ilya Moiseenko, Ersin Uzuny, Lixia Zhang Publisher: IFIP Networking, 2013 (International Federation for.
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Speaker: Cathrin Weiß 11/23/2004 Proseminar Peer-to-Peer Information Systems.
Suphakit Awiphan, Takeshi Muto, Yu Wang, Zhou Su, Jiro Katto
Naming Computer Engineering Department Distributed Systems Course Asst. Prof. Dr. Ahmet Sayar Kocaeli University - Fall 2014.
Small-world Overlay P2P Network
The Application Layer Chapter 7. Where are we now?
Named Data Networking for Social Network Content delivery P. Truong, B. Mathieu (Orange Labs), K. Satzke (Alu) E. Stephan (Orange Labs) draft-truong-icnrg-ndn-osn-00.txt.
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Distributed Snapshots –Termination detection Election algorithms –Bully –Ring.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
© nCode 2000 Title of Presentation goes here - go to Master Slide to edit - Slide 1 Reliable Communication for Highly Mobile Agents ECE 7995: Term Paper.
Oct 21, 2004CS573: Network Protocols and Standards1 IP: Addressing, ARP, Routing Network Protocols and Standards Autumn
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
Intradomain Anycast for Content Centric Networks.
DNS. Outline r Domain Name System r DNS Hierarchy r Resolution.
Proxy-assisted Content Sharing Using Content Centric Networking (CCN) for Resource-limited Mobile Consumer Devices Jihoon Lee, Dae Youb Kim IEEE Transactions.
Adaptive flow control via Interest Aggregation in CCN by Dojun Byun, Byoung-joon, Myeong-Wuk Jang Samsung Electronics, Advanced Institute of Technology.
Chapter 16 – DNS. DNS Domain Name Service This service allows client machines to resolve computer names (domain names) to IP addresses DNS works at the.
Sarah Edwards, GENI Project Office
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Aadil Zia Khan and Shahab Baqai LUMS School of Science and Engineering QoS Aware Path Selection in Content Centric Networks Fahad R. Dogar Carnegie Mellon.
 Protocols used by network systems are not effective to distributed system  Special requirements are needed here.  They are in cases of: Transparency.
ComNets Tutorial: Future Internet with Information Centric Networks Asanga Udugama (1), Carmelita Goerg (1) and Andreas Timm-Giel (2) (1) Communications.
UNIT IP Datagram Fragmentation Figure 20.7 IP datagram.
A NAMED DATA NETWORKING FLEXIBLE FRAMEWORK FOR MANAGEMENT COMMUNICATION Authors: Daneil Corjuo and Rui L. Aguiar Ivan Vidal and Jamie Garcia-Reinoso Presented.
(Business) Process Centric Exchanges
NFD forwarding pipelines Junxiao Shi,
Query Processing. Steps in Query Processing Validate and translate the query –Good syntax. –All referenced relations exist. –Translate the SQL to relational.
Review of the literature : DMND:Collecting Data from Mobiles Using Named Data Takashima Daiki Park Lab, Waseda University, Japan 1/15.
IEEE Communications Magazine July 2012 Bertrand Mathieu Patrick Truong
Pending Interest Table Sizing in Named Data Networking Luca Muscariello Orange Labs Networks / IRT SystemX G. Carofiglio (Cisco), M. Gallo, D. Perino (Bell.
Multimedia & Mobile Communications Lab.
Networking Named Content Van Jacobson, Diana K. Smetters, James D. Thornton, Michael F. Plass, Nicholas H. Briggs, Rebecca L. Braynard.
DHT-based unicast for mobile ad hoc networks Thomas Zahn, Jochen Schiller Institute of Computer Science Freie Universitat Berlin 報告 : 羅世豪.
DNS DNS overview DNS operation DNS zones. DNS Overview Name to IP address lookup service based on Domain Names Some DNS servers hold name and address.
Implementing ISA Server Caching
NETWORKING FUNDAMENTALS. Network+ Guide to Networks, 4e2.
1 30 November 2006 An Efficient Nearest Neighbor (NN) Algorithm for Peer-to-Peer (P2P) Settings Ahmed Sabbir Arif Graduate Student, York University.
Peer to Peer Network Design Discovery and Routing algorithms
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT By Jyothsna Natarajan Instructor: Prof. Yanqing Zhang Course: Advanced Operating Systems.
Page 1 Mutual Exclusion & Election Algorithms Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content.
Sponsored by the National Science Foundation Behind the Scenes of GENI Experimentation featuring Named Data Networking Sarah Edwards.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
P2P Networking: Freenet Adriane Lau November 9, 2004 MIE456F.
Zhaogeng Li, Jun Bi, Sen Wang, and Xiaoke Jiang Asia FI Workshop in Kyoto, 2012 Sho Harada Park Lab Nov 29 th, 2012.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Using Collaborative Filtering to Weave an Information Tapestry
Named Data Networking – A Future Internet Architecture
IP: Addressing, ARP, Routing
Auction-based in-network caching in Information-centric networks Workshop ACROSS, 16th of September 2016 | Lucia D’Acunto.
Content Centric Networking
Notes Onur Ascigil, Vasilis Sourlas, Ioannis Psaras, and George Pavlou
NDN (Named Data Networking)
IMPLEMENTING NAME RESOLUTION USING DNS
Draft-forwarding-label-ccn-02.txt Ravi Ravindran, Asit Chakraborti, Aytac Azgin Huawei (IETF/ICNRG-95, Buenos Aires)
MobileMAN Workshop 2 Cambridge 2 –
Project CS ~1min 11 students Project CS course
CHAPTER 3 Architectures for Distributed Systems
BOOTP and DHCP Objectives
CCN application-domains: brainstorming from GreenICN project
Internet Networking recitation #12
Debashish Purkayastha, Dirk Trossen, Akbar Rahman
SNMP Neil Tang 12/10/2008 CS440 Computer Networks.
Lazy Type Changes in Object-oriented Databases
COMPUTER NETWORKS PRESENTATION
Hitoshi Asaeda (NICT) Xun Shao (KIT)
Presentation transcript:

IN-network state management of long running computations Master’s Thesis Balázs Faludi

Content Centric networking Shift from host-centric solutions to named information as a central design element Finding and retrieving content is the responsibility of the network Proposed by Xerox PARC CCNx: reference implementation CCN-lite: lightweight and functionally interoperable implementation

Network Messages Interests Expresses the interest of a client in a specific content to the network Mainly consists of a single name Content Objects „Response“ to an Interest Contains a name and some data

Network Nodes Forwarding Information Base (FIB) Map name prefixes to forwarding info Cache, Content Store (CS) Pending Interest Table (PIT) Store routing info about forwarded Interests Used to route Content back the the client Entries time out after a while

Client CCN Relay A CCN Relay B CCN Relay C Interest: /ch/unibas/nodeC/testfile.txt /ch/unibas/ nodeC/ testfile.txt Interest: /ch/unibas/nodeC/testfile.txt Interest: /ch/unibas/nodeC/testfile.txt /ch/unibas/ nodeC/ testfile.txt Interest: /ch/unibas/nodeC/testfile.txt Interest: /ch/unibas/nodeC/testfile.txt CCN Relay A CCN Relay B CCN Relay C … /ch/ : B … /ch/unibas/nodeC/ : C … Interest: /ch/unibas/nodeC/testfile.txt Interest: /ch/unibas/nodeC/testfile.txt FIB PIT FIB PIT FIB PIT

Named Function Networking Research project at the University of Basel Builds upon CCN-lite Named content Named functions Network enabled to organize the execution of complex computations Computations expressed using λ-calculus /ch/unibas/…/videofile.mp4/ (@x call 2 |us|ucla|…|compress x 'h.264')/NFN

Client NFN Compute Server NFN Relay A NFN Relay B NFN Relay C /nodeC/ video.mp4 compressed /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN Client NFN Compute Server /nodeC/ video.mp4 compressed /nodeC/video.mp4/ (@x call 2 /nodeC/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/ video.mp4 /nodeC/ video.mp4 /nodeC/ compress /nodeC/ compress NFN Relay A NFN Relay B NFN Relay C … /nodeC/ : B … /nodeC/ : C … /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN FIB PIT FIB PIT FIB PIT

Long running computations CCN-Interests: predictable, relatively short response times NFN-Interests: unpredictable response times Potentially very long running computations with no feedback Problem: PIT entries time out Project: implement and test two different solutions for this problem

Client NFN Compute Server NFN Relay A NFN Relay B NFN Relay C FIB PIT /nodeC/ video.mp4 compressed /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN Client NFN Compute Server /nodeC/ video.mp4 /nodeC/ compress NFN Relay A NFN Relay B NFN Relay C … /nodeC/ : B … /nodeC/ : C … /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN FIB PIT FIB PIT FIB PIT

KEEP Content Approach Let PIT entries time out Periodically retransmit the original Interest Recreate the return path for the results Ensure that the results are cached until they can be retrieved

Client NFN Compute Server NFN Relay A NFN Relay B NFN Relay C /nodeC/ video.mp4 compressed /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN Client NFN Compute Server /nodeC/video.mp4/ (@x call 2 /nodeC/compress x)/NFN /nodeC/ video.mp4 /nodeC/ compress NFN Relay A NFN Relay B NFN Relay C … /nodeC/ : B … /nodeC/ : C … /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN FIB PIT FIB PIT FIB PIT

Keep Alive approach Prevent PIT entries from timing out Both on the client and all forwarding nodes Before a PIT entry times out, send a special Keep Alive Interest (KAI) Inquiry about current state of computation /ch/unibas/…/videofile.mp4/ (@x call 2 |us|ucla|…|compress x 'h.264')/ ALIVE/NFN

Keep Alive approach Result: Extend the lifetime of the PIT entry Resend Keep Alive Interest periodically No result: Assume a problem with the computation, the Interest or the network. Remove PIT entry, abandon computation Repeat until result arrives or KAI times out

Client NFN Compute Server NFN Relay A NFN Relay B NFN Relay C /nodeC/ video.mp4 compressed /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN Client NFN Compute Server /nodeC/ video.mp4 /nodeC/ compress NFN Relay A NFN Relay B NFN Relay C /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN … /nodeC/ : B … /nodeC/ : C … /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ /nodeC/video.mp4/ /nodeC/video.mp4/ (@x call 2 /nodeC/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeC/compress x)/ALIVE/NFN (@x call 2 /nodeC/compress x)/ ALIVE /NFN FIB PIT FIB PIT FIB PIT

intermediate results Extension to the Keep Alive solution Services can create intermediate results Semantics are decided by the service Keep Alive response contains the highest available index of intermediate results Client can optionally send Interests for these intermediate results

/(@x call 2 |nodeC|nbodysim N-Body Simulation Numeric approximation of the movement of interacting particles, e.g. planets or stars Demonstrates the Keep Alive system in a realistic situation Duration depends on temporal resolution and number of iteration steps /(@x call 2 |nodeC|nbodysim '-d' 60 '-s' 10000)/NFN

Comparison Compatibility KA: Requires all nodes to support NFN and the Keep Alive system KC: Allows CCN nodes in the network Feedback KA: feedback inherently supported KC: client is not notified about an issue with the computation

Future Inspect every forwarded KA response Combination of KA and KC Keep PIT entries alive, but move responsibility to source of Interest Keep Computations Alive Abort computation if no KAI is received Client can indirectly cancel a computation

Client NFN Compute Server NFN Relay A NFN Relay B NFN Relay C FIB PIT /nodeC/ video.mp4 compressed /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN Client NFN Compute Server /nodeC/ video.mp4 /nodeC/ compress NFN Relay A NFN Relay B NFN Relay C … /nodeC/ : B … /nodeC/ : C … /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ (@x call 2 /nodeB/compress x)/NFN FIB PIT FIB PIT FIB PIT

Thank you for your attention