3rd Edition: Chapter 4
|
|
|
- 태조 삼
- 6 years ago
- Views:
Transcription
1 Chapter 4 Network Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete slides (including this one) and slide content to suit your needs. They obviously represent a lot of work on our part. In return for use, we only ask the following: If you use these slides (e.g., in a class) in substantially unaltered form, that you mention their source (after all, we d like people to use our book!) If you post any slides in substantially unaltered form on a www site, that you note that they are adapted from (or perhaps identical to) our slides, and note our copyright of this material. Thanks and enjoy! JFK/KWR Computer Networking: A Top Down Approach 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, April All material copyright J.F Kurose and K.W. Ross, All Rights Reserved Network Layer 4-1
2 Chapter 4: Network Layer Chapter goals: understand principles behind network layer services: routing (path selection) dealing with scale how a router works advanced topics: IPv6, mobility instantiation and implementation in the Internet Network Layer 4-2
3 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-3
4 Router 라우터에는네트웍층까지만구현됨 Network Layer 4-4
5 Routing & Forwarding 보통은구별없이사용되는용어 Routing Source 부터 Dest. 까지의 end-to-end path 를결정하는 network-wide process Forwarding Router 의 input link 에서적절한 output link 로패킷을전달하는 router-local action 라우터는라우팅프로토콜을가동하여 local forwarding table 을만들고, 패킷이입력되면이 forwarding table 을참조하여패킷을적절한출력링크로이동시킴 Network Layer 4-5
6 Forwarding Table routing algorithm value in arriving local forwarding table header value output link packet s header Network Layer 4-6
7 Connection setup 기능 특정네트웍구조에서네트웍층의 3 번째기능 ATM, frame relay, X.25 Before datagrams flow, two hosts and intervening routers establish virtual connection Routers get involved Network and transport layer cnctn service: Network: between two hosts Transport: between two processes Network Layer 4-7
8 Network service model Q: What service model for channel transporting datagrams from sender to rcvr? Example services for individual datagrams: Guaranteed delivery Guaranteed delivery with bounded delay (eg. less than 100 msec) Example services for a flow of datagrams: In-order datagram delivery Guaranteed min. bandwidth to flow Guaranteed max. Jitter Network Layer 4-8
9 Internet 의네트웍층서비스모델 Best-effort service -> No guarantee at all 패킷이전달될지가보장되지않음 패킷이순서대로전달될지보장되지않음 패킷간의시간간격이유지될지보장되지않음 Network Layer 4-9
10 Network layer service models: Network Architecture Service Model Bandwidth Guarantees? Loss Order Timing Congestion feedback Internet ATM ATM ATM ATM best effort CBR VBR ABR UBR none constant rate guaranteed rate guaranteed minimum none no yes yes no no no yes yes yes yes no yes yes no no no (inferred via loss) no congestion no congestion yes no Network Layer 4-10
11 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-11
12 Network layer connection and connection-less service Datagram network provides network-layer connectionless service Virtual Circuit network provides networklayer connection service Transport 층에서의서비스와다른점 : Host-to-host service to transport layer Transport 층에서는 process-to-process service to application layer Network 층은둘중한가지서비스만제공 라우터와 end system 에구현 Transport 층에서는 end system 에서만구현 Network Layer 4-12
13 Virtual circuits source-to-dest path behaves much like telephone circuit Protocol: ATM, X.25 Data 를보내기전 call setup 을위한 signaling protocol ( 예 : Q.2931 for ATM) 을이용하여경로설정을하고전송이끝나면 teardown 을함 Bandwidth may be allocated Packet header 에 VC number 가적혀있음 라우터는패킷을출력링크로내보낼때 VC number 값을 forwarding table 을보고바꿔줌 이값들은 end host 간 VC 가성립될때중간라우터들의 forwarding table 에기록되어있음 Network Layer 4-13
14 VC implementation a VC consists of: 1. path from source to destination 2. VC numbers, one number for each link along path 3. entries in forwarding tables in routers along path packet belonging to VC carries VC number (rather than dest address) VC number can be changed on each link. New VC number comes from forwarding table Network Layer 4-14
15 Forwarding table VC number Forwarding table in northwest router: interface number Incoming interface Incoming VC # Outgoing interface Outgoing VC # Routers maintain connection state information! Network Layer 4-15
16 Virtual circuits: signaling protocols used to setup, maintain teardown VC used in ATM, frame-relay, X.25 not used in today s Internet Application transport network data link physical 5. Data flow begins 6. Receive data 4. Call connected 3. Accept call 1. Initiate call 2. incoming call Application Transport network data link physical Network Layer 4-16
17 Datagram networks no call setup at network layer routers: no state about end-to-end connections no network-level concept of connection packets forwarded using destination host address packets between same source-dest pair may take different paths Application transport network data link physical 1. Send data 2. Receive data Application transport network data link physical Network Layer 4-17
18 Datagram Network VC setup 과정이없이그냥데이터를보낸다 32 bit 를사용하는 IP 의경우, forwarding table 이너무커지는단점 4 billion possible entries Table 크기를줄이기위해 longest prefix matching rule 을사용 Network Layer 4-18
19 Forwarding table 4 billion possible entries Destination Address Range Link Interface through through through otherwise 3 Network Layer 4-19
20 Longest prefix matching Prefix Match Link Interface otherwise 3 Examples DA: Which interface? DA: Which interface? Network Layer 4-20
21 Datagram or VC network: why? Internet(datagram) data exchange among computers elastic service, no strict timing req. smart end systems (computers) can adapt, perform control, error recovery simple inside network, complexity at edge many link types different characteristics uniform service difficult ATM(VC) evolved from telephony human conversation: strict timing, reliability requirements need for guaranteed service dumb end systems telephones complexity inside network Network Layer 4-21
22 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-22
23 Router Architecture Overview Two key router functions: run routing algorithms/protocol (RIP, OSPF, BGP) forwarding datagrams from incoming to outgoing link Network Layer 4-23
24 Routing Processor Routing protocol 수행 Maintaining Forwarding table Performs network management functions Network Layer 4-24
25 Input Port Processing ( 주기능 : Output port 결정 ) Physical layer: bit-level reception Data link layer: e.g., Ethernet see chapter 5 Decentralized switching: given datagram dest., lookup output port using forwarding table in input port memory ( 이 table 은 routing processor 가관리하는 forwarding table 의 local copy) goal: complete input port processing at line speed queuing: if datagrams arrive faster than forwarding rate into switch fabric Network Layer 4-25
26 Line Speed Lookup is to be performed in less than the amount of time needed to receive a packet at the input port Input processing of a received packet can be completed before the next receive operation is complete Eg. OC48 input port = 2.5Gbps A packet size = 256 bytes (= 2048 bits) 2.5*10 9 / 2048 = 1.22 Million packets /sec 즉, line speed 로동작하려면초당 1.22 백만개의 table lookup 을수행필요 Network Layer 4-26
27 Three types of switching fabrics Network Layer 4-27
28 Switching Via Memory First generation routers: traditional computers with switching under direct control of CPU packet copied to system s memory speed limited by memory bandwidth (2 bus crossings per datagram) Input Port Memory Output Port System Bus Network Layer 4-28
29 Switching Via a Bus datagram from input port memory to output port memory via a shared bus bus contention: switching speed limited by bus bandwidth 1 Gbps bus, Cisco 1900: sufficient speed for access and enterprise routers (not regional or backbone) Network Layer 4-29
30 Switching Via An Interconnection Network overcome bus bandwidth limitations Banyan networks, other interconnection nets initially developed to connect processors in multiprocessor Advanced design: fragmenting datagram into fixed length cells, switch cells through the fabric. Cisco 12000: switches 60 Gbps through the interconnection network Network Layer 4-30
31 Output Ports Buffering required when datagrams arrive from fabric faster than the transmission rate Packet Scheduling is to choose among buffered (queued) datagrams for transmission Eg, FCFS, WFQ Network Layer 4-31
32 Output port queueing Packet scheduler select one of these 3 packets to output link 이 buffer 가 overflow 되면 packet loss 발생 Network Layer 4-32
33 Input Port Queuing Fabric slower than input ports combined -> queueing may occur at input queues Head-of-the-Line (HOL) blocking: queued datagram at front of queue prevents others in queue from moving forward queueing delay and loss due to input buffer overflow! win Crossbar switch Network Layer 4-33
34 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-34
35 The Internet Network layer Host, router network layer functions: Transport layer: TCP, UDP Network layer Routing protocols path selection RIP, OSPF, BGP forwarding table IP protocol addressing conventions datagram format packet handling conventions ICMP protocol error reporting router signaling Link layer physical layer Network Layer 4-35
36 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-36
37 IP datagram format IP protocol version number header length (bytes) type of data max number remaining hops (decremented at each router) upper layer protocol to deliver payload to how much overhead with TCP? 20 bytes of TCP 20 bytes of IP = 40 bytes + app layer overhead ver 16-bit identifier time to upper live layer 32 bits head. type of len service flgs length fragment offset Internet checksum 32 bit source IP address 32 bit destination IP address Options (if any) data (variable length, typically a TCP or UDP segment) total datagram length (bytes) for fragmentation/ reassembly E.g. timestamp, record route taken, specify list of routers to visit. Network Layer 4-37
38 Field 설명 대부분의 IPv4 패킷은 option 이없음 즉, 20 bytes of header IPv6 에서는 option 부분이없음 Fragmentation 의필요성 경로상에다른링크프로토콜들이사용될수있고이경우각 link 의 MTU 는다를수있다 IPv6 는 router 에서의 fragmentation 을허용안함 TTL 값 : router 에서 1 씩감소되어 0 이되면 drop 됨 Checksum 은 IP header 에대해서만계산됨 TTL 값이 router 에서 1 씩감소되므로 checksum 값은각 router 에서다시계산되어야함 TCP/UDP checksum 은전체 TCP/UDP segment 에대해계산됨 Network Layer 4-38
39 IP Fragmentation and Reassembly End host 의네트웍층에서 trasport 층으로전달하기전에 reassembly 수행 ( 일부 fragment 가 missing 된패킷은폐기 ) Network Layer 4-39
40 IP Fragmentation and Reassembly Example 4000 byte datagram MTU = 1500 bytes length =4000 ID =x fragflag =0 offset =0 One large datagram becomes several smaller datagrams 1480 bytes in data field offset = 1480/8 length =1500 length =1500 length =1040 ID =x ID =x ID =x fragflag =1 fragflag =1 fragflag =0 offset =0 offset =185 offset =370 Network Layer 4-40
41 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-41
42 IP Addressing: introduction IP address: 32-bit identifier for host & router interface 2 32 = 4 billion 개주소가능 Dotted-decimal notation (eg) interface: connection between host/router and physical link router s typically have multiple interfaces host may have multiple interfaces IP addresses associated with each interface = Network Layer 4-42
43 Subnets IP address: subnet part (high order bits) host part (low order bits) What s a subnet? 라우터의한개 interface 와그에연결된 host 들이한개의 subnet 을구성 Subnet mask: Subnet 안에서 IP 주소의공통부분 (eg) /24 (/24 notation) Leftmost 24bits define subnet address Broadcast address: To all hosts on the same subnet subnet network consisting of 3 subnets Network Layer 4-43
44 Subnets How many? Network Layer 4-44
45 Classful addressing Class A,B,C: 8-, 16-, 24-bits subnet address Class C (= /24) 2 8-2=254 hosts (2 개는특별용도 ) Class B (= /16) 65,643 hosts If you need 2,000 hosts, Class B is allocated IP 주소낭비초래 Network Layer 4-45
46 IP addressing: CIDR CIDR: Classless InterDomain Routing subnet portion of address of arbitrary length address format: a.b.c.d/x, where x is # bits in subnet portion of address subnet part /23 host part Network Layer 4-46
47 IP addressing: CIDR CIDRized address 예 a.b.c.d/21: 한기관에배정된 network prefix 해당기관에서는나머지 11 비트중 3 비트를기관내의 subnet 구조에사용하면 ( 즉, 8 개의 subnet 가능 ), host 는 8 비트를배정받으므로한 sbunet 내에는 2 8 개호스트가능 결국, host 의 subnet 주소는 a.b.c.d/24 가됨 Network Layer 4-47
48 IP addresses: how to get one? Q: How does host get IP address? hard-coded by system admin in a file Wintel: control-panel->network->configuration- >tcp/ip->properties UNIX: /etc/rc.config DHCP: Dynamic Host Configuration Protocol: dynamically get address from as server plug-and-play (more in next chapter) Network Layer 4-48
49 DHCP: Dynamic Host Configuration Protocol Goal: allow host to dynamically obtain its IP address from network server when it joins network Can renew its lease on address in use Allows reuse of addresses (only hold address while connected an on ) Support for mobile users who want to join network (more shortly) DHCP overview: host broadcasts DHCP discover msg DHCP server responds with DHCP offer msg host requests IP address: DHCP request msg DHCP server sends address: DHCP ack msg Network Layer 4-49
50 DHCP client-server scenario A DHCP server B E arriving DHCP client needs address in this network Network Layer 4-50
51 DHCP client-server scenario DHCP server: time DHCP request src: , 68 DHCP discover dest:: , 67 yiaddrr: transaction ID: 655 src : , 68 dest.: ,67 yiaddr: transaction ID: 654 DHCP offer Lifetime: 3600 secs DHCP ACK src: , 67 dest: , 68 yiaddrr: transaction ID: 654 Lifetime: 3600 secs src: , 67 dest: , 68 yiaddrr: transaction ID: 655 Lifetime: 3600 secs arriving client Network Layer 4-51
52 IP addresses: how to get one? Q: How does network get subnet part of IP addr? A: gets allocated portion of its provider ISP s address space ISP's block /20 Organization /23 Organization /23 Organization / Organization /23 Network Layer 4-52
53 Hierarchical addressing: route aggregation Hierarchical addressing allows efficient advertisement of routing information: Organization /23 Organization /23 Organization /23 Organization / Fly-By-Night-ISP ISPs-R-Us Send me anything with addresses beginning /20 Internet Send me anything with addresses beginning /16 Network Layer 4-53
54 Hierarchical addressing: more specific routes ISPs-R-Us has a more specific route to Organization 1 Organization /23 Organization /23 Organization / Organization /23 Fly-By-Night-ISP ISPs-R-Us Send me anything with addresses beginning /20 Internet Send me anything with addresses beginning /16 or /23 Network Layer 4-54
55 IP addressing: the last word... Q: How does an ISP get block of addresses? A: ICANN: Internet Corporation for Assigned Names and Numbers allocates addresses manages DNS root servers assigns domain names, resolves disputes Network Layer 4-55
56 NAT: Network Address Translation rest of Internet local network (e.g., home network) / All datagrams leaving local network have same single source NAT IP address: , different source port numbers Datagrams with source or destination in this network have /24 address for source, destination (as usual) Network Layer 4-56
57 NAT: Network Address Translation Motivation: local network uses just one IP address as far as outside word is concerned: no need to be allocated range of addresses from ISP: - just one IP address is used for all devices can change addresses of devices in local network without notifying outside world can change ISP without changing addresses of devices in local network devices inside local net not explicitly addressable, visible by outside world (a security plus). Network Layer 4-57
58 NAT: Network Address Translation Implementation: NAT router must: outgoing datagrams: replace (source IP address, port #) of every outgoing datagram to (NAT IP address, new port #)... remote clients/servers will respond using (NAT IP address, new port #) as destination addr. remember (in NAT translation table) every (source IP address, port #) to (NAT IP address, new port #) translation pair incoming datagrams: replace (NAT IP address, new port #) in dest fields of every incoming datagram with corresponding (source IP address, port #) stored in NAT table Network Layer 4-58
59 NAT: Network Address Translation 2: NAT router changes datagram source addr from , 3345 to , 5001, updates table 2 NAT translation table WAN side addr LAN side addr , , : host sends datagram to , 80 S: , 5001 D: , S: , 3345 D: , S: , 80 D: , : Reply arrives dest. address: , S: , 80 D: , : NAT router changes datagram dest addr from , 5001 to , 3345 Network Layer 4-59
60 NAT: Network Address Translation 16-bit port-number field: 60,000 simultaneous connections with a single LAN-side address! NAT is controversial: routers should only process up to layer 3 End-to-end 통신 (host간에 IP주소와 port number를변경하지않고하는통신 ) 불가능 NAT possibility must be taken into account by app designers, eg, P2P applications P2P에서는모든 peer가 client/server로동작해야하는데, NAT뒤의 peer는서버로동작불가능. NAT 외부의 peer는 NAT 내부의 peer에게자발적tcp 연결을해낼수없기때문. address shortage should instead be solved by IPv6 Network Layer 4-60
61 NAT traversal problem client wants to connect to server with address server address local to LAN (client can t use it as destination addr) only one externally visible NATted address: solution 1: statically configure NAT to forward incoming connection requests at given port to server e.g., ( , port 2500) always forwarded to port Client? NAT router Network Layer 4-61
62 NAT traversal problem solution 2: Universal Plug and Play (UPnP) Internet Gateway Device (IGD) Protocol. Allows NATted host to: learn public IP address ( ) add/remove port mappings (with lease times) i.e., automate static NAT port map configuration NAT router IGD Network Layer 4-62
63 NAT traversal problem solution 3: relaying (used in Skype) NATed client establishes connection to relay External client connects to relay relay bridges packets between to connections Client 2. connection to relay initiated by client 3. relaying established 1. connection to relay initiated by NATted host NAT router Network Layer 4-63
64 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-64
65 ICMP: Internet Control Message Protocol used by hosts & routers to communicate network-level information error reporting: unreachable host, network, port, protocol echo request/reply (used by ping ) ICMP msgs carried in IP datagrams ICMP message: type, code plus first 8 bytes of IP datagram causing error Type Code description 0 0 echo reply (ping) 3 0 dest. network unreachable 3 1 dest host unreachable 3 2 dest protocol unreachable 3 3 dest port unreachable 3 6 dest network unknown 3 7 dest host unknown 4 0 source quench (congestion control - not used) 8 0 echo request (ping) 9 0 route advertisement 10 0 router discovery 11 0 TTL expired 12 0 bad IP header Network Layer 4-65
66 Traceroute and ICMP Source 가엉뚱한 UDP port number 를가진 UDP 패킷들을발생시킴 First has TTL =1 Second has TTL=2.. nth packet has TTL=n n 번째 datagram 이 n 번째라우터에도착했을때 : TTL 이 0 이되므로라우터는이 datagram 을폐기 Source 로 ICMP warning 메시지를전송 (type 11, code 0) 이것을수신한 source 는 round trip time, n 번째라우터의 IP 주소를알게됨 실제로 Traceroute 프로그램은동일한 TTL 값을가진 UDP 패킷을 3 번보냄 Stopping criterion UDP segment eventually arrives at destination host Destination returns ICMP host unreachable packet (type 3, code 3) When source gets this ICMP, stops. Network Layer 4-66
67 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-67
68 IPv6 Initial motivation: 32-bit address space soon to be completely allocated. Additional motivation: header format helps speed processing/forwarding header changes to facilitate QoS IPv6 datagram format: fixed-length 40 byte header 중간라우터에서의 fragmentation 은허용되지않음 (source 와 dest. 에서만가능 ) Checksum field 가없어짐 Network Layer 4-68
69 IPv6 Header (Cont) Priority: identify priority among datagrams in flow Flow Label: identify datagrams in same flow. (concept of flow not well defined). Next header: identify upper layer protocol for data Network Layer 4-69
70 Other Changes from IPv4 Checksum: removed entirely to reduce processing time at each hop Options: allowed, but outside of header, indicated by Next Header field ICMPv6: new version of ICMP additional message types, e.g. Packet Too Big multicast group management functions Network Layer 4-70
71 Transition From IPv4 To IPv6 Not all routers can be upgraded simultaneous no flag days How will the network operate with mixed IPv4 and IPv6 routers? Tunneling: IPv6 carried as payload in IPv4 datagram among IPv4 routers Network Layer 4-71
72 Tunneling Logical view: A B E F tunnel IPv6 IPv6 IPv6 IPv6 Physical view: A B E F IPv6 IPv6 IPv6 IPv6 IPv4 IPv4 Network Layer 4-72
73 Tunneling Logical view: A B E F tunnel IPv6 IPv6 IPv6 IPv6 Physical view: A B C D E F IPv6 IPv6 IPv4 IPv4 IPv6 IPv6 Flow: X Src: A Dest: F data Src:B Dest: E Flow: X Src: A Dest: F Src:B Dest: E Flow: X Src: A Dest: F Flow: X Src: A Dest: F data data A-to-B: IPv6 B-to-C: IPv4 (encapsulating IPv6) data E-to-F: IPv6 B-to-C: IPv4 (encapsulating IPv6) Network Layer 4-73
74 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-74
75 Interplay between routing, forwarding routing algorithm value in arriving local forwarding table header value output link packet s header Network Layer 4-75
76 Graph abstraction 5 u v 3 w x y Graph: G = 1(N,E) 5 2 z N = set of routers = { u, v, w, x, y, z } E = set of links ={ (u,v), (u,x), (v,x), (v,w), (x,w), (x,y), (w,y), (w,z), (y,z) } Remark: Graph abstraction is useful in other network contexts Example: P2P, where N is set of peers and E is set of TCP connections Network Layer 4-76
77 Graph abstraction: costs u c(x,x ) = cost of link (x,x ) v x w y z - e.g., c(w,z) = 5 cost could always be 1, or inversely related to bandwidth, Cost of path (x or inversely related to 1, x 2, x 3,, x p ) = c(x 1,x 2 ) + c(x 2,x 3 ) + + c(x p-1,x p ) congestion Question: What s the least-cost path between u and z? Routing algorithm: algorithm that finds least-cost path Network Layer 4-77
78 Routing Algorithm classification Global or decentralized information? Global: all routers have complete topology, link cost info link state algorithms Decentralized: router knows physicallyconnected neighbors, link costs to neighbors iterative process of computation, exchange of info with neighbors distance vector algorithms Static or dynamic? Static: routes change slowly over time Dynamic: routes change more quickly periodic update in response to link cost changes Network Layer 4-78
79 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-79
80 A Link-State Routing Algorithm Dijkstra s algorithm Using global information > Centralized algorithm net topology, link costs known to all nodes accomplished via link state broadcast all nodes have same info Computing least cost paths from one node ( source ) to all other nodes gives forwarding table for that node iterative: after k iterations, know least cost path to k dest. s Problem Oscillation of list-cost path Network Layer 4-80
81 Dijsktra s Algorithm 1 Initialization: 2 N' = {u} 3 for all nodes v 4 if v adjacent to u 5 then D(v) = c(u,v) 6 else D(v) = 7 8 Loop Notation: c(x,y): link cost from node x to y; = if not direct neighbors D(v): current value of cost of path from source to dest. v p(v): predecessor node along path from source to v N': set of nodes whose least cost path definitively known 9 find w not in N' such that D(w) is a minimum 10 add w to N' 11 update D(v) for all v adjacent to w and not in N' : 12 D(v) = min( D(v), D(w) + c(w,v) ) 13 /* new cost to v is either old cost to v or known 14 shortest path cost to w plus cost from w to v */ 15 until all nodes in N' Network Layer 4-81
82 Dijsktra s Algorithm Network Layer 4-82
83 Network Layer 4-83 Dijsktra s Algorithm 6 1 Nodes y p I Permanent label
84 Dijsktra s Algorithm 6 s t Network Layer 4-84
85 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-85
86 Distance Vector Algorithm Distributed, asynchronous, iterative algorithm Bellman-ford algorithm Problem Count-to-infinity problem Network Layer 4-86
87 Distance Vector Algorithm Bellman-Ford Equation (dynamic programming) Define d x (y) := cost of least-cost path from x to y Then d x (y) = min {c(x,v) + d v (y) } where min. is taken over all neighbors of x Network Layer 4-87
88 Distance Vector Algorithm D x (y) = estimate of least cost from x to y Distance vector: D x = [D x (y): y є N ] Node x knows cost to each neighbor v: c(x,v) Node x maintains D x = [D x (y): y є N ] Node x also maintains its neighbors distance vectors For each neighbor v, x maintains D v = [D v (y): y є N ] Network Layer 4-88
89 Distance Vector Algorithm Basic idea: Each node periodically sends its own distance vector estimate to neighbors When a node x receives new DV estimate from neighbor, it updates its own DV using B-F equation: D x (y) min v {c(x,v) + D v (y)} for each node y N Under minor, natural conditions, the estimate D x (y) converge the actual least cost d x (y) Network Layer 4-89
90 Distance Vector Algorithm Iterative, asynchronous: each local iteration caused by: local link cost change DV update message from neighbor Distributed: each node notifies neighbors only when its DV changes neighbors then notify their neighbors if necessary Each node: wait for (change in local link cost of msg from neighbor) recompute estimates if DV to any dest has changed, notify neighbors Network Layer 4-90
91 Distance Vector Algorithm A B C D E F G H I J K L Dest. A B C D E F G H I J K L Delay at J Before Update Dist. Next 8 * * * * * * * * * * * * * 12 * 10 * 0-6 * * * Info. from A Dist Info. from H Dist Info. from I Dist Info. from K Dist New Estimated Delay at J Dist. Next 8 A 20 A 28 I 20 H 17 I 30 I 18 H 12 H 10 I 0-6 K 15 K Network Layer 4-91
92 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-92
93 Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice scale: with 200 million destinations: can t store all dest s in routing tables! routing table exchange would swamp links! administrative autonomy internet = network of networks each network admin may want to control routing in its own network Network Layer 4-93
94 Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice Hierarchical Routing 사용이유 Scalability 현재인터넷에는 200 million 개이상의호스트가있으므로라우팅테이블크기를줄일필요가있음 Administrative autonomy 회사의네트웍관리자는자신이관리하는라우터의라우팅프로토콜을선택권한을갖기를원함 AS 라는개념을도입하고이 AS 내에서의라우팅프로토콜선택등은해당관리자의권한하에두고, AS 간을연결하는 gateway 라우터간의프로토콜은별도로정함 Network Layer 4-94
95 Hierarchical Routing aggregate routers into regions, autonomous systems (AS) routers in same AS run same routing protocol intra-as routing protocol routers in different AS can run different intra- AS routing protocol Gateway router Direct link to router in another AS Network Layer 4-95
96 Hierarchical Routing Network Layer 4-96
97 AS 내부의라우터가 AS 외부의목적지로패킷을보내야할경우 (Case 1) AS 가한개의 gateway 라우터를가진경우 각내부라우터는 AS 가사용하는 intra-as 라우팅알고리즘을사용하여 gateway 라우터까지의최단경로를결정하고이경로로패킷을보내면됨. Network Layer 4-97
98 AS 내부의라우터가 AS 외부의목적지로패킷을보내야할경우 (Case 2) 한 AS 에두개의 gateway 가있으나목적지로의 gateway 라우터는한개인경우 ( 예 :AS1 의 1d 가외부로보내려할때 AS3 를경유해서만가능한경우 ) Inter-AS 라우팅프로토콜사용 1 AS1 learns from the inter-as protocol that subnet x is reachable from AS3 (gateway 1c) but not from AS2 2 Inter-AS protocol propagates reachability info to all internal routers in AS1. Intra-AS 라우팅프로토콜사용 3 Router 1d determines from intra-as routing info that its interface I is on the least cost path to 1c. 4 라우터 1d puts in forwarding table entry (x,i) Network Layer 4-98
99 AS 내부의라우터가 AS 외부의목적지로패킷을보내야할경우 (Case 3) 한 AS 에두개의 gateway 가있으며, 이둘중어느것을통해서도목적지로갈수있는경우 ( 예 :AS1 의 1d 가외부로보내려할때 AS3 및 AS2 를경유해서도가능한경우 ) Hot-potato routing 사용가능 뜨거운감자를가능한한빨리넘겨버리는방식 두개의라우터중가장가까운곳으로패킷을넘김 ( 예 : hot-potato routing running on 1d) Inter-AS 라우팅프로토콜로부터목적지가 AS2 및 AS3 를경유해서도가능하다고파악 Intra-AS 라우팅프로토콜을이용하여 AS2 로의 gateway 라우터 1b, AS3 로의 gateway 라우터 1c 로의경로를파악 Hot-potato routing 은이중 least-cost path 선택 Network Layer 4-99
100 AS 내부의라우터가 AS 외부의목적지로패킷을보내야할경우 (Case 3) Learn from inter-as protocol that subnet x is reachable via multiple gateways Use routing info from intra-as protocol to determine costs of least-cost paths to each of the gateways Hot potato routing: Choose the gateway that has the smallest least cost Determine from forwarding table the interface I that leads to least-cost gateway. Enter (x,i) in forwarding table Network Layer 4-100
101 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-101
102 Intra-AS Routing Also known as Interior Gateway Protocols (IGP) Most common Intra-AS routing protocols: RIP: Routing Information Protocol OSPF: Open Shortest Path First IGRP: Interior Gateway Routing Protocol (Cisco proprietary) Network Layer 4-102
103 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-103
104 RIP Version 1 (RFC 1058), Version 2 (RFC 2453) RIP advertisement sent over UDP Port number 520 Network Layer 4-104
105 RIP advertisements Cost metric: hop count ( 거쳐야되는 subnet 갯수 ) Max. cost: 15 (16= ) Routing table is exchanged among neighbors every 30 sec via Response Message (also called advertisement) Each advertisement: list of up to 25 destination subnets within AS If no advertisement heard after 180 sec --> neighbor/link declared dead routes via neighbor invalidated Network Layer 4-105
106 RIP: Example z w x y A D B C Destination Network Next Router Num. of hops to dest. w A 2 y B 2 z B 7 x -- 1 Routing/Forwarding table in D..... Network Layer 4-106
107 RIP: Example Dest Next hops w - - x - - z C Advertisement from A to D w x y A D B z C Destination Network Next Router Num. of hops to dest. w A 2 y B 2 z B A 7 5 x Routing table in D Network Layer 4-107
108 RIP: Link Failure and Recovery If no advertisement heard after 180 sec --> neighbor/link declared dead routes via neighbor invalidated new advertisements sent to neighbors neighbors in turn send out new advertisements (if tables changed) link failure info quickly (?) propagates to entire net poison reverse used to prevent ping-pong loops (infinite distance = 16 hops) Network Layer 4-108
109 RIP Table processing RIP routing tables managed by application-level process called route-d (daemon) advertisements sent in UDP packets, periodically repeated routed routed Transprt (UDP) Transprt (UDP) network (IP) forwarding table forwarding table network (IP) link link physical physical Network Layer 4-109
110 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-110
111 OSPF (Open Shortest Path First) open : publicly available uses Link State algorithm LS packet dissemination topology map at each node route computation using Dijkstra s algorithm OSPF advertisement carries one entry per neighbor router advertisements disseminated to entire AS (via flooding) carried in OSPF messages directly over IP (rather than TCP or UDP Network Layer 4-111
112 OSPF advanced features (not in RIP) Security: all OSPF messages authenticated (to prevent malicious intrusion) MD5 Multiple same-cost paths allowed (only one path in RIP) For each link, multiple cost metrics for different TOS (e.g., satellite link cost set low for best effort; high for real time) Integrated uni- and multicast support: Multicast OSPF (MOSPF) uses same topology data base as OSPF Hierarchical OSPF in large domains. Network Layer 4-112
113 Hierarchical OSPF BGP 별도 OSPF 동작 별도 OSPF 동작 별도 OSPF 동작 별도 OSPF 동작 Network Layer 4-113
114 Hierarchical OSPF Two-level hierarchy: local area, backbone. Link-state advertisements only in area each nodes has detailed area topology; only know direction (shortest path) to nets in other areas. Area border routers: summarize distances to nets in own area, advertise to other Area Border routers. Backbone routers: run OSPF routing limited to backbone. Boundary routers: connect to other AS s. Network Layer 4-114
115 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-115
116 Internet inter-as routing: BGP BGP (Border Gateway Protocol): the de facto standard Semi-permanent TCP connection (port 179) 각 AS 는이웃 AS 를통하면어느목적지에도달할수있을지를알게됨 직접연결된두개의 AS 간의 gateway 라우터들은자신의 AS 로부터도달가능한 prefix list 를서로교환함 (ebgp 세션 ) Gateway 라우터는 AS 내의모든라우터들에게이 reachability 정보를알려줌 (ibgp 세션 ) allows subnet to advertise its existence to rest of Internet: I am here Network Layer 4-116
117 경로정보전달과정 3a 는 AS3 에서도달가능한 prefix 들을 1c 에알려줌 (ebgp 세션 ). 이때 prefix 와같이가는 AS-PATH attribute 는 AS3 로적힘 1c 는 AS1 내부의라우터들에게이정보를알려줌 (ibgp 세션 ) 이중 1b 는 AS2 와연결되어있으므로, 이정보를 2a 에게도알려줌 (ebgp 세션 ). 이때 AS-PATH attribute 는 AS3AS1 으로적힘. Network Layer 4-117
118 Path attributes & BGP routes When advertising a prefix, advertisement includes BGP attributes. a route = a prefix + attributes Two important attributes: AS-PATH: contains the ASs through which the advert for the prefix passed: AS 67 AS 17 NEXT-HOP: gateway router 간 multiple link 가있을때특정링크를선택가능하도록, gateway router 의특정 link 에부여된 IP 주소를줌 When gateway router receives route advert, uses import policy to accept/decline. Network Layer 4-118
119 BGP route selection 동일한 prefix 로 2 개이상의경로가있을떄선택하는 rule Elimination rules: 1. Local preference 값 () 이높은경로선택 Local preference 값 = router 가설정하는 attribute 2. AS-PATH 가짧은경로선택 3. NEXT-HOP 이가장가까운 (least cost) 경로선택 : hot potato routing Network Layer 4-119
120 BGP messages BGP messages exchanged using TCP. BGP messages: OPEN: opens TCP connection to peer and authenticates sender UPDATE: advertises new path (or withdraws old) KEEPALIVE keeps connection alive in absence of UPDATES; also ACKs OPEN request NOTIFICATION: reports errors in previous msg; also used to close connection Network Layer 4-120
121 BGP routing policy B legend: provider network W A C X customer network: Y A,B,C are provider networks Figure 4.5-BGPnew: a simple BGP scenario X,W,Y are customer (of provider networks); stub net. X is dual-homed: attached to two networks X 는 ISP 간의 transit traffic 을경유시키기를원치않음 따라서, X 는 C 로가는경로가있다고 B 로광고하지않으며, B 로가는경로가있다고 C 로광고하지않음 Network Layer 4-121
122 BGP routing policy (2) B legend: provider network W A C X customer network: Y Figure 4.5-BGPnew: a simple BGP scenario A advertises to B the path AW B advertises to X the path BAW Should B advertise to C the path BAW? No way! B gets no revenue for routing CBAW since neither W nor C are B s customers B wants to force C to route to W via A B wants to route only to/from its customers! Network Layer 4-122
123 Why different Intra- and Inter-AS routing? Policy: AS 간의연결 (Inter-AS) 에서는 policy issue 가 dominate 할수있음 즉, 성능보다는 policy 에따라라우팅을결정한다. Scale: hierarchical routing saves table size, reduced update traffic Performance: AS 내부 (Intra-AS) 에서는 performance 가중요 Network Layer 4-123
124 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Network Layer 4-124
125 Broadcast Routing deliver packets from source to all other nodes source duplication is inefficient: duplicate R1 duplicate creation/transmission R1 R2 R2 duplicate R3 R4 R3 R4 source duplication in-network duplication source duplication: how does source determine recipient addresses? Network Layer 4-125
126 Broadcasting 방법 Flooding: when node receives brdcst pckt, sends copy to all neighbors Problems: cycles & broadcast storm Controlled flooding: node only brdcsts pkt if it hasn t brdcst same packet before (sequence number controlled flooding) Node keeps track of pckt ids already brdcsted Or reverse path forwarding (RPF): only forward pckt if it arrived on shortest path between node and source Spanning tree broadcasting No redundant packets received by any node Network Layer 4-126
127 Uncontrolled flooding 노드가패킷을수신시, 방금보낸노드를제외한모든이웃노드들에게복사해서보냄 문제점 Each broadcast packet will cycle indefinitely Broadcast storm 발생 각패킷의수많은복사본발생 Network Layer 4-127
128 Sequence number controlled flooding 노드가 broadcast 패킷을전송시 sequence number 를적어서보냄 노드는수신된 broadcast packet 의 source node 주소와 sequence number 를기록한 list 유지 어느 broadcast 패킷을수신시 list 에있는값과일치하면폐기, 아니면 list 에기록하고이웃노드들로 flooding 시킴 ( 예 ) Gnutella; overlay network 에서수행 Network Layer 4-128
129 Reverse Path Forwarding(RPF) B 는 A 로부터 source S 가보낸패킷수신시, B 로부터 S 까지의 shortest path 에 BA link 가속해있으면이웃노드 C, D 로 flooding 시킴, 아니면 discard 함 S (Source) A c A B B F E D C D G Network Layer 4-129
130 Reverse Path Forwarding(RPF) ( 예 ) Source=A A c B F E D G Network Layer 4-130
131 Spanning Tree First construct a spanning tree Nodes forward copies only along spanning tree A A c B c B F E D F E D (a) Broadcast initiated at A G (b) Broadcast initiated at D G Network Layer 4-131
132 Spanning Tree: Creation Center node (rendezvous point, core) 선정 Each node sends unicast join message to center node Message forwarded until it arrives at a node already belonging to spanning tree 이메시지가이동한경로가 spanning tree의 edge가됨 A A c 3 B c B 4 2 D D F 1 E 5 F E G G (a) Stepwise construction of spanning tree (Center 노드 = E) (b) Constructed spanning tree Network Layer 4-132
133 Sequence-number-controlled flooding 사용예 Gnutella Application-level broadcast 16-bit identifier, 16-bit payload descriptor TTL 사용 limited-scope flooding으로도불림 LSA (link-state advertisement) in OSPF 32-bit sequence number 16-bit age field; TTL과유사한역할 Network Layer 4-133
134 Multicast Mcast packet is delivered to only a subset of network nodes Internet: Class D The group of receivers associated with a class D address is referred to as a multicast group 호스트의 IP 주소 (unicast를위한주소 ) 는이 mcast IP 주소와는별개 ( 즉, 이두주소간에는연관성이없다 ) 네트웍층의 Multicast routing protocol IGMP, DVMRP, PIM, etc Network Layer 4-134
135 Multicast 4 node(green) has unicast IP, mcast IP 주소 Unicast address Network Layer 4-135
136 IGMP Internet Group Management Protocol IGMP 는 edge router 와연결된 host 간에만동작하는국지적프로토콜 이러한 edge router 들을포함한라우터들간에는별도의 multicast routing 프로토콜이필요함 PIM, DVMRP, MOSPF 등을사용 어느호스트가특정멀티캐스트그룹에속해있다고할때, 자신이속한 local net. 외부에 ( 즉, networkwide) 그특정멀티캐스트그룹에속한다른호스트를알아낼수없다. Network Layer 4-136
137 IGMP PIM, DVMRP, MOSPF Network Layer 4-137
138 IGMP 메시지 format Membership_query 메시지 Membership_report 메시지 Leave_group 메시지 Network Layer 4-138
139 IGMP 동작 1. 라우터는연결된호스트들중어느특정멀티캐스트그룹에속한호스트가어느것인지알기위해 membership_query 메시지발생 ( 그안에그특정멀티캐스트그룹주소를적어놓는다 ) 2. 라우터는연결된호스트들이속해있는멀티캐스트그룹들을다알기위해 membership_query 메시지발생 ( 이경우에는특정멀티캐스트그룹주소는적지않음 ) 3. 라우터는특정멀티캐스트그룹에속한호스트가하나도안남아있는지아닌지를확인하기위해 membership_query 메시지발생 ( 이경우에는특정멀티캐스트그룹주소를적어놓음 ) 1,2,3의경우에호스트는 membership_report 메시지로답함 (3의경우에아무도답하지않으면라우터는해당멀티캐스트그룹에속한호스트가더이상존재하지않는다고판단 Soft state) Network Layer 4-139
140 IGMP 동작 4. 호스트가특정멀티캐스트그룹에 join 하고싶으면연결된라우터에게 membership_report 메시지전송 ( 이안에그특정멀티캐스트그룹주소를적어놓는다 ) 즉, 멀티캐스트패킷의 sender 는해당그룹에 join 하는호스트들을통제할수없다. 또한 sender 는특정호스트를해당그룹에 add 할수도없다. 5. 호스트는특정그룹에서탈퇴하고싶을때는 leave_group 메시지를라우터로보내면됨. 6. 호스트는특정 sender 로부터멀티캐스트를받는것을거부할수있다 Network Layer 4-140
141 멀티캐스트라우팅 tree 생성방법 Group-shared tree 전체네트웍에서트리한개만생성 모든 sender 들이이동일한트리사용 생성방법 Minimal spanning tree (Steiner tree)» 전체네트웍에대한정보가필요하고, 연산이복잡하고라우터가 join/leave 한다음다시트리생성이필요하여실제로는사용이안됨 Center-based approach Source-based tree 각 sender (source) 를위해별도의 tree 생성 RPF 알고리즘사용하여 tree 생성 단, 어느라우터가멀티캐스트패킷수신시자신에속한호스트들중그멀티캐스트그룹에속한호스트가하나도없는경우에는 source 로의 upstream 라우터로자신을 tree 에서제외해달라는 prune 메시지를보냄. Network Layer 4-141
142 Internet 에서의멀티캐스트라우팅 프로토콜 DVMRP (Distance-Vector Multicast Routing Protocol) RFC 1075 De facto inter-as mcast 라우팅프로토콜 Mbone 에서사용 PIM (Protocol-Independent Multicast Routing Protocol) 어느 Unicast routing protocol 과도사용가능 Dense mode & Sparse mode Network Layer 4-142
143 Internet 에서의멀티캐스트라우팅 프로토콜 한 AS 내에서는한개의멀티캐스트라우팅프로토콜을사용하지만다른 AS 에서는다른멀티캐스트라우팅프로토콜사용가능 AS 간의멀티캐스트라우팅프로토콜필요 (DVMRP 가 de facto 로사용됨 ) 멀티캐스팅은 IP 층에서제공하는라우팅프로토콜 ( 즉, IGMP+ DVMRP, PIM) 보다응용층의 overlay 네트웍에서구현되고있는것이현실 Network Layer 4-143
144 DVMRP 동작 RPF with pruning 각라우터는모든가능한 source 까지의 shortest path 를 distance vector 방법을이용하여계산해놓고있음. 또한, 각라우터는 dependent downstream 라우터들을알아놓고있음 모든 downstream 라우터들로부터해당멀티캐스트그룹에대한 prune 메시지를받을때 upstream 으로이 prune 메시지를전달한다. Network Layer 4-144
145 PIM 두개의 mode 에따라다른동작 Dense mode 어느 area 에있는많은 ( 대부분의 ) 라우터들이멀티캐스트에참여할때 group members densely packed, in close proximity bandwidth more plentiful Sparse mode 어느 area 에있는라우터들중작은수가멀티캐스트에참여할때 group members widely dispersed bandwidth not plentiful Network Layer 4-145
146 PIM Dense mode 동작 DVMRP 와유사 (RPF with pruning) Sparse mode 동작 Group-shared tree (center-based approach) source 로부터 datagram 을받은라우터는랑데뷰포인트 (RP) 로 unicast 로보냄 RP 는 group-shared tree 를이용해멀티캐스트함. 특징 : RP 를기점으로 group-shared tree 에서 source-specific tree 로전환할수있음. Network Layer 4-146
147 PIM- Dense Mode flood-and-prune RPF, similar to DVMRP but underlying unicast protocol provides RPF info for incoming datagram less complicated (less efficient) downstream flood than DVMRP reduces reliance on underlying routing algorithm has protocol mechanism for router to detect it is a leaf-node router
148 Network Layer: summary What we ve covered: network layer services routing principles: link state and distance vector hierarchical routing IP Internet routing protocols RIP, OSPF, BGP what s inside a router? IPv6 Next stop: the Data link layer! Network Layer 4-148
TCP.IP.ppt
TCP/IP TCP/IP TCP/IP TCP/IP TCP/IP Internet Protocol _ IP Address Internet Protocol _ Subnet Mask Internet Protocol _ ARP(Address Resolution Protocol) Internet Protocol _ RARP(Reverse Address Resolution
Chapter11OSPF
OSPF 111 OSPF Link state Interior Gateway Protocol OSPF 1988 IETF OSPF workgroup OSPF RFC 2383 version 2 Chapter OSPF Version 2 OSPFIGP AS 1 1111 Convergence Traffic Distance Vector Link state OSPF (Flooding),
Microsoft PowerPoint - 06-IPAddress [호환 모드]
![Microsoft PowerPoint - 06-IPAddress [호환 모드]](/thumbs/84/90735609.jpg "Microsoft PowerPoint - 06-IPAddress [호환 모드]")
Chapter 06 IP Address IP Address Internet address IP 계층에서사용되는식별자 32 bit 2 진주소 The address space of IPv4 is 2 32 or 4,294,967,296 netid 와 hostid 로구분 인터넷에서호스트와라우터를유일하게구분 IP Address Structure 2-Layer Hierarchical
SMB_ICMP_UDP(huichang).PDF
SMB(Server Message Block) UDP(User Datagram Protocol) ICMP(Internet Control Message Protocol) SMB (Server Message Block) SMB? : Microsoft IBM, Intel,. Unix NFS. SMB client/server. Client server request
chapter4
Basic Netw rk 1. ก ก ก 2. 3. ก ก 4. ก 2 1. 2. 3. 4. ก 5. ก 6. ก ก 7. ก 3 ก ก ก ก (Mainframe) ก ก ก ก (Terminal) ก ก ก ก ก ก ก ก 4 ก (Dumb Terminal) ก ก ก ก Mainframe ก CPU ก ก ก ก 5 ก ก ก ก ก ก ก ก ก ก
Network seminar.key
Intro to Network .. 2 4 ( ) ( ). ?!? ~! This is ~ ( ) /,,,???? TCP/IP Application Layer Transfer Layer Internet Layer Data Link Layer Physical Layer OSI 7 TCP/IP Application Layer Transfer Layer 3 4 Network
bn2019_2
arp -a Packet Logging/Editing Decode Buffer Capture Driver Logging: permanent storage of packets for offline analysis Decode: packets must be decoded to human readable form. Buffer: packets must temporarily
Switching
Switching 강의의목표 Switching/Switching Network의필요성을이해한다. 세가지대표적교환기술에열거하고그차이를설명할수있다. 각교환기술의장, 단점을비교하여설명할수있다. Packet Switching 에서 Fairness 문제와 Pipelining 을 패킷크기와연계하여설명할수있다. Soft Switch 개념을이해하고설명할수있다. 교재 Chapter
슬라이드 제목 없음
2006-09-27 경북대학교컴퓨터공학과 1 제 5 장서브넷팅과슈퍼넷팅 서브넷팅 (subnetting) 슈퍼넷팅 (Supernetting) 2006-09-27 경북대학교컴퓨터공학과 2 서브넷팅과슈퍼넷팅 서브넷팅 (subnetting) 하나의네트워크를여러개의서브넷 (subnet) 으로분할 슈퍼넷팅 (supernetting) 여러개의서브넷주소를결합 The idea
UDP Flooding Attack 공격과 방어
황 교 국 (fullc0de@gmail.com) SK Infosec Co., Inc MSS Biz. Security Center Table of Contents 1. 소개...3 2. 공격 관련 Protocols Overview...3 2.1. UDP Protocol...3 2.2. ICMP Protocol...4 3. UDP Flood Test Environment...5
歯최덕재.PDF
ISP Monitoring Tool OSPF SNMP, Metric MIB OSPFECMP 1 11 [6], Metric ISP(Internet Service Provider) Monitoring Tool, [5] , (Network Management System) SNMP ECMP Cost OSPF ECMP IGP(Interior Gateway Protocol)
Microsoft Word doc
TCP/IP 구조 1. I.P 구조설명 2. ARP 구조설명 3. TCP 구조설명 4. UDT 구조설명 5. RIP 구조설명 6. BOOTP 구조설명 7. TFTP 구조설명 destination addr source addr type data CRC 6 6 2 46-1500 4 type 0X0800 IP datagram 2 46-1500 type 0X0806
BGP AS AS BGP AS BGP AS 65250
BGP AS 65000 AS 64500 BGP AS 65500 BGP AS 65250 0 7 15 23 31 BGP Message 16byte Marker 2byte Length, 1byte Type. Marker : BGP Message, BGP Peer.Message Type Open Marker 1.. Length : BGP Message,
歯I-3_무선통신기반차세대망-조동호.PDF
KAIST 00-03-03 / #1 1. NGN 2. NGN 3. NGN 4. 5. 00-03-03 / #2 1. NGN 00-03-03 / #3 1.1 NGN, packet,, IP 00-03-03 / #4 Now: separate networks for separate services Low transmission delay Consistent availability
슬라이드 1
DHCP (Dynamic Host Configuration Protocol) Oct 2006 Technical Support Div. Tel : 031-739-6800 Mail : support@corecess.com DHCP Motivations Automatic network configuration for clients No administrator intervention
TTA Verified : HomeGateway :, : (NEtwork Testing Team)
TTA Verified : HomeGateway :, : (NEtwork Testing Team) : TTA-V-N-05-006-CC11 TTA Verified :2006 6 27 : 01 : 2005 7 18 : 2/15 00 01 2005 7 18 2006 6 27 6 7 9 Ethernet (VLAN, QoS, FTP ) (, ) : TTA-V-N-05-006-CC11
DBPIA-NURIMEDIA
논문 10-35-03-03 한국통신학회논문지 '10-03 Vol. 35 No. 3 원활한 채널 변경을 지원하는 효율적인 IPTV 채널 관리 알고리즘 준회원 주 현 철*, 정회원 송 황 준* Effective IPTV Channel Control Algorithm Supporting Smooth Channel Zapping HyunChul Joo* Associate
°í¼®ÁÖ Ãâ·Â
Performance Optimization of SCTP in Wireless Internet Environments The existing works on Stream Control Transmission Protocol (SCTP) was focused on the fixed network environment. However, the number of
Chapter 18 - William Stallings, Data and Computer Communications, 8/e
Internet Protocol (IP) v4 IP version 4 Defined in RFC 791 Two parts Specification of interface with a higher layer (TCP) Specification of actual protocol format and mechanisms Will (eventually) be replaced
로봇SW교육원 강의자료
UNIT 01 컴퓨터네트워크소개 광운대학교로봇학부 최용훈 학습목표 2 컴퓨터네트워크와인터넷에대한전반적인이해를한다. 본과목에서사용할용어들에대해서살펴본다. 다양한전송매체를알아본다. 네트워크에서사용하는성능지표들을살펴본다. 본과목에서사용하는교재 3 주교재 Jim Kurose and Keith Ross, Computer Networking: A Top Down Approach,
1217 WebTrafMon II
(1/28) (2/28) (10 Mbps ) Video, Audio. (3/28) 10 ~ 15 ( : telnet, ftp ),, (4/28) UDP/TCP (5/28) centralized environment packet header information analysis network traffic data, capture presentation network
Subnet Address Internet Network G Network Network class B networ
Structure of TCP/IP Internet Internet gateway (router) Internet Address Class A Class B Class C 0 8 31 0 netid hostid 0 16 31 1 0 netid hostid 0 24 31 1 1 0 netid hostid Network Address : (A) 1 ~ 127,
Page 2 of 6 Here are the rules for conjugating Whether (or not) and If when using a Descriptive Verb. The only difference here from Action Verbs is wh
Page 1 of 6 Learn Korean Ep. 13: Whether (or not) and If Let s go over how to say Whether and If. An example in English would be I don t know whether he ll be there, or I don t know if he ll be there.
USB USB DV25 DV25 REC SRN-475S REC SRN-475S LAN POWER LAN POWER Quick Network Setup Guide xdsl/cable Modem PC DVR 1~3 1.. DVR DVR IP xdsl Cable xdsl C
USB USB DV25 DV25 REC SRN-475S REC SRN-475S LAN POWER LAN POWER Quick Network Setup Guide xdsl/cable Modem PC DVR 1~3 1.. DVR DVR IP xdsl Cable xdsl Cable PC PC Step 1~5. Step, PC, DVR Step 1. Cable Step
歯김병철.PDF
3G IETF byckim@mission.cnu.ac.kr kckim@konkuk.ac.kr Mobile IP WG Seamoby WG ROHC WG 3G IETF 3G IETF Mobile IP WG 3GIP Seamoby WG ROHC WG MIP WG / NAI Mobile IP / AAA IPv4 / MIP WG RFC2002bis MIPv6 INRIA
Microsoft PowerPoint - ch03ysk2012.ppt [호환 모드]
![Microsoft PowerPoint - ch03ysk2012.ppt [호환 모드]](/thumbs/101/150466693.jpg "Microsoft PowerPoint - ch03ysk2012.ppt [호환 모드]")
전자회로 Ch3 iode Models and Circuits 김영석 충북대학교전자정보대학 2012.3.1 Email: kimys@cbu.ac.kr k Ch3-1 Ch3 iode Models and Circuits 3.1 Ideal iode 3.2 PN Junction as a iode 3.4 Large Signal and Small-Signal Operation
0. 들어가기 전
7 장. IP 프로토콜의 이해 (2) - 라우팅 컴퓨터네트워크 1 이번시간의학습목표 라우팅기능을이해하고관련프로토콜을알아본다. 간단한라우팅프로토콜 거리-벡터프로토콜 RIP(Routing Information Protocol) 링크상태프로토콜 OSPF(Open Shortest path First) 외부라우팅프로토콜 BGP(Border Gateway Protocol)
슬라이드 제목 없음
(JTC1/SC6) sjkoh@knu.ac.kr JTC1 JTC1/SC6/WG7 ECTP/RMCP/MMC (JTC1/SC6) 2/48 JTC1 ISO/IEC JTC1 Joint Technical Committee 1 ( ) ISO/TC 97 ( ) IEC/TC 83 ( ) Information Technology (IT) http://www.jtc1.org
¹Ìµå¹Ì3Â÷Àμâ
MIDME LOGISTICS Trusted Solutions for 02 CEO MESSAGE MIDME LOGISTICS CO., LTD. 01 Ceo Message We, MIDME LOGISTICS CO., LTD. has established to create aduance logistics service. Try to give confidence to
Microsoft PowerPoint - tem_5
2014 년도 1 학기 (961805-501) 컴퓨터네트워크 2014.04.30 장문정 (cathmjang@gmail.com) 홍익대학교게임소프트웨어전공 네트워크계층 이장의목표 : 네트워크계층서비스에대한기본원리를이해 네트워크계층서비스모델 포워딩 (forwarding) vs. 라우팅 (routing) 네트워크계층프로토콜 : IP, DHCP, ICMP 등 라우팅알고리즘
PWR PWR HDD HDD USB USB Quick Network Setup Guide xdsl/cable Modem PC DVR 1~3 1.. DVR DVR IP xdsl Cable xdsl Cable PC PC DDNS (
PWR PWR HDD HDD USB USB Quick Network Setup Guide xdsl/cable Modem PC DVR 1~3 1.. DVR DVR IP xdsl Cable xdsl Cable PC PC DDNS (http://ddns.hanwha-security.com) Step 1~5. Step, PC, DVR Step 1. Cable Step
Microsoft PowerPoint - 2.Catalyst Switch Intrastructure Protection_이충용_V1 0.ppt [호환 모드]
![Microsoft PowerPoint - 2.Catalyst Switch Intrastructure Protection_이충용_V1 0.ppt [호환 모드]](/thumbs/74/69694488.jpg "Microsoft PowerPoint - 2.Catalyst Switch Intrastructure Protection_이충용_V1 0.ppt [호환 모드]")
Catalyst Switch Infrastructure Protection Cisco Systems Korea SE 이충용 (choolee@cisco.com) Overview DoS (Denial of Service) 공격대상 - Server Resource - Network Resource - Network devices (Routers, Firewalls
[ 네트워크 1] 3 주차 1 차시. IPv4 주소클래스 3 주차 1 차시 IPv4 주소클래스 학습목표 1. IP 헤더필드의구성을파악하고요약하여설명할수있다. 2. Subnet ID 및 Subnet Mask 를설명할수있고, 각클래스의사용가능한호스트수와사설 IP 주소및네트
![[ 네트워크 1] 3 주차 1 차시. IPv4 주소클래스 3 주차 1 차시 IPv4 주소클래스 학습목표 1. IP 헤더필드의구성을파악하고요약하여설명할수있다. 2. Subnet ID 및 Subnet Mask 를설명할수있고, 각클래스의사용가능한호스트수와사설 IP 주소및네트](/thumbs/96/127113107.jpg "[ 네트워크 1] 3 주차 1 차시. IPv4 주소클래스 3 주차 1 차시 IPv4 주소클래스 학습목표 1. IP 헤더필드의구성을파악하고요약하여설명할수있다. 2. Subnet ID 및 Subnet Mask 를설명할수있고, 각클래스의사용가능한호스트수와사설 IP 주소및네트")
3 주차 1 차시 IPv4 주소클래스 학습목표 1. IP 헤더필드의구성을파악하고요약하여설명할수있다. 2. Subnet ID 및 Subnet Mask 를설명할수있고, 각클래스의사용가능한호스트수와사설 IP 주소및네트워크주소와 브로드캐스트주소를설명할수있다. 학습내용 1 : IP 헤더필드구성 1. Network Layer Fields 2. IP 헤더필드의구성 1)
제20회_해킹방지워크샵_(이재석)
IoT DDoS DNS (jaeseog@sherpain.net) (www.sherpain.net) DDoS DNS DDoS / DDoS(Distributed DoS)? B Asia Broadband B Bots connect to a C&C to create an overlay network (botnet) C&C Provider JP Corp. Bye Bye!
PowerPoint 프레젠테이션
Reasons for Poor Performance Programs 60% Design 20% System 2.5% Database 17.5% Source: ORACLE Performance Tuning 1 SMS TOOL DBA Monitoring TOOL Administration TOOL Performance Insight Backup SQL TUNING
Page 2 of 5 아니다 means to not be, and is therefore the opposite of 이다. While English simply turns words like to be or to exist negative by adding not,
Page 1 of 5 Learn Korean Ep. 4: To be and To exist Of course to be and to exist are different verbs, but they re often confused by beginning students when learning Korean. In English we sometimes use the
Schedule
Chapter 9 The Internet 9.1 Introduction 9.2 IP Datagrams 9.3 Fragmentation and reassembly 9.4 IP addresses 9.5 ARP and RARP 9.6 Routing Algorithms 9.7 ICMP 9.8 QoS support 9.9 PPP link layer protocol 9.10
발표순서 v 기술의배경 v 기술의구조와특징 v 기술의장, 단점 v 기타사항 v MOFI 적용방안 2 Data Communications Lab.
Tunneled Inter-Domain Routing (TIDR) 2011-04-18 김병철, 이재용 Data Communications Lab. 발표순서 v 기술의배경 v 기술의구조와특징 v 기술의장, 단점 v 기타사항 v MOFI 적용방안 2 Data Communications Lab. 기술의배경 v 추구하고자하는정책 q 현재 BGP 라우팅프로토콜은서브넷의위치와상관없이라우팅테이블
김기남_ATDC2016_160620_[키노트].key
![김기남_ATDC2016_160620_[키노트].key](/thumbs/85/91488855.jpg "김기남_ATDC2016_160620_[키노트].key")
metatron Enterprise Big Data SKT Metatron/Big Data Big Data Big Data... metatron Ready to Enterprise Big Data Big Data Big Data Big Data?? Data Raw. CRM SCM MES TCO Data & Store & Processing Computational
歯III-2_VPN-김이한.PDF
VPN 2000. 2. 23 yihan@kt.co.kr kr VPN 2 (1) (Private WAN) ( Virtual Private Networks ) Headquarters Public Network VPN Telecommuter Branch Office Mobile Worker 3 4 VPN VPN ( ) / Outsourcing Outsourcing
SLA QoS
SLA QoS 2002. 12. 13 Email: really97@postech.ac.kr QoS QoS SLA POS-SLMS (-Service Level Monitoring System) SLA (Service Level Agreement) SLA SLA TM Forum SLA QoS QoS SLA SLA QoS QoS SLA POS-SLMS ( Service
untitled
Logic and Computer Design Fundamentals Chapter 4 Combinational Functions and Circuits Functions of a single variable Can be used on inputs to functional blocks to implement other than block s intended
DBPIA-NURIMEDIA
무선 센서 네트워크 환경에서 링크 품질에 기반한 라우팅에 대한 효과적인 싱크홀 공격 탐지 기법 901 무선 센서 네트워크 환경에서 링크 품질에 기반한 라우팅에 대한 효과적인 싱크홀 공격 탐지 기법 (A Effective Sinkhole Attack Detection Mechanism for LQI based Routing in WSN) 최병구 조응준 (Byung
Microsoft PowerPoint - MobileIPv6_김재철.ppt
Jaecheol Kim Multimedia & Communications Lab. jchkim@mmlab.snu.ac.kr 2003. 9. 8 Contents IPv4 Overview IPv6 Overview 2 MIP 의필요성 Portable Computer 이동하며사용하지않음 이동시통신연결의유지필요없음 DHCP의경우Mobile IP 필요없음 Wireless
Microsoft PowerPoint ppt
Wireless LAN 최양희서울대학교컴퓨터공학부 Radio-Based Wireless LANs Most widely used method Adv: penetrating walls and other obstacles with little attenuation. Disadv: security, interference, etc. 3 approaches: ISM
APOGEE Insight_KR_Base_3P11
Technical Specification Sheet Document No. 149-332P25 September, 2010 Insight 3.11 Base Workstation 그림 1. Insight Base 메인메뉴 Insight Base Insight Insight Base, Insight Base Insight Base Insight Windows
歯이시홍).PDF
cwseo@netsgo.com Si-Hong Lee duckling@sktelecom.com SK Telecom Platform - 1 - 1. Digital AMPS CDMA (IS-95 A/B) CDMA (cdma2000-1x) IMT-2000 (IS-95 C) ( ) ( ) ( ) ( ) - 2 - 2. QoS Market QoS Coverage C/D
ARMBOOT 1
100% 2003222 : : : () PGPnet 1 (Sniffer) 1, 2,,, (Sniffer), (Sniffer),, (Expert) 3, (Dashboard), (Host Table), (Matrix), (ART, Application Response Time), (History), (Protocol Distribution), 1 (Select
` Companies need to play various roles as the network of supply chain gradually expands. Companies are required to form a supply chain with outsourcing or partnerships since a company can not
PowerChute Personal Edition v3.1.0 에이전트 사용 설명서
PowerChute Personal Edition v3.1.0 990-3772D-019 4/2019 Schneider Electric IT Corporation Schneider Electric IT Corporation.. Schneider Electric IT Corporation,,,.,. Schneider Electric IT Corporation..
solution map_....
SOLUTION BROCHURE RELIABLE STORAGE SOLUTIONS ETERNUS FOR RELIABILITY AND AVAILABILITY PROTECT YOUR DATA AND SUPPORT BUSINESS FLEXIBILITY WITH FUJITSU STORAGE SOLUTIONS kr.fujitsu.com INDEX 1. Storage System
SRC PLUS 제어기 MANUAL
,,,, DE FIN E I N T R E A L L O C E N D SU B E N D S U B M O TIO
Microsoft PowerPoint - ch10.ppt
chapter 10. 라우팅프로토콜설정 한빛미디어 -1- 학습목표 시스코라우터의스태틱라우팅설정 시스코라우터의 RIP 설정 시스코라우터의 IGRP 설정 시스코라우터의 EIGRP 설정 시스코라우터의 OSPF 설정 한빛미디어 -2- 시스코라우터의스태틱라우팅설정 스태틱라우팅 루트 (route) / 라우팅테이블 스태틱라우팅예 [ 그림 ] 스태틱라우팅예 (1) 한빛미디어
Assign an IP Address and Access the Video Stream - Installation Guide
설치 안내서 IP 주소 할당 및 비디오 스트림에 액세스 책임 본 문서는 최대한 주의를 기울여 작성되었습니다. 잘못되거나 누락된 정보가 있는 경우 엑시스 지사로 알려 주시기 바랍니다. Axis Communications AB는 기술적 또는 인쇄상의 오류에 대해 책 임을 지지 않으며 사전 통지 없이 제품 및 설명서를 변경할 수 있습니다. Axis Communications
OPCTalk for Hitachi Ethernet 1 2. Path. DCOMwindow NT/2000 network server. Winsock update win95. . . 3 Excel CSV. Update Background Thread Client Command Queue Size Client Dynamic Scan Block Block
Sena Device Server Serial/IP TM Version
Sena Device Server Serial/IP TM Version 1.0.0 2005. 3. 7. Release Note Revision Date Name Description V1.0.0 2005-03-7 HJ Jeon Serial/IP 4.3.2 ( ) 210 137-130, : (02) 573-5422 : (02) 573-7710 email: support@sena.com
Microsoft PowerPoint - 02 IPv6 Operation.ppt [호환 모드]
![Microsoft PowerPoint - 02 IPv6 Operation.ppt [호환 모드]](/thumbs/82/85487247.jpg "Microsoft PowerPoint - 02 IPv6 Operation.ppt [호환 모드]")
Module 2 IPv6 Operation Module 2 Outline Lesson 1: IPv6 Addressing Architecture Lesson 2: Enabling IPv6 on Cisco Routers Lesson 3: Neighbor Discovery Lesson 4: Cisco IOS Software IPv6 Configuration Example
04-다시_고속철도61~80p
Approach for Value Improvement to Increase High-speed Railway Speed An effective way to develop a highly competitive system is to create a new market place that can create new values. Creating tools and
Something that can be seen, touched or otherwise sensed
Something that can be seen, touched or otherwise sensed Things about an object Weight Height Material Things an object does Pen writes Book stores words Water have Fresh water Rivers Oceans have
Microsoft PowerPoint - L4-7Switch기본교육자료.ppt
L4-7 Switch 기본교육자료 Pumpkin Networks. Inc. http://www.pumpkinnet.co.kr (Tel) 02-3280-9380 (Fax) 02-3280-9382 info@pumpkinnet.co.kr 기본개념 L4/L7 Switch 란? -2- 기본개념 - Switching & Routing Switching & Routing
step 1-1
Written by Dr. In Ku Kim-Marshall STEP BY STEP Korean 1 through 15 Action Verbs Table of Contents Unit 1 The Korean Alphabet, hangeul Unit 2 Korean Sentences with 15 Action Verbs Introduction Review Exercises
untitled
CAN BUS RS232 Line Ethernet CAN H/W FIFO RS232 FIFO IP ARP CAN S/W FIFO TERMINAL Emulator COMMAND Interpreter ICMP TCP UDP PROTOCOL Converter TELNET DHCP C2E SW1 CAN RS232 RJ45 Power
ecorp-프로젝트제안서작성실무(양식3)
(BSC: Balanced ScoreCard) ( ) (Value Chain) (Firm Infrastructure) (Support Activities) (Human Resource Management) (Technology Development) (Primary Activities) (Procurement) (Inbound (Outbound (Marketing
thesis
CORBA TMN Surveillance System DPNM Lab, GSIT, POSTECH Email: mnd@postech.ac.kr Contents Motivation & Goal Related Work CORBA TMN Surveillance System Implementation Conclusion & Future Work 2 Motivation
Chap06(Interprocess Communication).PDF
Interprocess Communication 2002 2 Hyun-Ju Park Introduction (interprocess communication; IPC) IPC data transfer sharing data event notification resource sharing process control Interprocess Communication
0125_ 워크샵 발표자료_완성.key
WordPress is a free and open-source content management system (CMS) based on PHP and MySQL. WordPress is installed on a web server, which either is part of an Internet hosting service or is a network host
개요 IPv6 개요 IPv6 주소 IPv4와공존 IPv6 전환기술 (Transition Technologies)
Module 8 IPv6 구현 개요 IPv6 개요 IPv6 주소 IPv4와공존 IPv6 전환기술 (Transition Technologies) Lesson 1: IPv6 개요 IPv6 의이점 IPv4 와 IPv6 의차이점 IPv6 주소공간 IPv6 의이점 IPv6 의이점 : 큰주소공간 계층구조적주소와라우팅인프라 Stateless 와 stateful 주소구성
Backup Exec
(sjin.kim@veritas.com) www.veritas veritas.co..co.kr ? 24 X 7 X 365 Global Data Access.. 100% Storage Used Terabytes 9 8 7 6 5 4 3 2 1 0 2000 2001 2002 2003 IDC (TB) 93%. 199693,000 TB 2000831,000 TB.
장양수
한국문학논총 제70집(2015. 8) 333~360쪽 공선옥 소설 속 장소 의 의미 - 명랑한 밤길, 영란, 꽃같은 시절 을 중심으로 * 1)이 희 원 ** 1. 들어가며 - 장소의 인간 차 2. 주거지와 소유지 사이의 집/사람 3. 취약함의 나눔으로서의 장소 증여 례 4. 장소 소속감과 미의식의 가능성 5.
歯A1.1함진호.ppt
The Overall Architecture of Optical Internet ETRI ? ? Payload Header Header Recognition Processing, and Generation A 1 setup 1 1 C B 2 2 2 Delay line Synchronizer New Header D - : 20Km/sec, 1µsec200 A
Microsoft PowerPoint - 12_name&address.ppt
최양희서울대학교컴퓨터공학부 Manual Configuration Stateful Address Configuration (i.e. from servers) BOOTP DHCPv4, DHCPv6 Stateless Autoconfiguration : IPv6 2005 Yanghee Choi 2 RARP Hardware address ---> IP address
6주차.key
6, Process concept A program in execution Program code PCB (process control block) Program counter, registers, etc. Stack Heap Data section => global variable Process in memory Process state New Running
public key private key Encryption Algorithm Decryption Algorithm 1
public key private key Encryption Algorithm Decryption Algorithm 1 One-Way Function ( ) A function which is easy to compute in one direction, but difficult to invert - given x, y = f(x) is easy - given
o o o 8.2.1. Host Error 8.2.2. Message Error 8.2.3. Recipient Error 8.2.4. Error 8.2.5. Host 8.5.1. Rule 8.5.2. Error 8.5.3. Retry Rule 8.11.1. Intermittently
歯T1-4김병철2.PDF
2. Mobile IPv6 IPv6 Mobile IPv6 1 IPv6 Sufficient Address Space 128 IPv4 : 32 Fixed IP header + Extension Processing overhead checksum (flow label) Stateless Address Auto-configuration Neighbor Discovery
○ 제2조 정의에서 기간통신역무의 정의와 EU의 전자커뮤니케이션서비스 정의의 차이점은
이동전화시장 경쟁활성화를 위한 MVNO 추진을 바라보며 김원식 1) 1. 들어가며 최근 이동전화의 무선재판매 시장 활성화 등을 위해 정보통신부가 준비한 전기통신사업 법 개정안 공청회에서 무선재판매의무제 관련규정을 둘러싸고 전문가들의 우려와 지적이 상당하였다. 우선 무선재판매 제도 도입의 배경을 살펴보자. 직접적 배경으로는 국내 이동전화 요금에 대한 이용자들의
#Ȳ¿ë¼®
http://www.kbc.go.kr/ A B yk u δ = 2u k 1 = yk u = 0. 659 2nu k = 1 k k 1 n yk k Abstract Web Repertoire and Concentration Rate : Analysing Web Traffic Data Yong - Suk Hwang (Research
hd1300_k_v1r2_Final_.PDF
Starter's Kit for HelloDevice 1300 Version 11 1 2 1 2 3 31 32 33 34 35 36 4 41 42 43 5 51 52 6 61 62 Appendix A (cross-over) IP 3 Starter's Kit for HelloDevice 1300 1 HelloDevice 1300 Starter's Kit HelloDevice
휠세미나3 ver0.4
andromeda@sparcs:/$ ls -al dev/sda* brw-rw---- 1 root disk 8, 0 2014-06-09 18:43 dev/sda brw-rw---- 1 root disk 8, 1 2014-06-09 18:43 dev/sda1 brw-rw---- 1 root disk 8, 2 2014-06-09 18:43 dev/sda2 andromeda@sparcs:/$
DE1-SoC Board
실습 1 개발환경 DE1-SoC Board Design Tools - Installation Download & Install Quartus Prime Lite Edition http://www.altera.com/ Quartus Prime (includes Nios II EDS) Nios II Embedded Design Suite (EDS) is automatically
10X56_NWG_KOR.indd
디지털 프로젝터 X56 네트워크 가이드 이 제품을 구입해 주셔서 감사합니다. 본 설명서는 네트워크 기능 만을 설명하기 위한 것입니다. 본 제품을 올바르게 사 용하려면 이 취급절명저와 본 제품의 다른 취급절명저를 참조하시기 바랍니다. 중요한 주의사항 이 제품을 사용하기 전에 먼저 이 제품에 대한 모든 설명서를 잘 읽어 보십시오. 읽은 뒤에는 나중에 필요할 때
<BCF6BDC3323030392D31385FB0EDBCD3B5B5B7CEC8DEB0D4C5B8BFEEB5B5C0D4B1B8BBF3BFACB1B85FB1C7BFB5C0CE2E687770>
... 수시연구 2009-18.. 고속도로 휴게타운 도입구상 연구 A Study on the Concept of Service Town at the Expressway Service Area... 권영인 임재경 이창운... 서 문 우리나라는 경제성장과 함께 도시화가 지속적으로 진행되어 지방 지역의 인구감소와 경기의 침체가 계속되고 있습니다. 정부의 다각 적인
Remote UI Guide
Remote UI KOR Remote UI Remote UI PDF Adobe Reader/Adobe Acrobat Reader. Adobe Reader/Adobe Acrobat Reader Adobe Systems Incorporated.. Canon. Remote UI GIF Adobe Systems Incorporated Photoshop. ..........................................................
일반적인 네트워크의 구성은 다음과 같다
W5200 Errata Sheet Document History Ver 1.0.0 (Feb. 23, 2012) First release (erratum 1) Ver 1.0.1 (Mar. 28, 2012) Add a solution for erratum 1, 2 Ver 1.0.2 (Apr. 03, 2012) Add a solution for erratum 3
sna-node-ties
Node Centrality in Social Networks Nov. 2015 Youn-Hee Han http://link.koreatech.ac.kr Importance of Nodes ² Question: which nodes are important among a large number of connected nodes? Centrality analysis
182 동북아역사논총 42호 금융정책이 조선에 어떤 영향을 미쳤는지를 살펴보고자 한다. 일제 대외금융 정책의 기본원칙은 각 식민지와 점령지마다 별도의 발권은행을 수립하여 일본 은행권이 아닌 각 지역 통화를 발행케 한 점에 있다. 이들 통화는 일본은행권 과 等 價 로 연
越 境 하는 화폐, 분열되는 제국 - 滿 洲 國 幣 의 조선 유입 실태를 중심으로 181 越 境 하는 화폐, 분열되는 제국 - 滿 洲 國 幣 의 조선 유입 실태를 중심으로 - 조명근 고려대학교 BK21+ 한국사학 미래인재 양성사업단 연구교수 Ⅰ. 머리말 근대 국민국가는 대내적으로는 특정하게 구획된 영토에 대한 배타적 지배와 대외적 자주성을 본질로 하는데, 그
Copyright 2012, Oracle and/or its affiliates. All rights reserved.,.,,,,,,,,,,,,.,...,. U.S. GOVERNMENT END USERS. Oracle programs, including any oper
Windows Netra Blade X3-2B( Sun Netra X6270 M3 Blade) : E37790 01 2012 9 Copyright 2012, Oracle and/or its affiliates. All rights reserved.,.,,,,,,,,,,,,.,...,. U.S. GOVERNMENT END USERS. Oracle programs,
Cisco SDN 3.0 DDoS DDoS Cisco DDoS Real Demo 2008 Cisco Systems, Inc. All rights reserved. 2
SDN DDoS (whchoi@cisco.com) Cisco Systems Korea 2008 Cisco Systems, Inc. All rights reserved. 1 Cisco SDN 3.0 DDoS DDoS Cisco DDoS Real Demo 2008 Cisco Systems, Inc. All rights reserved. 2 Cisco SDN 3.0
Oracle9i Real Application Clusters
Senior Sales Consultant Oracle Corporation Oracle9i Real Application Clusters Agenda? ? (interconnect) (clusterware) Oracle9i Real Application Clusters computing is a breakthrough technology. The ability
SchoolNet튜토리얼.PDF
Interoperability :,, Reusability: : Manageability : Accessibility :, LMS Durability : (Specifications), AICC (Aviation Industry CBT Committee) : 1988, /, LMS IMS : 1997EduCom NLII,,,,, ARIADNE (Alliance
김병철, 이재용 Data Communications Lab.
2011-4-18 김병철, 이재용 Data Communications Lab. 발표순서 2 Data Communications Lab. Introduction v Future Internet 의 routing 과 addressing 의새로운개념인 GLI-Split 을제안 q IP address 를 global locator, local locator, identifier
BSC Discussion 1
Copyright 2006 by Human Consulting Group INC. All Rights Reserved. No Part of This Publication May Be Reproduced, Stored in a Retrieval System, or Transmitted in Any Form or by Any Means Electronic, Mechanical,
I&IRC5 TG_08권
I N T E R E S T I N G A N D I N F O R M A T I V E R E A D I N G C L U B The Greatest Physicist of Our Time Written by Denny Sargent Michael Wyatt I&I Reading Club 103 본문 해석 설명하기 위해 근래의 어떤 과학자보다도 더 많은 노력을
Solaris Express Developer Edition
Solaris Express Developer Edition : 2008 1 Solaris TM Express Developer Edition Solaris OS. Sun / Solaris, Java, Web 2.0,,. Developer Solaris Express Developer Edition System Requirements. 768MB. SPARC
슬라이드 제목 없음
2006-11-02 경북대학교컴퓨터공학과 1 제 8 장인터넷프로토콜 : IP 데이터그램 단편화 검사합 옵션 IP 설계 IP 프로토콜 2006-11-02 경북대학교컴퓨터공학과 2 2006-11-02 경북대학교컴퓨터공학과 3 네트워크계층프로토콜 IP (Internet Protocol) TCP/UDP 세그먼트를받아서패킷별로경로선택 ICMP (Internet Control
1
라우팅프로토콜 TIP o OSPF 1. Static정보를 OSPF로재분배시 metric-type 1과 metric-type 2의차이점 Metric-type 2가 Default이며, type 2는재분배되는 OSPF External 정보의메트릭계산시 external metric만계산하며, type 1은 internal + external 메트릭을계산한다 2. OSPF
<3130C0E5>
Redundancy Adding extra bits for detecting or correcting errors at the destination Types of Errors Single-Bit Error Only one bit of a given data unit is changed Burst Error Two or more bits in the data
네트워크 안정성을 지켜줄 최고의 기술과 성능 TrusGuard는 국내 최초의 통합보안솔루션으로서 지난 5년간 약 4천여 고객 사이트에 구축 운영되면서 기술의 안정성과 성능면에서 철저한 시장 검증을 거쳤습니다. 또한 TrusGuard는 단독 기능 또는 복합 기능 구동 시
네트워크 보안도 안철수연구소입니다 통합 보안의 No.1 파트너, AhnLab TrusGuard 네트워크 환경을 수호하는 최고의 통합 보안 시스템 고성능 방화벽ㆍVPN Security 기술과 고품질 Integrated Security 기술의 강력한 결합 네트워크 안정성을 지켜줄 최고의 기술과 성능 TrusGuard는 국내 최초의 통합보안솔루션으로서 지난 5년간
Microsoft PowerPoint - IPv6-세미나.ppt
Internet Protocol Version 6 1. IPv6 Overview Version 4 와 Version 6 의 Network Layer 비교 IPv6-3 IPv6 의향상된기능 더넓어진주소공간 자동설정 (Auto-configuration) 플러그앤플레이 (Plug & Play) Renumbering 단순한헤더 Checksum 계산을하지않는다. Option
Microsoft Word Question.doc
1. Switching 1. Frame-relay 구성 PVC만을사용할수있으며어떠한 Dynamic Circuit도허용되지않는다. FR 구간을설정하시오 A. R3, R4, R5를제외한나머지 Router에서는 Sub interface를사용할수없다. B. R4, R5는 FR point-to-point로구성하고, R3는 multipoint로구성하되반드시 subinterface를이용하여구성하시오.