1 karl  1.1.2.2 // Copyright (c) 2005 DMTF.  All rights reserved.
  2               // <change cr="ArchCR00066.004" type="add">Add UmlPackagePath
  3               // qualifier values to CIM Schema.</change>
  4               // ==================================================================
  5               //  CIM_AutonomousSystem 
  6               // ==================================================================
  7                  [Version ( "2.6.0" ), 
  8                   UMLPackagePath ( "CIM::Network::Systems" ), 
  9                   Description ( 
 10                      "An Autonomous System (AS) is a fundamental concept in "
 11                      "networking. An AS provides a structured view of routing by "
 12                      "segregating the system that is using routing (e.g., the "
 13                      "Internet, or an extranet) into a set of separately "
 14                      "administered domains that each have their own independent "
 15                      "routing policies. These domains are called autonomous systems. \n"
 16                      "\n"
 17                      "The classic definition of an AS, from RFC1771, is \'...a set "
 18                      "of routers under a single technical administration, using an "
 19                      "interior gateway protocol and common metrics to route packets "
 20                      "within the AS, and using an exterior gateway protocol to route "
 21                      "packets to other ASs\'. The RFC continues: \'Since this "
 22 karl  1.1.2.2        "classic definition was developed, it has become common for a "
 23                      "single AS to use several interior gateway protocols and "
 24                      "sometimes several sets of metrics within an AS. The use of the "
 25                      "term Autonomous System here stresses the fact that, even when "
 26                      "multiple IGPs and metrics are used, the administration of an "
 27                      "AS appears to other ASs to have a single coherent interior "
 28                      "routing plan and presents a consistent picture of what "
 29                      "destinations are reachable through it.\'" )]
 30               class CIM_AutonomousSystem : CIM_AdminDomain {
 31               
 32                     [Description ( 
 33                         "An ASNumber is an integer between 1 and 65535, with the "
 34                         "range 64512 through 65535 reserved for private use. "
 35                         "Every AS has a unique AS number, which is assigned to it "
 36                         "by an Internet Registry or a provider. IANA assigns and "
 37                         "administers AS numbers." )]
 38                  uint16 ASNumber;
 39               
 40                     [Description ( 
 41                         "IsSingleHomed is a boolean that, when its value is TRUE, "
 42                         "indicates that this AS reaches networks outside of its "
 43 karl  1.1.2.2           "domain through a single exit point." )]
 44                  boolean IsSingleHomed;
 45               
 46                     [Description ( 
 47                         "IsTransit is a boolean that, when its value is TRUE, "
 48                         "indicates that this AS will advertise routes that it "
 49                         "learns from other ASs. A non-transit AS will only "
 50                         "advertise its own routes." )]
 51                  boolean IsTransit;
 52               
 53                     [Description ( 
 54                         "RequireIGPSync is a boolean that, when its value is "
 55                         "TRUE, indicates that this AS must obey the following "
 56                         "rule: a router should not advertise destinations learned "
 57                         "from internal neighbors to external destinations unless "
 58                         "those destinations are also known via some internal "
 59                         "gateway protocol. Otherwise, a router may receive "
 60                         "traffic that cannot yet be routed. However, since this "
 61                         "is a costly choice, it is common practice to allow this "
 62                         "rule to be broken under certain carefully controlled "
 63                         "circumstances." )]
 64 karl  1.1.2.2    boolean RequireIGPSync;
 65               
 66                     [Description ( 
 67                         "RoutingUpdateSource defines how routing information is "
 68                         "to be injected. Statically injected routes are "
 69                         "maintained by the routing table and are independent of "
 70                         "the status of the networks to which they refer. This is "
 71                         "done simply by defining static routes in the routing "
 72                         "table. Dynamically injected routes are of two types. "
 73                         "Dynamic routes refer to distributing all of the IGP "
 74                         "routes. Semi-dynamic routes define a set of specific IGP "
 75                         "routes that will be injected." ), 
 76                      ValueMap { "0", "1", "2", "3" }, 
 77                      Values { "Unknown", "Static", "Dynamic", "Semi-Dynamic" }]
 78                  uint16 RoutingUpdateSource;
 79               
 80                     [Description ( 
 81                         "Route aggregation refers to summarizing ranges of routes "
 82                         "into one or more aggregate routes. This is done to "
 83                         "minimize the number of routes in the global routing "
 84                         "table. A potential drawback is that specific path "
 85 karl  1.1.2.2           "information (e.g., the Path attribute value) is lost, "
 86                         "which may lead to potential routing loops. There are a "
 87                         "variety of ways to ensure that this does not happen. "
 88                         "Note that BGP4 is required to do this. \n"
 89                         "\n"
 90                         "There are many ways to form aggregate routes. The "
 91                         "following are the most popular: \'Aggregate only\', "
 92                         "where only the aggregate is advertised, and all of its "
 93                         "more specific routes are suppressed; \'Aggregate Plus "
 94                         "Specific Routes\', where both the aggregate as well as "
 95                         "its more specific routes are advertised (e.g., send the "
 96                         "aggregate to the NAP, but send the more specific routes "
 97                         "to providers); \'Aggregate Based on a Subset of Specific "
 98                         "Routes\', where the aggregate route is formed by looking "
 99                         "at certain more specific routes and forming an aggregate "
100                         "on them, suppressing all others." ), 
101                      ValueMap { "0", "1", "2", "3", "4" }, 
102                      Values { "Unknown", "None", "Aggregate Only", 
103                         "Aggregate And All Specific Routes", 
104                         "Aggregate Based on Subset of Specific Routes" }]
105                  uint16 AggregationType;
106 karl  1.1.2.2 
107               
108               };