Алгоритми маршрутизації в мережах, Детальна інформація

if (stopint != 0) {

rip_bcast(0);

rdisc_adv();

trace_off("exiting with signal %d\n", stopint);

exit(stopint | 128);

}

/* look for new or dead interfaces */

timevalsub(&wtime, &ifinit_timer, &now);

if (wtime.tv_sec <= 0) {

wtime.tv_sec = 0;

ifinit();

rip_query();

continue;

}

/* If it is time, then broadcast our routes.

*/

if (supplier || advertise_mhome) {

timevalsub(&t2, &next_bcast, &now);

if (t2.tv_sec <= 0) {

/* Synchronize the aging and broadcast

* timers to minimize awakenings

*/

age(0);

rip_bcast(0);

/* It is desirable to send routing updates

* regularly. So schedule the next update

* 30 seconds after the previous one was

* secheduled, instead of 30 seconds after

* the previous update was finished.

* Even if we just started after discovering