1. ECE 544 Project3 Parishad Karimi Mehrnaz Tavan Sai Teja Lingam

2. Assumptions Each host is aware of the unique file ID to associate with each content file Each host/router knows the addresses of its immediate neighbors The distance between adjacent nodes is 1 There are no router failures

3. Address Scheme Naming scheme and eventual address scheme End hosts flat naming 0,1,…,255 Content ID’s are C0,C1,…, C255

4. Packet sizes and Formats Payload Source AddressMessage Type TTL HLenPcktLength Options( Destination Address, flags)

5. Bootstrapping and Discovery Algorithm Hosts subscribe to network by sending a subscription packet containing HostID and the ContentID’s of their content to its neighboring router Routers broadcast (HostID, ContentID) to all the other routers  content table updated at each router  hop by hop ARQ scheme Routers run distance vector algorithm  routing tables created

6. Baseline Algorithm Content routing algorithm Insertion or deletion of files: the host will inform the neighboring router about the update Neighboring router updates its content table and broadcasts the update to all the routers. Host disconnecting from network: Hosts send “I am Alive” message periodically to neighboring routers. If “I am Alive” advertisement times out, the neighboring router deletes the hosts table contents and distance vector algorithm is rerun

7. Data Transfer and Reliability Host requesting a content Each router looks up the content ID in its tables to figure out next hop until destination is reached. The destination sends the content back to the source address provided in the message header Content requests time out and Hosts send a request repeatedly, until either the content or an “unable to access” packet is received. End to end ARQ scheme

8. Types of messages: A Subscription message by a newly joined Host, containing its address and content IDs Host’s own Content IDs Host IDSubscription TTL HLenPcktLength Options

9. Types of messages: A Query message from an existing host that contains the ID of the content it requests and its address Content ID Content Requester ID Query TTL HLenPcktLength(fixed) Options

10. Types of messages: A Reply to a Query if the file exists in any of the hosts File content File owner IDReply TTL HLenPcktLength Options (content requester address)

11. Types of messages: An Update message generated by Host when a new content is added or content is removed. Content ID File owner IDUpdate TTL HLenPcktLength Options (flags for insertion or deletion)

12. Other messages: An arbitrarily timed “I’m Alive” Advertisement containing the host ID If the router cannot get access to the content (due to deletion in all the hosts, etc.) an “Unable to access the file “ msg to be sent. Update messages between routers for creating and updating their content and routing tables.

13. Appendix: Network Architecture H1 H2 H3 C1 C2 C3 R1R2R3R4 R5 Scenario 1: @host_H2: get (content_C3) Host ID’sDistanceContent ID’sNext Hop H12C1R1 H22-R5 H33C3,C2R4 Routing Table for Router R2

14. Appendix: Network Architecture H1 H2 H3 C1 C2 C3 R1R2R3R4 R5 Scenario 2: @host_H1: get (content_C2) Host ID’sDistanceContent ID’sNext Hop H12C1R1 H22C2,C3R5 H33C3,C2R3 Routing Table for Router R2

15. Appendix: Network Architecture H1 C3 Scenario 3: @host_H1: get (content_C1) H2H3 H4 C1 C2 C1

16. Thank you! Questions?