W. D. Grover and J. Doucette, "Design of a meta-mesh of chain subnetworks: Enhancing the attractiveness of mesh-restorable WDM networking on low connectivity graphs," IEEE J. Select. Areas Commun., Special Issue on WDM-Based Network Architectures, vol. 20, pp. 47--61, Jan. 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Ultra Long Haul transmission and Reconfigurable OADMs.. - Geary, Antonopoulos.. (2003) (Correct)
....mesh networks using ULH transmission and R OADMs at degree 2 nodes, and to find the most important influencing network, traffic and cost parameters. 2. CHAINS OF NODES IN A ULH LINE SYSTEM Mesh networks with low average node degree (low connectivity) exhibit linear chains of nodes of degree 2 [10], bounded by nodes of degree 3 or higher at the two ends of the chain. The lower the connectivity, the longer these chains generally become. Such chains can potentially make use of both the ULH extended reach, and R OADMs to express traffic along the chain transparently. A clear advantage of ....
.... Modify operations for the annealing include adding and removing links from the candidate link set, and swapping a removed link with a currently active link. An important observation is that as the network connectivity decreases, there is a greater likelihood of chains forming in the topology [10]. Therefore the remove link modify operation is given the highest probability in the Simulated Annealing optimisation loop. The goal then becomes to remove enough links to permit long chains with a high proportion of transit traffic to form, thus matching the characteristics of ULH as shown in ....
W. Grover, J. Doucette, 'Design of a Meta-Mesh of Chain Subnetworks: Enhancing the Attractiveness of Mesh-Restorable WDM Networking on Low Connectivity Graphs', IEEE Journal On Selected Areas In Communications, Vol. 20, No. 1, January 2002.
Introducing optical transparency into core networks with.. - Neil Geary Georgia (2002) (Correct)
....with a current link. The idea behind Simulated Annealing is that the optimisation loop will avoid local minima via occasional acceptance of higher cost solutions. An important observation is that as the network connectivity decreases, there is a greater likelihood of chains forming in the topology [4]. Therefore the remove link modify operation is given the highest probability in the Simulated Annealing optimisation loop. The goal then becomes to remove enough links to permit long chains with a high proportion of transit traffic to form, thus matching the characteristics of ULH as shown ....
W. Grover, J. Doucette, 'Design of a Meta-Mesh of Chain Subnetworks: Enhancing the Attractiveness of Mesh-Restorable WDM Networking on Low Connectivity Graphs', IEEE Journal On Selected Areas In Communications, Vol. 20, No. 1, January 2002.
Extending the p-Cycle Concept to Path Segment Protection for.. - Shen, Grover (2003) Self-citation (Grover) (Correct)
No context found.
W. D. Grover and J. Doucette, "Design of a meta-mesh of chain subnetworks: Enhancing the attractiveness of mesh-restorable WDM networking on low connectivity graphs," IEEE J. Select. Areas Commun., Special Issue on WDM-Based Network Architectures, vol. 20, pp. 47--61, Jan. 2002.
Capacity design studies of span-restorable mesh transport.. - Doucette, Grover (2002) Self-citation (Grover Doucette) (Correct)
.... are shared backup path protection (SBPP) 2] 3] 1 1 automatic protection switching (APS) 4] and dynamic path restoration [5] Aside from dedicated 1 1 APS, the path oriented schemes involving sharing of spare capacity tend to be more efficient in terms of spare capacity requirements [5] 6] [7] than span oriented schemes. But this comes at a corresponding price in design complexity and possibly speed as well due to the greater geographical extent of the recovery process. Dynamic (i.e. adaptive, failure dependent) path restoration with stub release is the most capacity efficient of all ....
....span restoration, effecting a partial and specific form of step towards more generalized and efficient path restoration. This is ultimately the same reason that the reduction of spare capacity obtained with the special forms of chain sub network bypass considered in the meta mesh design concept of [7]. But it bears explaining how an SRLG and a nodal bypass differ because at first glance they can seem to be almost identical arrangements that cause one physical failure to escalate into two logical failures. To do this Figure 3 (b) shows a co incident SRLG situation. The main difference between ....
[Article contains additional citation context not shown here]
W. D. Grover, J. Doucette, "Design of a Meta-Mesh of Chain Sub-Networks: Enhancing the Attractiveness of Mesh-Restorable WDM Networking on Low Connectivity Graphs," IEEE Journal on Selected Areas in Communications (JSAC), vol. 20, no. 1, pp. 47-61, January 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC