D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis," IEEE Transactions on Communications, Vol. 42 No. 2/3/4, March/April 1994, pp. 534-548.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....that assumptions of a particular family of modularities might have on our results and their interpretation. 2.3. Other literature Other work on variations of the problem of mesh restorable capacity design, all with the topology given include [7,13,22,29,37,39,48] Contributions by Medhi [35,36] also consider restoration of circuit switched services from a unified approach involving both transport layer and circuit layer dynamic routing strategies. Pioro and Szczesniak [42] apply a dual Benders decomposition method to solve some related multi layer formulations. The multi layer aspect ....

D. Medhi, A unified approach to network survivability for teletraffic networks: models, algorithms and analysis, IEEE Trans. on Communications 42 (1994) 534--548.

....and restriction that assumptions of a particular family of modularities might have on our results and their interpretation. 2. 3 Other literature Other work on variations of the problem of mesh restorable capacity design, all with the topology given include [21 27] Contributions by Medhi [28, 29] also consider restoration of circuit switched services from a unified approach involving both transport layer and circuit layer dynamic routing strategies. Pioro and Szczesniak [30] apply a dual Benders decomposition method to solve some related multi layer formulations. The multi layer aspect ....

D. Medhi, "A unified approach to network survivability for teletraffic networks: models, algorithms and analysis, IEEE Trans. on Communications, vol.42, 1994, pp.534-548.

No context found.

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis," IEEE Transactions on Communications, Vol. 42 No. 2/3/4, March/April 1994, pp. 534-548.

No context found.

D. Medhi, "A unified approach to network survivability for teletraffic networks: models, algorithms and analysis", IEEE Transactions on Communications, vol. 42, pp 534-548, 1994.

No context found.

D. Medhi, A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis, IEEE Transactions on Communications, Vol. 42, pp. 534-548, 1994.

.... last decade, the design of distributed, both hierarchical and non hierarchical, management systems as well as customer network management has attracted the attention of many researchers, e.g. 1, 2, 3, 8] While the need for inter relating between different networks have received some attention [4, 5], there is little work in the dynamic multi layered network management architecture in a multi ownership environment. Our attempt here is to address the management framework in this area, specifically in the context of survivability. II Architectural Framework In a more detailed report [6] we ....

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis," IEEE Trans. Comm., Vol. 42, pp. 534-548,

....different levels of survivable services. In this formulation, we also incorporate ideas such as hard or soft survivable capability (discussed in the next section) While, over the years, network survivability has been addressed for circuit switched, ATM and fiber networks (see, for example, [2, 3, 4, 5, 8, 9, 10, 13, 15] for a sampling of work) MPLS allows the capability to address traffic engineering along with survivability for a new class of problems. For example, Wang and Wang [14] have addressed the explicit routing models for MPLS traffic engineering. The work that is closest to ours is by Kodialam and ....

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis," IEEE Trans. Communications, Vol. 42, pp. 534-548, 1994.

....is not incorporated, a network (where services do backlog traffic after a failure) may be under designed resulting in noticeably longer transient period than any acceptable threshold. 1. INTRODUCTION Designing networks for survivability has received considerable attention in recent years [2, 3, 9, 11, 13, 16, 17, 19, 21, 22, 26, 27]. For ATM based broadband networks, multi layer network survivability and restoration can be possible at the following levels: transmission level, virtual path level, and virtual circuit or connection call level. At transmission level, SONET self healing ring for restoration is a viable ....

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis," IEEE Trans. on Communications , Vol. 42, pp. 534-548, 1994.

....of a link failure in a generic virtual circuit based packet network. While the impact on the traffic performance due to a failure in the presence of routing has received considerable attention in circuit switched networks (that employ dynamic routing) and virtual circuit based packet networks [2, 12, 17, 19, 23, 24, 30, 34, 37], it has received little attention in the case of TCP IP network. In fact, most of the work devoted to TCP performance and its extension consider a single link or a linear network (no routing) in their studies. Another congestion (rather, a perceived congestion) at the TCP level can be due to ....

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms, and Analysis," IEEE Trans. Commm., Vol. 42, pp. 535-548, 1994.

....routing network (see, for example, 3] 4] 5] 6] Network survivability and restoration have been gaining attention in recent years. Designing for survivability has been addressed by several researchers for various networks (for example, see, 7] 8] 9] 10] 11] 12] 13] 14] [15]) Results on network performance under a failure for wide area circuit switched networks have been presented in ( 2] 12] 16] 17] 18] and for wide area packet networks in [19] Network restoration has also been addressed by several researchers; e.g. Coan et al. [20] have presented a ....

