(1) Whenever the Dijkstra algorithm (this is the algorithm used by most routing protocols, including IS-IS, to calculate the shortest path to any reachable destination) is executed on S, the system shall generate as many End System Hello protocol data unit (ESH) packets as are needed to contain the addresses of all the systems it is able to see (i.e. it is aware of, by virtue of the IS-IS routeing