References. 네트워크프로세서를위한네트워크 QoS 아키텍쳐. (Network QoS Architecture for Network Processor) References. Content 연세대학교전기전자공학과프로세서연구실박사과정정원영

Transcription

1 이강좌는연세대학교이용석교수연구실에서제작되었으며 copyright가없으므로비영리적인목적에한하여누구든지복사, 배포가가능합니다. 연구실홈페이지에는 고성능마이크로프로세서에관련된많은강좌가있으며누구나무료로다운로드받을 수있습니다. 연세대학교전기전자공학과프로세서연구실박사과정정원영 네트워크프로세서를위한네트워크 Qo 아키텍쳐 (Network Qo Architecture for Network Processor) eferences. Zheng Wang, Bell Labs, Lucent chnology, "Internet Qo, Architectures and Mechanisms for Quality of ervice", Morgan Kaufmann Publishers,, 2 연세대학교이용석교수연구실박사과정정원영 yonglee@yonsei.ac.kr Homepage: 전화 : Network Working Group, J. Heinanen, lia Finland,. Guerin, A ingle ate Three Color Marker (IETF/ rfc2697), FC 2697, ep, eferences Content. Network Working Group, J. Heinanen, lia Finland,. Guerin, A Two ate Three Color Marker (IETF/ rfc2698)", FC 2698, ep, HJ H.Jonathan Chao, Xiaolei i Guo, "Quality of ervice Control in High-peed Networks, chapter 4 Packet checuling", John Wiley & ons, Inc, 22 What is BcN? OI 7 Layer Qo Architecture Traffic Policing Queue cheduling IEEE 82 tandard Future work 4

2 What is BcN? OI 7 Layer Example of BcN Qo Cable & Mobile Convergence Application Open API ecurity Voice & Convergence IPv6 Communication & Broadcasting Convergence IO International Organization for tandardization ITU-T International lecommunications Union lecommunication tandardization di ti ector OI Open ystem Interconnection 5 6 Block Diagram of OI 7 Layer Application Layer(7) Network Process to Application Newsgroups Web Applicatio ns File Transfer Host essions Directory ervices Network Management File ervices Host Layers(Upper Layers) Presentation Layer(6) epresentation and Encryption POP/MT P ession Layer(5) Inter host Communication POP/25 Transport Layer(4) End-to-End Connections and eliability Network Layer() Path Determination and IP Transmission Control Usenet 52 IPv6 Protocol (TCP) HTTP 8 FTP 2/2 lnet 2 DN NMP 6/62 NF 5 PC Portmapper User gram Protocol (UDP) Media Layers(Lower Layers) IPv4 Link Layer(2) MAC and LLC LIP, PPP 82.2 NAP Ethernet II Physical Layer() Media, ignal, and Binary Transmission -X, CAT IDN ADL ATM FDDI CAT -5 Coaxial Cable Layer : Physical layer eceives data packets from link layer Converts received data packet to bit streams The bit streams can be transferred by electrical or optical signals. egments Packets Frames Bits 7 8 Layer 2 : link layer Layer : Network layer -Concept of layer 2 -Concept of layer outer outer WAN outer LAN Host C Host B Host A : outer 9 2

3 Layer 4 : Transport layer General Processing of Qo TCP -Transmission Control Protocol UDP - User Protocol Packet In Classifier Marker Policer Buffer Manager Traffic Manager Queue cheduler Packet In Time out # # # ok #2 #2 ok X Classifier Packet Marker Meter Policar # Meter Dropper Dropper Policar #N Buffer Manager Q Q2 Qn haper cheduler Queue cheduler 2 Traffic Policing [] srtcm [2] srtcm ingle ate Three Color Marking trtcm Two ate Three Color Marking Parameter CI : Committed Information ate CB : Committed Burst ize EB : Excess Burst ize B : packet size 4 srtcm Algorithm Example of srtcm Precolored as GEEN & Color Blind Mode If Packet size Green = - Packet size Else if Packet size Yellow = - Packet size Else ed Precolored as YELLOW If Packet size Yellow =-Packet size Else ed Precolored as ED All ed sec 8 Assumption :ends five uncolored 55 bytes packet by.5 seconds, and 4 bytes of uncolored packets by.5 seconds from seconds past from the start. CI =6.4kbps, CB = byte, EB = 8byte sec sec 4sec sec 4 4 : Yellow : Green : ed 5 6

4 trtcm [] trtcm Algorithm Precolored as ED All ed Precolored as YELLOW If < Packet size ed Else Yellow = - Packet size Precolored as GEEN & Color Blind Mode Parameter PI : peak Information ate CI : Committed Information ate PB : Peak Burst ize CB : Committed Burst ize B : packet size 7 If < Packet size ed Else if < Packet size Yellow = - Packet size Else Green = - Packet size = - Packet size 8 Example of trtcm Queue cheduling [4] : Basic cheduler 8 Assumption : CI =6.4kbps, PI =8kbps, CB = byte, PB = 8byte sec 25 sec sec 8 5 4sec 8 5 2sec : Yellow : Green : ed FIFO - First In First Out PQ - tatic Priority Queuing - ound obin D - Deficit ound obin W Weighted ound obin DW Dynamic Weighted ound obin 9 2 FIFO : First In First Out PQ : tatic Priority Queuing A A 2 A Priority B 2 B C 4 A B 2 C C 2 A 2 A C B Packets Priority 2 Outputs C 4 C C 2 C Priority

5 : ound obin A 6 A 5 A 4 A A 2 A B 6 C 6 /6 B 5 C 5 B 4 C 4 B C B 2 C 2 B C /8 /4 C B A C 2 B 2 A 2 C B A /2 Link L D : Deficit ound obin Flow D Packet Queue 75 Packet Queue 75 ound obin Pointer ound obin Pointer 2 Deficit Counter 5 Quantum ize 5 Deficit Counter Flow D Flow D Quantum ize 5 24 W : Weighted ound obin DW : Dynamic Weighted ound obin Weight Threshold ound obin Pointer A 6 A A 4 A A 2 A 2 5 B 6 B 5 B 4 B B 2 B Counter eset Cycle C 6 C 5 A 4 C 4 B 2 A C C 2 A 2 C B A C C2 busy C 6 C 5 C 4 C C 2 C C C4 Arrival Cell Count Departure Queue cheduling [4] : Enhanced cheduler GP : Generalized Processor haring GP Generalize Processor haring WFQ Weighted Fair Queuing(Packetized GP) WF 2 Q Worst-case Fair Weighted Fair Queuing CFQ elf Clocked Fair Queuing Virtual Clock top and Go EDD Earliest Due Date B WFQ 27 GP 28 t 5

6 WFQ : Weighted Fair Queuing WF 2 Q : Worst-case Weighted Fair Queuing th packet th packet t 2 t 29 IEEE 82 tandard IEEE 82. : 82 LAN/WAN IEEE 82.2 : LLC IEEE 82. : CMA/CD access IEEE 82.4 : Bus topology IEEE 82.5 : TP (shielded twisted pair wire) IEEE 82.6 : DQDB (distributed-queue dual-bus) Type/ DA A Tag FC Length Up to 5 4 bytes Future Work Multimedia traffic MMCF(Multi-Media Media Communication Forum) Classification IETF(Internet Engineering Task Force) TPID Priority CFI VID 6 2 bits DPI(Deep Packet Inspection) TPID : Tag protocol Identifier (Typically x8, x9 or x92) 82.p priority levels ( to 7) CFI : Canonical Format Indicator : canonical MAC : non-canonical MAC Unique VLAN Identifier ( to 495) 2 6