* Copyright (c) 1983 Regents of the University of California.
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
* @(#)routed.h 5.1 (Berkeley) %G%
* Routing Information Protocol
* Derived from Xerox NS Routing Information Protocol
* by changing 32-bit net numbers to sockaddr's and
* padding stuff to 32-bit boundaries.
struct sockaddr rip_dst
; /* destination net/host */
int rip_metric
; /* cost of route */
u_char rip_cmd
; /* request/response */
u_char rip_vers
; /* protocol version # */
u_char rip_res1
[2]; /* pad to 32-bit boundary */
struct netinfo ru_nets
[1]; /* variable length... */
char ru_tracefile
[1]; /* ditto ... */
#define rip_nets ripun.ru_nets
#define rip_tracefile ripun.ru_tracefile
#define RIPCMD_REQUEST 1 /* want info */
#define RIPCMD_RESPONSE 2 /* responding to request */
#define RIPCMD_TRACEON 3 /* turn tracing on */
#define RIPCMD_TRACEOFF 4 /* turn it off */
char *ripcmds
[RIPCMD_MAX
] =
{ "#0", "REQUEST", "RESPONSE", "TRACEON", "TRACEOFF" };
#define HOPCNT_INFINITY 16 /* per Xerox NS */
#define MAXPACKETSIZE 512 /* max broadcast size */
* Timer values used in managing the routing table.
* Every update forces an entry's timer to be reset. After
* EXPIRE_TIME without updates, the entry is marked invalid,
* but held onto until GARBAGE_TIME so that others may
#define TIMER_RATE 30 /* alarm clocks every 30 seconds */
#define SUPPLY_INTERVAL 30 /* time to supply tables */
#define EXPIRE_TIME 180 /* time to mark entry invalid */
#define GARBAGE_TIME 240 /* time to garbage collect */