C
C-MAC
A source and destination customer MAC address (C-SA and a C-DA) in a
Provider Backbone Bridging (PBB) header.
C-TAG
Carrier Ethernet
Extensions to
Ethernet that enable network operators to provide Ethernet services to customers and to use Ethernet technology in their networks. See also
Metro Ethernet Forum (MEF).
certificate
Electronic document that identifies a person or entity. Through the use of keys and certificates, the entities exchanging data can authenticate each other.
channel
A connecting path that carries information from a sending device to a receiving device. A channel can refer to a physical medium (such as a coaxial cable or fiber optic cable).
circuit
A communications channel or path between two devices capable of carrying electrical current.
circuit switching
A network where a dedicated circuit must be opened between devices before they can communicate and, while the circuit is open, no other devices may use that circuit or parts of it. A circuit can remain open without any information transmission, and still be unusable by other devices; it must be closed before it is available to other users. Contrast with
packet switching.
Class of Service (CoS)
A way of managing traffic in a network by grouping similar types of traffic (for example, e-mail, video, voice, file transfer) together and treating each type as a class with its own level of service priority. However, no guarantees are made that a given priority will meet any specified minimum level. See also
Quality of Service (QoS).
classful IP addressing
An older addressing scheme for configuring the ratio of networks to hosts using fixed length prefixes. See
Classless Interdomain Routing (CIDR).
Classless Interdomain Routing (CIDR)
A notation for specifying an IP addresses and its network prefix which appends a slash character to the address and a decimal number indicating the leading bits in the network prefix. For example:
• In the IPv4 notation “192.168.0.0/16”:
• “192.168” (the first 16 bits) defines the network address.
• .0.0 up to .255.255 refer to the host addresses on that network. This leaves 16 bits to contain host addresses, enough for 65536 host addresses.
• In the IPv6 notation “2001:db8::/32”:
• “2001:db8” (the first 32 bits) defines the network address.
• :0:0:0:0:0:0 to:ffff:ffff:ffff:ffff:ffff:ffff refer to host addresses on that network. This leaves 96 bits to contains host addresses, enough for 7,922,816,251,426,433 host addresses.
The lower the number after the slash, the more hosts contained in that block.
CIDR uses variable length subnet masking (VLSM) based on arbitrary length prefixes. In VLSM, the number of network and host bits assigned to a subnet can vary based on the number of hosts the subnet needs to support.
CIDR replaced traditional
classful IP addressing, in which address allocation was based on octet (8-bit) boundary segments of the IP address. In CIDR, the boundary between the network and host portions of an IP address can be on any bit boundary. The old classful A, B, and C network designations correspond to CIDR prefixes of /8, /16, or /24. 192.168.0.0/16 corresponds to an old class B network. With CIDR, finer grained division of networks are possible, down to individual IP addresses, such as 192.168.100.2/32.
Before CIDR notation, IPv4 networks were represented using
dotted decimal notation for both the address and a
subnet mask.
client/server architecture
A computing architecture that distributes processing between clients and servers on the network. A client program makes a service request from a server which fulfils the request.
collapsed core
Collapsing the
core layer and the
distribution layer into one layer (one device) in the
network design model. A collapsed core design reduces cost, while maintaining most of the benefits of the network design model for small networks that do not grow significantly larger over time.
collision domain
A
network segment where data frames can collide with one another when being sent on a shared medium such as
Ethernet. Hosts in a collision domain arbitrate among themselves using an access control mechanism.
command-line interface (CLI)
Environment for entering commands to configure and monitor routing and switching software and hardware.
committed information rate (CIR)
The average rate at which packets are admitted to the network. Each packet is counted as it enters the network. Packets that do not exceed the CIR are marked green, which corresponds to low loss priority. Packets that exceed the CIR but are below the peak information rate (PIR) are marked yellow, which corresponds to medium loss priority.
common and internal spanning tree (CIST)
A single topology connecting all
Spanning Tree Protocol (STP),
Rapid Spanning Tree Protocol (RSTP),
Multiple Spanning Tree Protocol (MSTP) switches into one active topology. In other words, an entire spanning tree fabric.
common spanning tree (CST)
The topology connecting all
Spanning Tree Protocol (STP)/
Rapid Spanning Tree Protocol (RSTP) switches and
multiple spanning-tree (MST) region instances. An MST region appears as a single switch to spanning tree configurations outside the region.
community
In
Border Gateway Protocol (BGP), a logical group of prefixes or destinations that share a common attribute; used to simplify a routing policy. Community members can be on different networks and in different autonomous systems.
In
Simple Network Management Protocol (SNMP), an authentication scheme that authorizes SNMP clients based on the source
IP address of incoming SNMP packets, defines which
Management Information Base (MIB) objects are available, and specifies the operations (read-only or read-write) allowed on those objects.
congestion
The state in which the network load exceeds the available resources such as link capacity or memory buffers.
connection-oriented
A
packet switching technology where a virtual circuit between sending and receiving devices makes it seem like the devices are connected by a switched circuit with a fixed bandwidth without regard to their physical addresses. In a connection-oriented service, packets always reach their destination in the same order as they were sent.
Transmission Control Protocol (TCP) is a connection-oriented transport service. See also
connectionless.
Connection-oriented protocols can be used to send information that requires a constant delay and bandwidth such as voice and video.
connectionless
A
packet switching technology where the source and destination addresses are included in each packet so that a direct connection or an established session between sender and receiver is not required for communications. In a connectionless service, each packet is handled independently of all others, and packets might not reach their destination in the same order in which they were sent.
User Datagram Protocol (UDP) is a connectionless transport service. See also
connection-oriented.
Connectivity Fault Management (CFM)
An
Operation, Administration, and Maintenance (OAM) protocol that can manage
Ethernet services and detect, verify, and isolate connectivity failures in VLANs. CFM enables service providers to configure:
Constrained Shortest Path First (CSPF)
An extension of
shortest path first (SPF). The path computed using CSPF is the shortest path that fulfills a set of constraints. After running the shortest path algorithm, the paths are pruned, removing those links that violate a given set of constraints.
Content Addressable Memory (CAM)
An integrated circuit in a device that stores a table used to make frame forwarding and classification decisions. CAM can perform a massively parallel search of entries in the table much faster than a serial search than in conventional Random Access Memory (RAM).
There are two types of CAM:
• Binary CAM: A binary lookup that returns either a 1 or 0. A MAC address in an Ethernet frame comes into a switch, the switch looks in its MAC address table and either finds that MAC address or does not (1 or 0).
• Ternary CAM (TCAM): A binary lookup that returns either a 1 or 0 but also has a “do not care” bit. TCAM can have multiple matches and can determine a best match. This is necessary because
Classless Interdomain Routing (CIDR) lookups need a longest prefix match. For example, 192.168.1.7/32 matches both 192.168.1.0/24 and 192.168.1.0/25. The closest match to 192.168.1.7/32 is 192.168.1.0/25 which would be chosen.
Continuity Check Message (CCM)
control plane
The part of
switch or
router architecture that makes decisions about where traffic is sent. Control plane processing is the “signalling” of the network. Anything that is needed to get routing and switching working on a device is considered part of the control plane. The control plane serves the
data plane.
The control plane functions include the manual system configuration and management operations performed by a network administrator. The control plane functions also include
dynamic routing protocols such as
Routing Information Protocol (RIP),
Open Shortest Path First (OSPF), or
Border Gateway Protocol (BGP) that exchange topology information with other routers and construct a
Routing Information Base (RIB).
The control plane functions are not performed on each arriving individual packet, so they do not have a strict speed constraint and are not time-critical.
Control plane packets are sent to or are locally originated by the device itself.
convergence
The synchronization process that a network must go through immediately after a
topology change. Convergence time is the time required to update all the devices on the network with the routing information changes. See also
routing table.
core layer
In the
network design model, the layer that provides a transit function to access the internal network and external networks. The core layer moves packets between
distribution layer devices. The core layer also links to the devices at the enterprise edge to support Internet, virtual private networks (VPN), extranet, and WAN access.
The core layer uses
Layer 3 (L3) routing protocols that scale well and converge quickly such as
Open Shortest Path First (OSPF).
The core serves as the
backbone for the network and is critical for connecting distribution layer devices, so it is important for the core to be fast with low-latency, reliable, and scalable.
Also called backbone or trunk.
count-to-infinity
A
distance-vector routing problem where if A tells B that it has a path somewhere, there is no way for B to know if the path has B as a part of it.
The count-to-infinity problem is caused by a link failure that partitions the network into two or more segments. When the network is partitioned, devices in one part of the segment cannot reach devices in the other part of the segment. The distance-vector algorithm adjusts the distance value slowly upwards toward infinity.
The count-to-infinity problem can be solved through
split horizon methods.
cryptography
Rendering information unintelligible and restoring encrypted information to an intelligible form.
customer edge (CE)
A device that provides an interface between a
Local Area Network (LAN) and an enterprise or service provider core network. Outbound packets from the LAN are forwarded from the CE to a
provider edge (PE) device, and inbound packets are forwarded from the PE to the CE.
customer VLAN (C-VLAN)
In a
Provider Bridging (PB) frame, a field that identifies the customer VLAN. See also
service VLAN (S-VLAN). Also called C-TAG.