Traffic demand matrix
Traffic demand matrix is a matrix indicating how many capacity units are required between each node pair in a network. For network planning, such a matrix is often forecasted based on historic data. In the matrix, each element is called demand units, which represents how many capacity units required between the node pair. Each unit corresponds to a digital hierarchy, e.g., OC-3. In addition, in optical transport networks demand requests are often bi-directional, which means that there is the same number of demand units from node A to node Z and from node Z to node A. Under this bi-directionality, the traffic demand matrix is symmetric. Depending on the protection requirement, a demand matrix can be an unprotected demand matrix, or a protected demand matrix with a certain type of protection technique.
Random Posts
- February 20, 2010 -- Bi-directional line switched ring (BLSR) (0)
[caption id="attachment_68" align="alignleft" width="300" caption="Fig. 1(a) BLSR normal"][/caption]... - February 23, 2010 -- Span restorable networks (0)
[caption id="attachment_93" align="alignleft" width="300" caption="Fig. 1(a) Span restorable network... - February 10, 2010 -- M:N link protection (0)
[caption id="attachment_118" align="alignleft" width="300" caption="M:N link protection"][/caption]
... - February 25, 2010 -- Path restoration (PR) (0)
[caption id="attachment_111" align="alignleft" width="300" caption="Fig. 1(a) Path restoration (with...