.... and restoration by looking at a layered view of the network, and have considered trade off of doing restoration either in the traffic network or in the transmission network or in both (it may be noted that this is done beyond what we have addressed in a previous work towards network survivability [15]) They present their analysis for a symmetric network. The authors indeed have made an important contribution towards understanding the trade off of restoration at various level. However, our focus is more on understanding the difference between connection based restoration and load directed ....

[Article contains additional citation context not shown here]

D. Medhi, A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis, IEEE Trans. on Communications , Vol. 42, pp. 534-548, 1994.

....from the managers of the physical layer network is useful in initiatingrecovery mechanisms for affected links. 6.1. Illustrative Examples We now discuss two simple illustrative examples to show the need for multi network coordination. More extensive results along this line can be found in [13, 16]. The first example consists of four nodes in the provider network and three nodes in the user network as shown in Figure 3. The links connecting the nodes U0, U1 and U2 in the user network are logical links which are routed through the physical links in the provider network. Each of these ....

D. Medhi. A unified approach to network survivability for teletraffic networks: Models, algorithms and analysis. IEEE Trans. on Communications, 42:534--548, 1994.

....problem in terms of whether to integrate or not (see also [42] this issue certainly deserves further investigation. For the purpose of our numerical results, we consider here two STQoS classes. To obtain the results, we use three realistic example networks which we have used in other studies [31]; these example networks are extracted from an actual voice network spanning the continental US. Topological information for these example networks are given in Table 1 (also see Figures 2, 3 and 4) Note that in these networks a circle and a square together means that an ATM switching node is ....

.... ( j log(p) Gamma log(p) j ffi ) do for some tolerance ffi 0 b = b l b h ) 2 p = AMS(N;R peak ; ae; m; b; r) if ( p p ) then b l = b else b h = b endif endwhile return(b) 20 Acknowledgement The network data used in this work is based on data provided for another work [31] by Sprint Corporation and is greatly appreciated. We are thankful to the anonymous referees for many helpful comments and for bringing to our attention several references which certainly helped improve the content and the presentation of this paper. ....

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis," IEEE Trans. on Communications , Vol. 42, pp. 534-548, 1994.

....the network to a failure is a critical issue. While there has been considerable work on understanding the impact of a network failure on routing, design and performance for other types of networks such as circuit switched networks, virtual circuit based packet networks including ATMbased networks [2, 3, 8, 11, 12, 19, 21], there has been very limited work in this area for IP datagram networks. In this work, we consider the issue of network performance of a wide area datagram network, such as the Internet, supporting multicast traffic along with unicast traffic, especially when subjected to a link failure. Failure ....

....Additionally, to reduce loss of packets for multicast services or to reduce delay for unicast services under a failure, having priority queueing at the nodes is desirable; but, more importantly, the network has to be dimensioned appropriately. Similar to the work done for other types of networks [5, 11, 12], proper network dimensioning methods need to be developed to address for multicast based services that have quality of service requirements, and, especially, to address for a network outage. Acknowledgement We like to thank the developers of MaRS at the University of Maryland for making MaRS ....

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis," IEEE Trans. Commun., Vol. 42, pp. 534-548, 1994.

....variation during the day) and dynamic network reconfigurability. There has been a considerable amount of work done on dimensioning for various types of dynamic call routing for single service (voice) circuit switched networks and their advantages have been quantified [3] 5] 9] 14] 20] [25], 32] and some work on considering (single service) switched and cross connect networks together has also been addressed [4] 15] 22] 29] primarily for single service networks to address network survivability. Broadband networks based on ATM, however, provide flexibility through bandwidth ....

....B ISDN) then we can use A = a; T = R; QoS = GoS = 1 call blocking; where a is the offered load in erlangs and R is the peak rate bandwidth required for each connection, GoS stands for the grade of service. In this case, the bandwidth requirement can be computed using an approximation as used in [25], 33] for singleservice networks. Similarly, an approximation given for multiple traffic types under loss mode with differing bandwidth requirement per call as given in [28] may be used to define a service class in our present framework, or these traffic types may be classified into different ....

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis, " IEEE Trans. on Communications, Vol. 42, pp. 534-- 548, 1994.

