Christopher Beyer Hajar Mahdavi-Doost Tony Thayil ECE 544 Project3 Christopher Beyer Hajar Mahdavi-Doost Tony Thayil

Assumptions and Address Scheme End hosts can only connect to routers Same content available at multiple end nodes Metric for selecting best host is based on number of hops Naming scheme and eventual address scheme Router – Each interface is addressed [0,1,2..] Content – Flat addressing [0-255]

Baseline Algorithm For Content Based Routing Content routing algorithm Announcement Discovery Content Delivery Content routing updates Delete Content Disconnected Host

Announcement and Discovery Each host announces their content to the network by broadcasting an announcement On receiving the announcements, each router updates its routing table and picks the best route to each content Hosts interested in the content will request their default routers to route the request to the closest content

@host_H2: announce(content_C2) @host_H3: announce(content_C2) Forwardng Table Content Interface Distance C2 2 1 H2 C2 2 C2 2 1 R1 1 C2 H3 2 H1 1 2 1 3 1 2 1 2 C2 2 3 C2 2 C2 1 3 C2 1 4 C2 2 C2 2 1 R3 R2 R4 R5

@host_H1: get(content_C2) Forwarding Table Content Interface Distance C2 2 1 H2 C2 Pending Request Table Content Incoming Interface C2 1 This entry gets deleted once the request is served 2 C2 2 1 R1 C2 1 1 C2 H3 2 H1 1 2 1 3 1 2 1 2 C2 2 3 C2 2 C2 2 C2 2 1 C2 1 C2 1 R3 R2 R4 R5

@host_H2: delete(content_C2) Forwardng Table Content Interface Distance C2 2 1 H2 C2 2 C2 2 1 R1 C2 1 4 1 C2 H3 2 H1 1 2 1 3 1 2 1 2 C2 2 3 C2 2 C2 2 C2 2 1 C2 2 4 C2 3 R3 R2 R4 R5

Data Transfer and Reliability Message Forward Announce- (Broadcast) Request- (Unicast) Reply-(Multicast) ARQ Scheme Hop-by-hop Stop-and-wait

Packet Formats Announce Delete/Request Reply Content Id – 8 bits Distance – 8 bits Type – 2 bits Delete/Request Reply Content – 1500 Bytes

Advantages and Disadvantages Easy to implement No central control required Multicast support Disadvantages Scalability - Flat addressing for Content