|
sourceRoute[20]; // Route array
unsigned char curPtr; // Current position
int ttl; // ttl
char data[MAX_DATA]; // node addr array
}RoutePacket;
graph Graph;
void Init_Graph();
void Reset_Graph();
void Destroy_Graph();
void Insert_Edge(int index, int nodedata);
FILE *Load_Fi
|
|
|
routing
1.1.1.2. Basic for DSDV
1.1.1.3. Routing Table (DSDV)
1.1.1.4. Route Advertisements
1.1.1.5. Route Selection
1.1.1.6. DSDV Operation
1.1.1.7. Conclusion
1.1.2. DSR ( Dynamic Source Routing )
1.1.2.1. Basic for DSR
1.1.2.2. Route Discovery
1.1.2.3. DSR Operation
1.1.2.4. Route Main
|
|
|
Source ACL
Standard ACL
Question 44: 1 (3)
How can a router learn a path to a destination?
경로결정을 학습할수있는 라우터는 머냐?
ARP tables
DNS entries
*Dynamic routing
Temporary routing
Question 45: (3)
What is used by distance-vector routing protocols?
distance-vector라우팅 프로토콜에
|
|
|
Log & 시간 설정
1-9. Routing
1-10. Default Routing
1-11. Static Routing
1-12. PPP와 Frame Relay
1-13. Dynamic Routing
1-14. Firewall Router
1-15. Access List
1-16. Extended IP Access-list
1-17. ETC
1-18. ETC2
1-19. SNMP 보안문제와 필터링법
2-1. Catalyst Switch Password 복구 방법
|
|
|
Static Routes
개요
Dynamic Routing Protocol을 사용하지 않고 경로를 설정하는 User defined route
주요 특징
Unidirectional static Route
특정 Destination 네트워크로 가기 위해 라우터의 인터페이스를 지정
Dynamic Routing protocol에 비해 CPU 및 Memory 요구사항이 적
|
|
 |
n the dynamic research community at UNIST is a source of great excitement.
My decision to pursue graduate studies in Physics at UNIST is driven by a profound passion for physics, a desire to contribute to transformative research, and a commitment to the interdisciplinary exploration of fundamental p
|
|
 |
scripts (C-Shell, TcL, Perl, MS ActiveX, NS Javascript, ODBC, Sun Java)
Programs (Servlets & Applets)
Links (URLs)
Web Driving Up Demands on Publishers
Multiple Audiences
Multiple Authors
Daily Updates
Dynamic Generation
Performance & Quality
Accountability
More, More, Mor
|
|
메뉴펼치기
