| routed.h (16009) | routed.h (17253) |
|---|---|
| 1/*- 2 * Copyright (c) 1983, 1989, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 24 unchanged lines hidden (view full) --- 33 * @(#)routed.h 8.1 (Berkeley) 6/2/93 34 */ 35 36#ifndef _ROUTED_H_ 37#define _ROUTED_H_ 38#ifdef __cplusplus 39extern "C" { 40#endif | 1/*- 2 * Copyright (c) 1983, 1989, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 24 unchanged lines hidden (view full) --- 33 * @(#)routed.h 8.1 (Berkeley) 6/2/93 34 */ 35 36#ifndef _ROUTED_H_ 37#define _ROUTED_H_ 38#ifdef __cplusplus 39extern "C" { 40#endif |
| 41#ident "$Revision: 1.7 $" | 41#ident "$Revision: 1.8 $" |
| 42 43/* 44 * Routing Information Protocol 45 * 46 * Derived from Xerox NS Routing Information Protocol 47 * by changing 32-bit net numbers to sockaddr's and 48 * padding stuff to 32-bit boundaries. 49 */ --- 98 unchanged lines hidden (view full) --- 148#define SUPPLY_INTERVAL 30 /* time to supply tables */ 149#define MIN_WAITTIME 2 /* min sec until next flash updates */ 150#define MAX_WAITTIME 5 /* max sec until flash update */ 151 152#define STALE_TIME 90 /* switch to a new gateway */ 153#define EXPIRE_TIME 180 /* time to mark entry invalid */ 154#define GARBAGE_TIME 240 /* time to garbage collect */ 155 | 42 43/* 44 * Routing Information Protocol 45 * 46 * Derived from Xerox NS Routing Information Protocol 47 * by changing 32-bit net numbers to sockaddr's and 48 * padding stuff to 32-bit boundaries. 49 */ --- 98 unchanged lines hidden (view full) --- 148#define SUPPLY_INTERVAL 30 /* time to supply tables */ 149#define MIN_WAITTIME 2 /* min sec until next flash updates */ 150#define MAX_WAITTIME 5 /* max sec until flash update */ 151 152#define STALE_TIME 90 /* switch to a new gateway */ 153#define EXPIRE_TIME 180 /* time to mark entry invalid */ 154#define GARBAGE_TIME 240 /* time to garbage collect */ 155 |
| 156/* It is good to continue advertising bad routes this long so other 157 * routers notice. This is fairly cheap, so it can be long. It 158 * should be long to combat bogus holddowns implemented by major 159 * router vendors. 160 */ 161#define POISON_TIME 120 162 163/* Do not switch to a new route for this long after a route has gone 164 * bad, to ensure that the new route is not a remanent of the old route. 165 */ 166#define HOLD_TIME (MAX_WAITTIME*2) 167 | |
| 168#ifdef __cplusplus 169} 170#endif 171#endif /* !_ROUTED_H_ */ | 156#ifdef __cplusplus 157} 158#endif 159#endif /* !_ROUTED_H_ */ |