1. ECE 544 Project 3 Content Based Routing Neelakantan Nurani Krishnan Shikha Kakkar Suja Srinivasan

2. Assumptions and Address Scheme Assumptions Each end-host can connect only to one router. Same content may be available at multiple end- hosts. The next ‘best-hop’ is selected based on the hop count – the smaller, the better. The links connecting the different network elements might be lossy (loss probability p). A host can request for multiple contents at a time.

3. Assumptions and Address Scheme Assumptions (Continued) Content locations are dynamic (they change over time). Number of hosts connected to the network and different content are both less than 255. Addressing Scheme Routers – identified as 1,2,…. End host IDs are not required in our design Content – identified with the content IDs (0-255)

4. Bootstrapping and Discovery Algorithm After boot-up, each end-host will intimate its default router about the content that it has. This information will be propagated throughout the network by the routers. When a router gets a packet with a certain Content ID for the first time, it will make an entry for that ID in its forwarding table. If a router receives an update packet for a Content ID for which it already has an entry in its forwarding table, it compares the two hop counts and chooses the one with the smaller value.

5. Bootstrapping and Discovery Algorithm (Continued) Update packets, containing information about the content of a end-host, will be sent periodically by each end-host to its default router (as content locations can change). Update packets will also be triggered when the content advertisement by a host changes (addition/deletion) Every content will have a flag which will identify whether the received content can be re-advertised by the receiver.

6. Routing Algorithm Baseline Algorithm Each router has two tables – Forwarding Table (FT) and Pending Request table (PRT). An end-host interested in a certain content sends a ‘Request Packet’ to its default router with the desired Content ID. The latter creates an entry in its PRT corresponding to this request and forwards the request based on FT. The end-host with the desired content gets the request from its default router and prepares a ‘Response Packet’ containing the Content and the Content ID.

7. Routing Algorithm Baseline Algorithm (Continued) The Request Packet propagates through the routers based on FT entries and reaches the source of the content. Example Forwarding Table Content ID Interface to send req. No. Of Hops 241 122 411 *** ***

8. Routing Algorithm Baseline Algorithm (Continued) The Response Packet propagates through the routers based on PRT entries and reaches the requesting host. Example Pending Request Table Content IDOutgoing Interface 24 15 41 ** **

9. Packets Request Packet TYPE – Type of Packet (2 bits) CONTENT ID – Uniquely identifies a content (8 bits) Response Packet TYPE – Type of Packet (2 bits) FLAG – Indicates re-advertisement (1 bit) CONTENT ID – Uniquely identifies a content (8 bits) CONTENT – Contains the actual content/payload (<1466 Bytes) TYPECONTENT ID TYPEFLAGCONTENT IDCONTENT

10. Packets (Continued) Update Packet TYPE – Type of Packet (2 bits) CONTENT ID – Uniquely identifies a content (8 bits) Number of Hops – Number of Hops to reach the Content identified by CONTENT ID (8 bits). TYPECONTENT IDNumber of Hops

11. Data Transfer and Reliability Message Forward The ‘Discovery/Update’ packets will be forwarded through all interfaces except the incoming interface. The ‘Request/Response’ packets will be forwarded based on the entries in FT & PRT. ARQ Scheme End-to-End owing to its simplicity.

12. Example Scenarios H1 H2 H3 C1 C2 C3 R1R2R3R4 R5 Scenario 2: @host_H1: get (content_C2)

13. Scenario 2: @host_H1: get (content_C2) : Forwarding Tables IDPORTHOPS C110 C222 C322 IDPORTHOPS C111 C231 C331 IDPORTHOPS C112 C221 C321 IDPORTHOPS C113 C220 C320 IDPORTHOPS C122 C210 C310 R1R2R3 R4 R5

14. Scenario 2: @host_H1: get (content_C2) : Pending Request Tables IDPORT C21 IDPORT C22 R1R2 IDPORT C21 R5