Stamatelakis, D. and Grover, W. D. (2000). Theoretical underpinnings for the efficiency of restorable networks using pre-configured cycles ("p-cycles"). IEEE Transactions on Communications, 48:1262--1265. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Survivable Network Design: Routing Of Flows And Slacks - Rajan, Atamtürk (Correct)
....than global link restoration (GLR) and therefore is often preferred in practice. The hierarchical spare capacity assignment (SCA) approach using p cycles has been reported to achieve much better capacity efficiency than ring architectures as well as very quick recovery times by several authors [12, 18, 20]. 2.3 Routing of Flows and Slacks In this section, we present a mixed integer programming model for routing failure flows and no failure flows simultaneously. Rather than using undirected p cycles to cover working link capacities from (NDP) we utilize directed p cycles of arcs to introduce ....
Stamatelakis, D. and Grover, W. D. (2000). Theoretical underpinnings for the efficiency of restorable networks using pre-configured cycles ("pcycles "). IEEE Transactions on Communications, 48:1262--1265.
Optimal Configuration of p-Cycles in WDM Networks - Schupke, al. (2002) (4 citations) (Correct)
....nodes over #### (the drawing is similar if done over the maximum allowed p cycle nodes) As the mean curve is situated nearer to the maximum curve, the optimization procedure (Section IV) tends to choose cycles with higher number of nodes. This is in accordance to the theoretical investigations of [5], stating that there should be a significant number [ of large p cycles. 0 2 4 6 8 10 12 nodes maximum allowed p cycle length in km maximum mean minimum Fig. 5. VWP case with 10 demand 1 and routing 1: the minimum, mean and maximum number of p cycle nodes over #### . B. WP ....
D. Stamatelakis and W.D. Grover, "Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles ("p-cycles")," IEEE Trans. on Comm., vol. 48, Aug 2000.
Capacity-efficient Planning of Resilient Networks with p-Cycles - Gruber, Schupke (2002) (Correct)
....p Cycle (b) reserved capacity = 4 10 = 40) and with a combination of two p Cycles (c) reserved capacity = 4 6 3 4 = 36) It is obvious, that the possible number of straddling links of a p Cycle will increase by its length. In fact, longer p Cycles are accessible to more links than shorter ones [5]. However, they do require a reservation of the highest capacity amount on each of its links. For that reason, a combination of several smaller cycles each protecting a part of the network or even capacity fractions of protected links may reduce the total sum of reserved protection capacity. For ....
D. Stamatelakis and W.D. Grover, "Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles ("p-cycles")," IEEE Trans. on Comm., vol. 48, no. 8, Aug 2000.
Cross-Entropy Guided Ant-like Agents Finding Cyclic Paths in.. - Wittner, Helvik (2002) (1 citation) (Correct)
....path) as well as straddling links (links not traversed but having their end nodes on the path) Intuitively a Hamiltonian cyclic path, which by definition visits all nodes once in a network, would provide a cycle potentially able to protect against any single link failure. This is also argued in [16]. The CE algorithms from both [13] and [6] show good performance when tested on optimal Hamiltonian cyclic path search problems as long as the network environment is fully meshed (all nodes have direct duplex connections) Real world telecommunication networks are seldom fully meshed. An average ....
....than ever. This paper examines and enhances a distributed cross entropy founded algorithm designed to find cyclic paths (Hamiltonian cyclic paths) in networks. Such paths are argued to be good candidate paths when protection switching is to be implemented in meshed networks using p cycles [16]. The algorithm presented is well suited for distributed implementation, for instance using mobile agents or active networks technology. Previous versions of the algorithm [13,6] struggle to find Hamiltonian cyclic paths in scarcely meshed network, very much because of the strict selection ....
D. Stamatelakis and W.D. Grover, "Theoretical Underpinnings for the Efficiency of Restorable Networks Using Preconfigured Cycles ("p-cycles")," IEEE Transactions on Communications, vol. 48, pp. 1262--1265, August 2000.
Extending the p-Cycle Concept to Path-Segment Protection - Grover, Shen (2003) Self-citation (Grover) (Correct)
No context found.
D. Stamatelakis, W.D. Grover, "Theoretical Underpinnings for the efficiency of restorable networks using pre-configured cycles ("pcycles ")," IEEE Trans. Comm, vol.48, no.8, Aug. 2000, pp. 1262-1265.
Extending the p-Cycle Concept to Path Segment Protection for.. - Shen, Grover (2003) Self-citation (Grover) (Correct)
No context found.
D. Stamatelakis and W. D. Grover, "Theoretical underpinnings for the efficiency of restorable networks using pre-configured cycles ("p-cycles ")," IEEE Trans. Commun., vol. 48, pp. 1262--1265, Aug. 2000.
IP Layer Restoration and Network Planning Based on Virtual .. - Stamatelakis, Grover (2000) (8 citations) Self-citation (Stamatelakis Grover) (Correct)
....do any real time actions) and yet it exhibits the capacity efficiency characteristic of a span restorable mesh network. This remarkable combination of properties has been reported and explained by the authors in a series of prior works, primarily considering Sonet WDM type applications [3] 5] [23] [25] The task now is to consider adaptation of the cycle concept to an IP environment. B. Outline of Paper The paper follows these logical steps. First, to be relatively self contained, and because the cycle concept is relatively recent, we begin with a review of the basic cycle concept as ....
....claim. This section is therefore devoted to substantiating that motivating aspect of the present work, and to provide background about the basic cycle concept, before going on to consider cycles in the IP layer. This section can be supplemented for interested readers by references [3] 4] [23] [25] Reference [3] is the basic report of our first results with cycles where we found the total spare capacity required for 100 restoration in five test networks to be within 0 to 9 in excess of an optimal span restorable mesh, while the real time restoration switching remained BLSR like at ....
[Article contains additional citation context not shown here]
D. Stamatelakis and W. D. Grover, "Theoretical underpinnings for the efficiency of restorable networks using pre-configured cycles ("p-cycles ")," IEEE Trans. Commun., vol. 48, pp. 1262--1265, Aug. 2000.
Unknown - Survivable Network Design (Correct)
No context found.
Stamatelakis, D. and Grover, W. D. (2000). Theoretical underpinnings for the efficiency of restorable networks using pre-configured cycles ("p-cycles"). IEEE Transactions on Communications, 48:1262--1265.
Use of Backup Trees to Improve Resource Efficiency .. - Groebbens, Colle, .. (Correct)
No context found.
D. Stamatelakis, W.D. Grover, "Theoretical Underpinnings for the Efficiency of Restorable Networks Using Pre-configured Cycles ('p-cycles')", IEEE Transaction on Communications, Vol. 48, No. 8, August 2000
Reconfigurable wavelength-switched optical networks for the.. - Granger (2003) (2 citations) (Correct)
No context found.
D. Stamatelakis and W. D. Grover. Theoretical Underpinnings for the Efficiency of Restorable Networks Using Preconfigured Cycles ("p-cycles"). IEEE Transactions on Communications,
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