<x:xmpmeta tsc:version="2.0.1" xmlns:x="adobe:ns:meta/" xmlns:tsc="http://www.techsmith.com/xmp/tsc/">
   <rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:xmp="http://ns.adobe.com/xap/1.0/" xmlns:xmpDM="http://ns.adobe.com/xmp/1.0/DynamicMedia/" xmlns:xmpG="http://ns.adobe.com/xap/1.0/g/" xmlns:xmpMM="http://ns.adobe.com/xap/1.0/mm/" xmlns:tscDM="http://www.techsmith.com/xmp/tscDM/" xmlns:tscIQ="http://www.techsmith.com/xmp/tscIQ/" xmlns:tscHS="http://www.techsmith.com/xmp/tscHS/" xmlns:stDim="http://ns.adobe.com/xap/1.0/sType/Dimensions#" xmlns:stFnt="http://ns.adobe.com/xap/1.0/sType/Font#" xmlns:exif="http://ns.adobe.com/exif/1.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
      <rdf:Description dc:date="2018-02-02 01:00:06 AM" dc:source="Camtasia,9.1.1,enu" dc:title="m_04dce3" tscDM:firstFrame="m_04dce3_First_Frame.png" tscDM:originId="DB526C3B-BED1-4DC9-80E8-87E2184558E4" tscDM:project="m_04dce3.tscproj">
         <xmpDM:duration xmpDM:scale="1/1000" xmpDM:value="2213933"/>
         <xmpDM:videoFrameSize stDim:unit="pixel" stDim:h="1080" stDim:w="1440"/>
         <tsc:langName>
            <rdf:Bag>
               <rdf:li xml:lang="en-US">English</rdf:li></rdf:Bag>
         </tsc:langName>
         <xmpDM:Tracks>
            <rdf:Bag>
               <rdf:li>
                  <rdf:Description xmpDM:trackType="ScreenText" xmpDM:frameRate="f1000" xmpDM:trackName="Screen Text">
                     <xmpDM:markers>
                        <rdf:Seq>
                           <rdf:li><rdf:Description xmpDM:name="ETS (Cont) Bandwidth allocated per class group in 1% increment but 10% precision (±10% error)." xmpDM:startTime="91367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Max 75% allocated Þ Min 25% best effort Fairness within a group All unused bandwidth is available to all classes" xmpDM:startTime="91367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="wanting more bandwidth." xmpDM:startTime="91367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Allocation algorithm not defined." xmpDM:startTime="91367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example: Group 1=20%, Group 2=30% Class Group 3 Transmit Queue 0 Transmit Queue 1 Transmit Queue 2 Transmit Queue 3" xmpDM:startTime="91367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transmit Queue 4 Transmit Queue 5 Transmit Queue 6 Transmit Queue 7 20 20 10 20 30 50 30 50" xmpDM:startTime="91367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="50 20 20 10 20 30 50 30 50 t=1 t=2 t=3 t=1 t=2 t=3 Class Group 2 Class Group" xmpDM:startTime="91367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 20" xmpDM:startTime="91367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Enhanced Transmission Selection IEEE 802.1Qaz-2011" xmpDM:startTime="94733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Goal: Guarantee bandwidth for applications sharing a link Traffic is divided in to 8 classes (not priorities) The classes are" xmpDM:startTime="94733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="grouped." xmpDM:startTime="94733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Standard requires min 3 groups: 1 with PFC (Storage with low loss), 1 W/O PFC (LAN), 1 Strict Priority (Inter-process" xmpDM:startTime="94733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="communication and VOIP with low latency) 0 1 2 3 4 5 6 7 Group 1 Group 2 Group 3" xmpDM:startTime="94733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Classes Groups LAN Best Effort Storage Low Loss Inter-Process Comm+VOIP Low Delay" xmpDM:startTime="94733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ETS (Cont) Bandwidth allocated per class group in 1% increment but 10% precision (±10% error)." xmpDM:startTime="131367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Max 75% allocated Þ Min 25% best effort Fairness within a group All unused bandwidth is available to all classes" xmpDM:startTime="131367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="wanting more bandwidth." xmpDM:startTime="131367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Allocation algorithm not defined." xmpDM:startTime="131367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example: Group 1=20%, Group 2=30% Class Group 3 Transmit Queue 0 Transmit Queue 1 Transmit Queue 2 Transmit Queue 3" xmpDM:startTime="131367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transmit Queue 4 Transmit Queue 5 Transmit Queue 6 Transmit Queue 7 20 20 10 20 30 50 30 50" xmpDM:startTime="131367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="50 20 20 10 20 30 50 30 50 t=1 t=2 t=3 t=1 t=2 t=3 Class Group 2 Class Group" xmpDM:startTime="131367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 20" xmpDM:startTime="131367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example Max-Min Fairness: Giving more to any one should not require decreasing to someone with less allocation" xmpDM:startTime="322867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Help the poorest first) Example: In a 3-class group bridge, Groups 1 and 2 have a minimum guaranteed bandwidth of" xmpDM:startTime="322867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="20% and 30%, respectively." xmpDM:startTime="322867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a particular time slot, the traffic demands for group 1, 2, and 3 are 30%, 50%, 50%, respectively." xmpDM:startTime="322867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="How much should each group get? Iteration 1: Group 1 = 20, Group 2= 30, Unallocated = 50, Unsatisfied groups" xmpDM:startTime="322867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 3 Fair allocation of unallocated bandwidth = 50/3 per group Iteration 2: Group 1 = 20+10 (can’t use more)," xmpDM:startTime="322867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Group 2=30+50/3, Group 3=50/3 Total Used = 280/3, Unallocated = 20/3, Unsatisfied groups =2, Fair share of unallocated bandwidth =" xmpDM:startTime="322867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="10/3 per group Iteration 3: Group 1 = 30, Group 2= 30+50/3+10/3, Group 3 = 50/3+10/3 Total Used = 100," xmpDM:startTime="322867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Unallocated = 0 Þ Done." xmpDM:startTime="322867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="322867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ETS (Cont) Bandwidth allocated per class group in 1% increment but 10% precision (±10% error)." xmpDM:startTime="327800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Max 75% allocated Þ Min 25% best effort Fairness within a group All unused bandwidth is available to all classes" xmpDM:startTime="327800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="wanting more bandwidth." xmpDM:startTime="327800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Allocation algorithm not defined." xmpDM:startTime="327800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example: Group 1=20%, Group 2=30% Class Group 3 Transmit Queue 0 Transmit Queue 1 Transmit Queue 2 Transmit Queue 3" xmpDM:startTime="327800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transmit Queue 4 Transmit Queue 5 Transmit Queue 6 Transmit Queue 7 20 20 10 20 30 50 30 50" xmpDM:startTime="327800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="50 20 20 10 20 30 50 30 50 t=1 t=2 t=3 t=1 t=2 t=3 Class Group 2 Class Group" xmpDM:startTime="327800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 20" xmpDM:startTime="327800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example Max-Min Fairness: Giving more to any one should not require decreasing to someone with less allocation" xmpDM:startTime="335267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Help the poorest first) Example: In a 3-class group bridge, Groups 1 and 2 have a minimum guaranteed bandwidth of" xmpDM:startTime="335267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="20% and 30%, respectively." xmpDM:startTime="335267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a particular time slot, the traffic demands for group 1, 2, and 3 are 30%, 50%, 50%, respectively." xmpDM:startTime="335267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="How much should each group get? Iteration 1: Group 1 = 20, Group 2= 30, Unallocated = 50, Unsatisfied groups" xmpDM:startTime="335267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 3 Fair allocation of unallocated bandwidth = 50/3 per group Iteration 2: Group 1 = 20+10 (can’t use more)," xmpDM:startTime="335267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Group 2=30+50/3, Group 3=50/3 Total Used = 280/3, Unallocated = 20/3, Unsatisfied groups =2, Fair share of unallocated bandwidth =" xmpDM:startTime="335267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="10/3 per group Iteration 3: Group 1 = 30, Group 2= 30+50/3+10/3, Group 3 = 50/3+10/3 Total Used = 100," xmpDM:startTime="335267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Unallocated = 0 Þ Done." xmpDM:startTime="335267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="335267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ETS (Cont) Bandwidth allocated per class group in 1% increment but 10% precision (±10% error)." xmpDM:startTime="468933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Max 75% allocated Þ Min 25% best effort Fairness within a group All unused bandwidth is available to all classes" xmpDM:startTime="468933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="wanting more bandwidth." xmpDM:startTime="468933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Allocation algorithm not defined." xmpDM:startTime="468933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example: Group 1=20%, Group 2=30% Class Group 3 Transmit Queue 0 Transmit Queue 1 Transmit Queue 2 Transmit Queue 3" xmpDM:startTime="468933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transmit Queue 4 Transmit Queue 5 Transmit Queue 6 Transmit Queue 7 20 20 10 20 30 50 30 50" xmpDM:startTime="468933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="50 20 20 10 20 30 50 30 50 t=1 t=2 t=3 t=1 t=2 t=3 Class Group 2 Class Group" xmpDM:startTime="468933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 20" xmpDM:startTime="468933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example Max-Min Fairness: Giving more to any one should not require decreasing to someone with less allocation" xmpDM:startTime="644233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Help the poorest first) Example: In a 3-class group bridge, Groups 1 and 2 have a minimum guaranteed bandwidth of" xmpDM:startTime="644233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="20% and 30%, respectively." xmpDM:startTime="644233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a particular time slot, the traffic demands for group 1, 2, and 3 are 30%, 50%, 50%, respectively." xmpDM:startTime="644233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="How much should each group get? Iteration 1: Group 1 = 20, Group 2= 30, Unallocated = 50, Unsatisfied groups" xmpDM:startTime="644233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 3 Fair allocation of unallocated bandwidth = 50/3 per group Iteration 2: Group 1 = 20+10 (can’t use more)," xmpDM:startTime="644233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Group 2=30+50/3, Group 3=50/3 Total Used = 280/3, Unallocated = 20/3, Unsatisfied groups =2, Fair share of unallocated bandwidth =" xmpDM:startTime="644233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="10/3 per group Iteration 3: Group 1 = 30, Group 2= 30+50/3+10/3, Group 3 = 50/3+10/3 Total Used = 100," xmpDM:startTime="644233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Unallocated = 0 Þ Done." xmpDM:startTime="644233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="644233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ETS (Cont) Bandwidth allocated per class group in 1% increment but 10% precision (±10% error)." xmpDM:startTime="822600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Max 75% allocated Þ Min 25% best effort Fairness within a group All unused bandwidth is available to all classes" xmpDM:startTime="822600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="wanting more bandwidth." xmpDM:startTime="822600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Allocation algorithm not defined." xmpDM:startTime="822600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example: Group 1=20%, Group 2=30% Class Group 3 Transmit Queue 0 Transmit Queue 1 Transmit Queue 2 Transmit Queue 3" xmpDM:startTime="822600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transmit Queue 4 Transmit Queue 5 Transmit Queue 6 Transmit Queue 7 20 20 10 20 30 50 30 50" xmpDM:startTime="822600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="50 20 20 10 20 30 50 30 50 t=1 t=2 t=3 t=1 t=2 t=3 Class Group 2 Class Group" xmpDM:startTime="822600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 20" xmpDM:startTime="822600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example Max-Min Fairness: Giving more to any one should not require decreasing to someone with less allocation" xmpDM:startTime="988667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Help the poorest first) Example: In a 3-class group bridge, Groups 1 and 2 have a minimum guaranteed bandwidth of" xmpDM:startTime="988667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="20% and 30%, respectively." xmpDM:startTime="988667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a particular time slot, the traffic demands for group 1, 2, and 3 are 30%, 50%, 50%, respectively." xmpDM:startTime="988667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="How much should each group get? Iteration 1: Group 1 = 20, Group 2= 30, Unallocated = 50, Unsatisfied groups" xmpDM:startTime="988667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 3 Fair allocation of unallocated bandwidth = 50/3 per group Iteration 2: Group 1 = 20+10 (can’t use more)," xmpDM:startTime="988667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Group 2=30+50/3, Group 3=50/3 Total Used = 280/3, Unallocated = 20/3, Unsatisfied groups =2, Fair share of unallocated bandwidth =" xmpDM:startTime="988667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="10/3 per group Iteration 3: Group 1 = 30, Group 2= 30+50/3+10/3, Group 3 = 50/3+10/3 Total Used = 100," xmpDM:startTime="988667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Unallocated = 0 Þ Done." xmpDM:startTime="988667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="988667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Tabular Method for Max-Min Fairness Iterations end when either unused capacity or # of unsatisfied groups is zero." xmpDM:startTime="989500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="989500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example Max-Min Fairness: Giving more to any one should not require decreasing to someone with less allocation" xmpDM:startTime="1006500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Help the poorest first) Example: In a 3-class group bridge, Groups 1 and 2 have a minimum guaranteed bandwidth of" xmpDM:startTime="1006500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="20% and 30%, respectively." xmpDM:startTime="1006500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a particular time slot, the traffic demands for group 1, 2, and 3 are 30%, 50%, 50%, respectively." xmpDM:startTime="1006500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="How much should each group get? Iteration 1: Group 1 = 20, Group 2= 30, Unallocated = 50, Unsatisfied groups" xmpDM:startTime="1006500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 3 Fair allocation of unallocated bandwidth = 50/3 per group Iteration 2: Group 1 = 20+10 (can’t use more)," xmpDM:startTime="1006500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Group 2=30+50/3, Group 3=50/3 Total Used = 280/3, Unallocated = 20/3, Unsatisfied groups =2, Fair share of unallocated bandwidth =" xmpDM:startTime="1006500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="10/3 per group Iteration 3: Group 1 = 30, Group 2= 30+50/3+10/3, Group 3 = 50/3+10/3 Total Used = 100," xmpDM:startTime="1006500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Unallocated = 0 Þ Done." xmpDM:startTime="1006500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1006500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ETS (Cont) Bandwidth allocated per class group in 1% increment but 10% precision (±10% error)." xmpDM:startTime="1006967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Max 75% allocated Þ Min 25% best effort Fairness within a group All unused bandwidth is available to all classes" xmpDM:startTime="1006967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="wanting more bandwidth." xmpDM:startTime="1006967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Allocation algorithm not defined." xmpDM:startTime="1006967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example: Group 1=20%, Group 2=30% Class Group 3 Transmit Queue 0 Transmit Queue 1 Transmit Queue 2 Transmit Queue 3" xmpDM:startTime="1006967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transmit Queue 4 Transmit Queue 5 Transmit Queue 6 Transmit Queue 7 20 20 10 20 30 50 30 50" xmpDM:startTime="1006967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="50 20 20 10 20 30 50 30 50 t=1 t=2 t=3 t=1 t=2 t=3 Class Group 2 Class Group" xmpDM:startTime="1006967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 20" xmpDM:startTime="1006967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example Max-Min Fairness: Giving more to any one should not require decreasing to someone with less allocation" xmpDM:startTime="1017100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Help the poorest first) Example: In a 3-class group bridge, Groups 1 and 2 have a minimum guaranteed bandwidth of" xmpDM:startTime="1017100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="20% and 30%, respectively." xmpDM:startTime="1017100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a particular time slot, the traffic demands for group 1, 2, and 3 are 30%, 50%, 50%, respectively." xmpDM:startTime="1017100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="How much should each group get? Iteration 1: Group 1 = 20, Group 2= 30, Unallocated = 50, Unsatisfied groups" xmpDM:startTime="1017100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 3 Fair allocation of unallocated bandwidth = 50/3 per group Iteration 2: Group 1 = 20+10 (can’t use more)," xmpDM:startTime="1017100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Group 2=30+50/3, Group 3=50/3 Total Used = 280/3, Unallocated = 20/3, Unsatisfied groups =2, Fair share of unallocated bandwidth =" xmpDM:startTime="1017100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="10/3 per group Iteration 3: Group 1 = 30, Group 2= 30+50/3+10/3, Group 3 = 50/3+10/3 Total Used = 100," xmpDM:startTime="1017100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Unallocated = 0 Þ Done." xmpDM:startTime="1017100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1017100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Tabular Method for Max-Min Fairness Iterations end when either unused capacity or # of unsatisfied groups is zero." xmpDM:startTime="1017533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1017533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example Max-Min Fairness: Giving more to any one should not require decreasing to someone with less allocation" xmpDM:startTime="1144333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Help the poorest first) Example: In a 3-class group bridge, Groups 1 and 2 have a minimum guaranteed bandwidth of" xmpDM:startTime="1144333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="20% and 30%, respectively." xmpDM:startTime="1144333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a particular time slot, the traffic demands for group 1, 2, and 3 are 30%, 50%, 50%, respectively." xmpDM:startTime="1144333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="How much should each group get? Iteration 1: Group 1 = 20, Group 2= 30, Unallocated = 50, Unsatisfied groups" xmpDM:startTime="1144333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 3 Fair allocation of unallocated bandwidth = 50/3 per group Iteration 2: Group 1 = 20+10 (can’t use more)," xmpDM:startTime="1144333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Group 2=30+50/3, Group 3=50/3 Total Used = 280/3, Unallocated = 20/3, Unsatisfied groups =2, Fair share of unallocated bandwidth =" xmpDM:startTime="1144333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="10/3 per group Iteration 3: Group 1 = 30, Group 2= 30+50/3+10/3, Group 3 = 50/3+10/3 Total Used = 100," xmpDM:startTime="1144333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Unallocated = 0 Þ Done." xmpDM:startTime="1144333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1144333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ETS (Cont) Bandwidth allocated per class group in 1% increment but 10% precision (±10% error)." xmpDM:startTime="1144767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Max 75% allocated Þ Min 25% best effort Fairness within a group All unused bandwidth is available to all classes" xmpDM:startTime="1144767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="wanting more bandwidth." xmpDM:startTime="1144767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Allocation algorithm not defined." xmpDM:startTime="1144767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example: Group 1=20%, Group 2=30% Class Group 3 Transmit Queue 0 Transmit Queue 1 Transmit Queue 2 Transmit Queue 3" xmpDM:startTime="1144767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transmit Queue 4 Transmit Queue 5 Transmit Queue 6 Transmit Queue 7 20 20 10 20 30 50 30 50" xmpDM:startTime="1144767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="50 20 20 10 20 30 50 30 50 t=1 t=2 t=3 t=1 t=2 t=3 Class Group 2 Class Group" xmpDM:startTime="1144767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 20" xmpDM:startTime="1144767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example Max-Min Fairness: Giving more to any one should not require decreasing to someone with less allocation" xmpDM:startTime="1149867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Help the poorest first) Example: In a 3-class group bridge, Groups 1 and 2 have a minimum guaranteed bandwidth of" xmpDM:startTime="1149867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="20% and 30%, respectively." xmpDM:startTime="1149867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a particular time slot, the traffic demands for group 1, 2, and 3 are 30%, 50%, 50%, respectively." xmpDM:startTime="1149867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="How much should each group get? Iteration 1: Group 1 = 20, Group 2= 30, Unallocated = 50, Unsatisfied groups" xmpDM:startTime="1149867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= 3 Fair allocation of unallocated bandwidth = 50/3 per group Iteration 2: Group 1 = 20+10 (can’t use more)," xmpDM:startTime="1149867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Group 2=30+50/3, Group 3=50/3 Total Used = 280/3, Unallocated = 20/3, Unsatisfied groups =2, Fair share of unallocated bandwidth =" xmpDM:startTime="1149867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="10/3 per group Iteration 3: Group 1 = 30, Group 2= 30+50/3+10/3, Group 3 = 50/3+10/3 Total Used = 100," xmpDM:startTime="1149867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Unallocated = 0 Þ Done." xmpDM:startTime="1149867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1149867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Tabular Method for Max-Min Fairness Iterations end when either unused capacity or # of unsatisfied groups is zero." xmpDM:startTime="1150333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1150333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quantized Congestion Notification (QCN) IEEE 802.1Qau-2010" xmpDM:startTime="1151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dynamic Congestion Notification A source quench message is sent by the congested switch direct to the source." xmpDM:startTime="1151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The source reduces its rate for that flow." xmpDM:startTime="1151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Sources need to keep per-flow states and control mechanisms Easy for switch manufacturers but complex for hosts." xmpDM:startTime="1151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Implemented in switches but not in hosts  Not effective." xmpDM:startTime="1151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The source may be a router in a subnet and not the real source  Router will drop the traffic." xmpDM:startTime="1151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="QCN does not help in this case." xmpDM:startTime="1151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Destination Switch Source Destination Switch Switch Ref: I." xmpDM:startTime="1151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Pepelnjak, “DCB Congestion Notification (802.1Qau),”" xmpDM:startTime="1151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="http://blog.ipspace.net/2010/11/data-center-bridging-dcb-congestion.html" xmpDM:startTime="1151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1151000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Tabular Method for Max-Min Fairness Iterations end when either unused capacity or # of unsatisfied groups is zero." xmpDM:startTime="1152600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1152600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quantized Congestion Notification (QCN) IEEE 802.1Qau-2010" xmpDM:startTime="1153667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Dynamic Congestion Notification A source quench message is sent by the congested switch direct to the source." xmpDM:startTime="1153667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The source reduces its rate for that flow." xmpDM:startTime="1153667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Sources need to keep per-flow states and control mechanisms Easy for switch manufacturers but complex for hosts." xmpDM:startTime="1153667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Implemented in switches but not in hosts  Not effective." xmpDM:startTime="1153667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The source may be a router in a subnet and not the real source  Router will drop the traffic." xmpDM:startTime="1153667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="QCN does not help in this case." xmpDM:startTime="1153667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Destination Switch Source Destination Switch Switch Ref: I." xmpDM:startTime="1153667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Pepelnjak, “DCB Congestion Notification (802.1Qau),”" xmpDM:startTime="1153667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="http://blog.ipspace.net/2010/11/data-center-bridging-dcb-congestion.html" xmpDM:startTime="1153667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1153667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DCBX Data Center Bridging eXchange, IEEE 802.1Qaz-2011" xmpDM:startTime="1634367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Uses LLDP to negotiate quality metrics and capabilities for Priority-based Flow Control, Enhanced Transmission Selection, and Quantized Congestion Notification New" xmpDM:startTime="1634367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TLV’s Priority group definition Group bandwidth allocation PFC enablement per priority QCN enablement DCB protocol profiles FCoE and iSCSI profiles" xmpDM:startTime="1634367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1634367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Ethernet’s use of IDs as addresses makes it very easy to move systems in the data center  Keep" xmpDM:startTime="1741467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="traffic on the same Ethernet Spanning tree is wasteful of resources and slow." xmpDM:startTime="1741467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Ethernet now uses shortest path bridging (similar to OSPF) VLANs allow different non-trusting entities to share an Ethernet network Data" xmpDM:startTime="1741467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="center bridging extensions reduce the packet loss by enhanced transmission selection and Priority-based flow control" xmpDM:startTime="1741467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 4B What would be max-min allocation for a 4 group system in which group 1 through 3 are guaranteed" xmpDM:startTime="2178167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="10%, 20%, and 30% respectively." xmpDM:startTime="2178167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The demands on a 10 Gb system are 1 Gb, 4Gb, and 35 Gb, and 70 Gb." xmpDM:startTime="2178167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2178167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Scan This to Download These Slides Raj Jain http://rajjain.com" xmpDM:startTime="2202367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2202367" xmpDM:duration="1000"/></rdf:li></rdf:Seq>
                     </xmpDM:markers>
                  </rdf:Description>
               </rdf:li>
               <rdf:li>
                  <rdf:Description xmpDM:trackType="TableOfContents" xmpDM:frameRate="f1000" xmpDM:trackName="Table of Contents">
                     <xmpDM:markers>
                        <rdf:Seq>
                           <rdf:li><rdf:Description xmpDM:name="ETS (Cont)" xmpDM:startTime="91367" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="0" tscDM:imageoffset="0" tscDM:imagerect="0, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Enhanced Transmission Selection" xmpDM:startTime="94733" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="1" tscDM:imageoffset="0" tscDM:imagerect="75, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ETS (Cont)" xmpDM:startTime="131367" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="2" tscDM:imageoffset="0" tscDM:imagerect="150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example" xmpDM:startTime="322867" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="3" tscDM:imageoffset="0" tscDM:imagerect="225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ETS (Cont)" xmpDM:startTime="327800" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="4" tscDM:imageoffset="0" tscDM:imagerect="300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example" xmpDM:startTime="335267" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="5" tscDM:imageoffset="0" tscDM:imagerect="375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ETS (Cont)" xmpDM:startTime="468933" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="6" tscDM:imageoffset="0" tscDM:imagerect="450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example" xmpDM:startTime="644233" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="7" tscDM:imageoffset="0" tscDM:imagerect="525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ETS (Cont)" xmpDM:startTime="822600" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="8" tscDM:imageoffset="0" tscDM:imagerect="600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example" xmpDM:startTime="988667" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="9" tscDM:imageoffset="0" tscDM:imagerect="675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Tabular Method for Max-Min Fairness" xmpDM:startTime="989500" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="10" tscDM:imageoffset="0" tscDM:imagerect="750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example" xmpDM:startTime="1006500" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="11" tscDM:imageoffset="0" tscDM:imagerect="825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ETS (Cont)" xmpDM:startTime="1006967" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="12" tscDM:imageoffset="0" tscDM:imagerect="900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example" xmpDM:startTime="1017100" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="13" tscDM:imageoffset="0" tscDM:imagerect="975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Tabular Method for Max-Min Fairness" xmpDM:startTime="1017533" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="14" tscDM:imageoffset="0" tscDM:imagerect="1050, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example" xmpDM:startTime="1144333" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="15" tscDM:imageoffset="0" tscDM:imagerect="1125, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ETS (Cont)" xmpDM:startTime="1144767" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="16" tscDM:imageoffset="0" tscDM:imagerect="1200, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A ETS Fairness Example" xmpDM:startTime="1149867" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="17" tscDM:imageoffset="0" tscDM:imagerect="1275, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Tabular Method for Max-Min Fairness" xmpDM:startTime="1150333" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="18" tscDM:imageoffset="0" tscDM:imagerect="1350, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quantized Congestion Notification (QCN)" xmpDM:startTime="1151000" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="19" tscDM:imageoffset="0" tscDM:imagerect="1425, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Tabular Method for Max-Min Fairness" xmpDM:startTime="1152600" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="20" tscDM:imageoffset="0" tscDM:imagerect="1500, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Quantized Congestion Notification (QCN)" xmpDM:startTime="1153667" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="21" tscDM:imageoffset="0" tscDM:imagerect="1575, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DCBX" xmpDM:startTime="1634367" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="22" tscDM:imageoffset="0" tscDM:imagerect="1650, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="1741467" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="23" tscDM:imageoffset="0" tscDM:imagerect="1725, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 4B" xmpDM:startTime="2178167" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="24" tscDM:imageoffset="0" tscDM:imagerect="1800, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Scan This to Download These Slides" xmpDM:startTime="2202367" tscDM:image="m_04dce3_Thumbnails.png" tscDM:imageindex="25" tscDM:imageoffset="0" tscDM:imagerect="1875, 0, 75, 56"/></rdf:li></rdf:Seq>
                     </xmpDM:markers>
                  </rdf:Description>
               </rdf:li>
            </rdf:Bag>
         </xmpDM:Tracks>
         <tscDM:controller>
            <rdf:Description xmpDM:name="tscplayer">
               <tscDM:parameters>
                  <rdf:Bag>
                     <rdf:li xmpDM:name="autohide" xmpDM:value="true"/><rdf:li xmpDM:name="autoplay" xmpDM:value="false"/><rdf:li xmpDM:name="loop" xmpDM:value="false"/><rdf:li xmpDM:name="searchable" xmpDM:value="true"/><rdf:li xmpDM:name="captionsenabled" xmpDM:value="false"/><rdf:li xmpDM:name="sidebarenabled" xmpDM:value="false"/><rdf:li xmpDM:name="unicodeenabled" xmpDM:value="false"/><rdf:li xmpDM:name="backgroundcolor" xmpDM:value="000000"/><rdf:li xmpDM:name="sidebarlocation" xmpDM:value="left"/><rdf:li xmpDM:name="endaction" xmpDM:value="stop"/><rdf:li xmpDM:name="endactionparam" xmpDM:value="true"/><rdf:li xmpDM:name="locale" xmpDM:value="en-US"/></rdf:Bag>
               </tscDM:parameters>
               <tscDM:controllerText>
                  <rdf:Bag>
                  </rdf:Bag>
               </tscDM:controllerText>
            </rdf:Description>
         </tscDM:controller>
         <tscDM:contentList>
            <rdf:Description>
               <tscDM:files>
                  <rdf:Seq>
                     <rdf:li xmpDM:name="0" xmpDM:value="m_04dce3.mp4"/><rdf:li xmpDM:name="1" xmpDM:value="m_04dce3_First_Frame.png"/><rdf:li xmpDM:name="2" xmpDM:value="m_04dce3_Thumbnails.png"/></rdf:Seq>
               </tscDM:files>
            </rdf:Description>
         </tscDM:contentList>
      </rdf:Description>
   </rdf:RDF>
</x:xmpmeta>