....this issue certainly deserves further investigation, and is, however, beyond the scope of this paper) For the purpose of this work, we consider here two STQoS classes each with one traffic type for computational work. We use here three realistic example networks which we have used in other work [23]; these example networks are extracted from an actual voice network spanning the continental US. Topological information for these example networks are given in Table 1 (also see Figures 2, 3 and 4) Note that in these networks a circle and a square together means that an ATM switching node is ....

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis, " IEEE Trans. on Communications, Vol. 42, pp. 534548, 1994.

....100 ms for the packet switched network case. It is easy to see that this will reduce the additional capacity requirements in both cases. Even though additional capacity can meet GoS requirement under a failure, the actual network topology layout and routing are also critical for survivable design [24]. Thus, we also need to understand the network connectivity d.medhi 5 requirement for the purpose of survivability. For instance, a network needs to be minimally two edge connected to address a single link failure; this means that there must be two links connected to each node so that if one of ....

....preparation. Of course, one way is to have additional spare capacity in the network. However, there can be a failure in the network that can actually take away the spare capacity if the network is not designed properly because of dependency between the logical network and the physical network [24]. Thus, it is necessary to audit the network and find the vulnerable points in the network and then to equip the network with additional capabilities to avoid such vulnerabilities. For example, 1. The network may be provided with transmission level diversity so that for any transmission link ....

[Article contains additional citation context not shown here]

D. Medhi, A unified approach to network survivability for teletraffic networks: Models, algorithms and analysis. IEEE Trans. Commun., 42: 535-548, 1994.

....traffic type as already discussed in section 2; for illustration of our approach, we limit to two STQoS classes where each class has different on off traffic descriptor values and quality of service requirements. We use here three realistic example networks which we have used in other work [33]; these example networks are extracted from an actual voice network spanning the continental US. Topological information for these example networks are given in Table 1 (also see Figs. 2, 3 and 4) Note that in these networks a circle and a square together means that an ATM switching node is ....

.... while ( j log(p) Gamma log(p) j ffi ) do for some tolerance ffi 0 b = b l b h ) 2 p = AMS(N; ae; m; R peak ; b; r) if ( p p ) then b l = b else b h = b endif endwhile return(b) Acknowledgement The traffic data used in this work is based on data provided for another work [33] by Sprint Corporation and is greatly appreciated. An earlier version of this paper has been presented at the Infocom 95. 19 ....

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis," IEEE Trans. on Communications , vol. 42, pp. 534-548, 1994.

....and by the NSF grant CDA 9422092. y Author for Correspondence To appear in Telecommunication Systems 1. Introduction Multi hour network design for various communication networks, especially for circuit switched networks, has been addressed by several researchers [3] 13] 14] 16] 25] [37], 38] 45] 46] 49] over the years. In multi hour models, network traffic is considered for different hours during the day to reflect within the day load variation; this is done especially to take advantage of noncoincidence of busy hour (peak) loads between different node pairs in the ....

....consider three load hours during the day, i.e. H = 3, and two traffic types, i.e. S = 2. The first three test problems R7, R10 and R15 (see Figures 1, 2, and 3) are extracted from real networks, including the traffic pattern at different times during the day for one traffic type (voice service) [37]. Here the number after R represents the number of traffic nodes in the topology. Due to the non availability of measurement based traffic patterns for a second traffic type, the traffic load was uniformly generated for the second traffic class from the load for the first traffic class for these ....

[Article contains additional citation context not shown here]

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis," IEEE Trans. on Communications , Vol. 42, pp. 534-548, 1994.

No context found.

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis", IEEE Trans. On Communications, Vol. 42, pp. 534-548, 1994.

No context found.

D. Medhi, "A unified approach to network survivability for teleftrafic networks: models, algorithms and analysis, IEEE Trans. on Communications, vol.42, 1994, pp.534-548.

No context found.

Medhi D., A Unified Approach to Network Survivability for Teletraffic Networks: models, Algorithms and Analysis, IEEE Trans. Comm., Vol.42, No2/3/4, Feb./March/April 1994.

No context found.

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis", IEEE Transactions on Communications, 42, Nr. 2/3/4, February/March/April 1994.

No context found.

D. Medhi, "A unified approach to network survivability for teletra#c networks: Models, algorithms and analysis," IEEE Trans. Commun., vol.42, no.2/3/4, pp.534--547, 1994.

No context found.

D. Medhi, "A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis," IEEE Transactions on Communications, Vol. 42 No. 2/3/4, March/April 1994, pp. 534-548.

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