|
|
|
|
Description:
|
sleMplsTpOamMaintanceEntityInfoEntry OBJECT-TYPE
SYNTAX SleMplsTpOamMaintanceEntityInfoEntry
MAX-ACCESS read-only
STATUS current
DESCRIPTION
"An entry in this table represents MPLS-TP maintenance
entity. This entry represents the ME if the source and
sink MEPs are defined.
A ME is a p2p entity. One ME has two such MEPs.
A MEG is a group of one or more MEs. One MEG can have
two or more MEPs.
For P2P LSP, one MEG has one ME and this ME is associated
two MEPs (source and sink MEPs) within a MEG.
Each sleMplsOamMeIndex value denotes the ME within a MEG.
In case of unidirectional point-to-point transport paths,
a single unidirectional Maintenance Entity is defined to
monitor it and sleMplsOamMeServicePointer points to
unidirectional point-to-point path.
In case of associated bidirectional point-to-point
transport paths, two independent unidirectional
Maintenance Entities are defined to independently monitor
each direction and each sleMplsOamMeServicePointer MIB
object points to unique unidirectional transport path.
This has implications for transactions that terminate at
or query a MIP, as a return path from MIP to source MEP
does not necessarily exist within the MEG.
In case of co-routed bidirectional point-to-point
transport paths, a single bidirectional Maintenance Entity
is defined to monitor both directions congruently and
sleMplsOamMeServicePointer MIB object points to co-routed
bidirectional point-to-point transport path.
In case of unidirectional point-to-multipoint transport
paths, a single unidirectional Maintenance entity for each
leaf is defined to monitor the transport path from the
root to that leaf and each leaf has different transport
path information in sleMplsOamMeServicePointer MIB object."
INDEX { sleMplsTpOamMaintanceEntityInfoMeIndex, sleMplsTpOamMaintanceEntityInfoMpIndex }
|
|
Disclaimer: The owner of this site does not warrant or assume any liability or responsibility for the accuracy, completeness, or usefulness of any information available on this page (for more information, please read the complete disclaimer).
All rights reserved © 2007-2024 |
