Presentation is loading. Please wait.

Presentation is loading. Please wait.

IN-network state management of long running computations

Published byGitta Abel Modified over 5 years ago

Similar presentations

Presentation on theme: "IN-network state management of long running computations"— Presentation transcript:

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

2 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

3 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

4 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

5 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

6 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/ call 2 |us|ucla|…|compress x 'h.264')/NFN

7 Client NFN Compute Server NFN Relay A NFN Relay B NFN Relay C
/nodeC/ video.mp4 compressed /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN Client NFN Compute Server /nodeC/ video.mp4 compressed /nodeC/video.mp4/ call 2 /nodeC/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ 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/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN FIB PIT FIB PIT FIB PIT

8 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

9 Client NFN Compute Server NFN Relay A NFN Relay B NFN Relay C FIB PIT
/nodeC/ video.mp4 compressed /nodeC/video.mp4/ 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/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN FIB PIT FIB PIT FIB PIT

10 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

11 Client NFN Compute Server NFN Relay A NFN Relay B NFN Relay C
/nodeC/ video.mp4 compressed /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN Client NFN Compute Server /nodeC/video.mp4/ 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/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN FIB PIT FIB PIT FIB PIT

12 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/ call 2 |us|ucla|…|compress x 'h.264')/ ALIVE/NFN

13 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

14 Client NFN Compute Server NFN Relay A NFN Relay B NFN Relay C
/nodeC/ video.mp4 compressed /nodeC/video.mp4/ 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/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN … /nodeC/ : B … /nodeC/ : C … /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ /nodeC/video.mp4/ /nodeC/video.mp4/ call 2 /nodeC/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeC/compress x)/ALIVE/NFN call 2 /nodeC/compress x)/ ALIVE /NFN FIB PIT FIB PIT FIB PIT

15 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

16 /(@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 call 2 |nodeC|nbodysim '-d' 60 '-s' 10000)/NFN

17

18 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

19 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

20 Client NFN Compute Server NFN Relay A NFN Relay B NFN Relay C FIB PIT
/nodeC/ video.mp4 compressed /nodeC/video.mp4/ 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/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN /nodeC/video.mp4/ call 2 /nodeB/compress x)/NFN FIB PIT FIB PIT FIB PIT

21 Thank you for your attention

22

23

Download ppt "IN-network state management of long running computations"

Similar presentations

Zhongxing Ming Dan Li Chumei Xia Mingwei Xu 2014-2-5 1 Tsinghua University.

Zhongxing Ming Dan Li Chumei Xia Mingwei Xu Tsinghua University.
Brewer’s Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services Authored by: Seth Gilbert and Nancy Lynch Presented by:

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 –??

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 2012-3-7 Computer Networks Practice.

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.

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.

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

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.

Naming Computer Engineering Department Distributed Systems Course Asst. Prof. Dr. Ahmet Sayar Kocaeli University - Fall 2014.
Small-world Overlay P2P Network

Small-world Overlay P2P Network
The Application Layer Chapter 7. Where are we now?

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.

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.

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.

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.

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.

© 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 2004-2005.

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.

1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
Intradomain Anycast for Content Centric Networks.

Intradomain Anycast for Content Centric Networks.
DNS. Outline r Domain Name System r DNS Hierarchy r Resolution.

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.

Proxy-assisted Content Sharing Using Content Centric Networking (CCN) for Resource-limited Mobile Consumer Devices Jihoon Lee, Dae Youb Kim IEEE Transactions.

Similar presentations

Ads by Google