Distributed cache updating dynamic source routing protocol ppt
Currently, STAR operates on top of IP, just like an Internet routing protocol does.
On-demand routing protocols differ on the specific mechanisms used to disseminate flood-search packets and their responses, cache the information heard from other nodes' searches, determine the cost of a link, and determine the existence of a neighbor.
To describe STAR, the topology of a network is modeled as a directed graph G = (V, E), where V is the set of nodes and E is the set of edges connecting the nodes.
Each node has a unique identifier and represents a router with input and output queues updated according to a FIFO policy.
Accordingly, we map a physical broadcast link connecting multiple nodes into multiple point-to-point bidirectional links defined for these nodes.
A functional bidirectional link between two nodes is represented by a pair of edges, one in each direction and with a cost associated that can vary in time but is always positive.