{"id":398057,"date":"2024-10-20T04:33:39","date_gmt":"2024-10-20T04:33:39","guid":{"rendered":"https:\/\/pdfstandards.shop\/product\/uncategorized\/ieee-802-1qca-2015\/"},"modified":"2024-10-26T08:21:57","modified_gmt":"2024-10-26T08:21:57","slug":"ieee-802-1qca-2015","status":"publish","type":"product","link":"https:\/\/pdfstandards.shop\/product\/publishers\/ieee\/ieee-802-1qca-2015\/","title":{"rendered":"IEEE 802.1Qca-2015"},"content":{"rendered":"

Amendment Standard – Superseded. Explicit path control, bandwidth reservation, and redundancy (protection, restoration) for data flows are specified in this amendment to IEEE Std 802.1Q-2014.<\/p>\n

PDF Catalog<\/h4>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
PDF Pages<\/th>\nPDF Title<\/th>\n<\/tr>\n
1<\/td>\nIEEE Std 802.1Qca\u2122-2015 Cover
\n <\/td>\n<\/tr>\n
3<\/td>\nTitle page
\n <\/td>\n<\/tr>\n
5<\/td>\nImportant Notices and Disclaimers Concerning IEEE Standards Documents <\/td>\n<\/tr>\n
8<\/td>\nParticipants <\/td>\n<\/tr>\n
10<\/td>\nIntroduction <\/td>\n<\/tr>\n
11<\/td>\nContents <\/td>\n<\/tr>\n
13<\/td>\nFigures <\/td>\n<\/tr>\n
14<\/td>\nTables <\/td>\n<\/tr>\n
15<\/td>\nIMPORTANT NOTICE <\/td>\n<\/tr>\n
16<\/td>\n1. Overview
1.3 Introduction <\/td>\n<\/tr>\n
17<\/td>\n2. Normative references <\/td>\n<\/tr>\n
18<\/td>\n3. Definitions <\/td>\n<\/tr>\n
20<\/td>\n4. Abbreviations <\/td>\n<\/tr>\n
21<\/td>\n5. Conformance
5.4.6 Path Control and Reservation (PCR) (optional) <\/td>\n<\/tr>\n
22<\/td>\n7. Principles of Virtual Bridged Network operation
7.1 Network overview
7.3 Active topology <\/td>\n<\/tr>\n
24<\/td>\n8. Principles of Bridge operation
8.4 Active topologies, learning, and forwarding
8.6.1 Active topology enforcement
8.8.9 Querying the FDB <\/td>\n<\/tr>\n
25<\/td>\n8.9.3 ID to MSTI Allocation Table <\/td>\n<\/tr>\n
26<\/td>\n12. Bridge management
12.25 Shortest Path Bridging managed objects <\/td>\n<\/tr>\n
27<\/td>\n12.25.4 The SPB ECT Static Entry managed object
12.28 Path Control and Reservation (PCR) management <\/td>\n<\/tr>\n
28<\/td>\n12.28.1 The PCR ECT Static Entry managed object <\/td>\n<\/tr>\n
30<\/td>\n12.28.2 The PCR Topology ECT Table managed object <\/td>\n<\/tr>\n
32<\/td>\n17. Management Information Base (MIB)
17.2 Structure of the MIB
17.2.19 Structure of the IEEE8021-SPB-MIB <\/td>\n<\/tr>\n
33<\/td>\n17.3 Relationship to other MIBs
17.3.22 Relationship of the PCR MIB to other MIB modules
17.4 Security considerations
17.4.22 Security considerations of the PCR MIB
17.7 MIB modules
17.7.19 Definitions for the IEEE8021-SPB-MIB module <\/td>\n<\/tr>\n
78<\/td>\n27. Shortest Path Bridging (SPB)
27.1 Protocol design requirements
27.4 ISIS-SPB VLAN configuration <\/td>\n<\/tr>\n
80<\/td>\n28. ISIS-SPB Link State Protocol
28.6 Symmetric ECT framework
28.7 Symmetric ECT
28.8 Symmetric ECT Algorithm details <\/td>\n<\/tr>\n
81<\/td>\n28.12.4 SPB Base VLAN-Identifiers sub-TLV
28.12.5 SPB Instance sub-TLV
28.12.10 SPBM Service Identifier and Unicast Address (ISID-ADDR) sub-TLV <\/td>\n<\/tr>\n
82<\/td>\n45. Path Control and Reservation (PCR)
45.1 Explicit trees <\/td>\n<\/tr>\n
86<\/td>\n45.1.1 Tree structures <\/td>\n<\/tr>\n
87<\/td>\n45.1.2 Explicit ECT Algorithms <\/td>\n<\/tr>\n
89<\/td>\n45.1.3 ISIS-PCR VLAN configuration <\/td>\n<\/tr>\n
93<\/td>\n45.1.4 Use of VIDs for strict explicit trees <\/td>\n<\/tr>\n
94<\/td>\n45.1.5 MAC addresses and ISIS-PCR
45.1.6 Filtering Database entries for explicit trees <\/td>\n<\/tr>\n
95<\/td>\n45.1.7 ISIS-PCR support
45.1.8 Attributes for path computation <\/td>\n<\/tr>\n
97<\/td>\n45.1.9 Topology sub-TLV <\/td>\n<\/tr>\n
100<\/td>\n45.1.10 Hop sub-TLV <\/td>\n<\/tr>\n
103<\/td>\n45.1.11 Administrative Group sub-TLV
45.1.12 Bandwidth Constraint sub-TLV <\/td>\n<\/tr>\n
104<\/td>\n45.2 Reservation
45.2.1 Bandwidth Assignment sub-TLV <\/td>\n<\/tr>\n
106<\/td>\n45.2.2 Timestamp sub-TLV
45.2.3 Precedence ordering
45.3 Redundancy <\/td>\n<\/tr>\n
107<\/td>\n45.3.1 Loop-free alternates for unicast data flows
45.3.2 Static redundant trees <\/td>\n<\/tr>\n
108<\/td>\n45.3.3 Maximally Redundant Trees (MRTs) <\/td>\n<\/tr>\n
111<\/td>\n45.3.4 MRTs with centralized GADAG computation <\/td>\n<\/tr>\n
115<\/td>\nAnnex A (normative) PICS proforma\u2014Bridge implementations <\/td>\n<\/tr>\n
119<\/td>\nAnnex Q (informative) Bibliography
\n <\/td>\n<\/tr>\n
120<\/td>\nBack cover <\/td>\n<\/tr>\n<\/table>\n","protected":false},"excerpt":{"rendered":"

IEEE Standard for Local and metropolitan area networks– Bridges and Bridged Networks – Amendment 24: Path Control and Reservation<\/b><\/p>\n\n\n\n\n
Published By<\/td>\nPublication Date<\/td>\nNumber of Pages<\/td>\n<\/tr>\n
IEEE<\/b><\/a><\/td>\n2015<\/td>\n120<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"featured_media":398066,"template":"","meta":{"rank_math_lock_modified_date":false,"ep_exclude_from_search":false},"product_cat":[2644],"product_tag":[],"class_list":{"0":"post-398057","1":"product","2":"type-product","3":"status-publish","4":"has-post-thumbnail","6":"product_cat-ieee","8":"first","9":"instock","10":"sold-individually","11":"shipping-taxable","12":"purchasable","13":"product-type-simple"},"_links":{"self":[{"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/product\/398057","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/product"}],"about":[{"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/types\/product"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/media\/398066"}],"wp:attachment":[{"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/media?parent=398057"}],"wp:term":[{"taxonomy":"product_cat","embeddable":true,"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/product_cat?post=398057"},{"taxonomy":"product_tag","embeddable":true,"href":"https:\/\/pdfstandards.shop\/wp-json\/wp\/v2\/product_tag?post=398057"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}