A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Novel approach to jointly optimize working and spare capacity of survivable optical networks
2020
Journal of optical communications
Preserved Fulltext
The minimum capacity utilization and survivability are the crucial requirement in such high speed optical networks. ...
The proposed joint capacity model provides fast restoration speed and guaranteed protection for optical network. ...
Arc (i, j) represents flow is from node i to node j and arc (j, i) represent flow is from node j to node i. ...
doi:10.1515/joc-2020-0228
fatcat:ocufzn7h3rfmzhnxf3xphiql2i
Survivable ATM mesh networks: Techniques and performance evaluation
2010
Journal of Systems and Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
They provide additional guidelines for the design of survivable ATM mesh-type networks, from a network reliability viewpoint. ...
Keywords: ATM Capacity and flow assignment Spare capacity Self-healing Path-based design approach Survivability Restoration ratio a b s t r a c t The Capacity and Flow Assignment problem in self-healing ...
Assuming that in an existing ATM network, the arc capacity and working VPs are known in advance, and the spare capacity on any arc is simply the remaining unused capacity on that arc, paper formulated ...
doi:10.1016/j.jss.2009.09.034
fatcat:vstq347ib5epbagitrctxw7xva
A Unified Approach to Survivability of Connection-Oriented Networks
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper deals with problems of computer networks survivability. We present and discuss survivability aspects of Content Delivery Networks (CDNs) and other services based on the anycast paradigm. ...
After that, we propose a new unified approach to network survivability. ...
If two or more servers are located in the same distance, we select a server with the highest capacity node calculated as a sum of capacity all arcs leaving the node in which the server is located. ...
doi:10.1007/11569596_3
fatcat:6olwdimauzcvxc5ra3aefo3xjy
Partition inequalities for capacitated survivable network design based on directed p-cycles
2008
Discrete Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We derive valid inequalities for the model based on the minimum capacity requirement between partitions of the nodes and give facet conditions for them. ...
In Section 3 we introduce valid inequalities for SNP based on the minimum capacity requirement between partitions of the nodes and give facet conditions for them. ...
GNP, which provisions the lowest possible capacity for survivable networks, requires about 30% spare capacity. ...
doi:10.1016/j.disopt.2007.08.002
fatcat:ylyw4gpf4vhqlmzbocxyfre5da
Survivable capacitated network design problem: new formulation and Lagrangean relaxation
2000
Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Amiri and Pirku’ obtained an average gap of 2.9% bet- ween BDB and BLB for a similar relaxation over networks without survivability requirements. ...
For a survey on capacity and survivability models, see Alevras et al.” ...
doi:10.1057/palgrave.jors.2600913
fatcat:cb64ivb47ncpvafdx4apuvxbkq
Page 575 of The Journal of the Operational Research Society Vol. 51, Issue 5
[page]
2000
The Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
For a survey on capacity and survivability models, see Alevras et al.” ...
In their paper, the authors present a continuous cost formulation for a multicommodity network flow problem without survivability requirements. ...
A directed cycle-based column-and-cut generation method for capacitated survivable network design
2004
Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We give strong valid inequalities that use the survivability requirements. We present a computational study with a column-and-cut generation algorithm for designing capacitated survivable networks. ...
A network is said to be survivable if it has sufficient capacity for rerouting all of its flow under the failure of any one of its edges. ...
Pricing Cycle Variables RFC has only one more constraint (4) for each arc than the network design problem without survivability require- ments. ...
doi:10.1002/net.20004
fatcat:xzohto7eavh25awbaeapycbyz4
Survivable Network Design: Routing of Flows and Slacks
[chapter]
2003
Operations Research/Computer Science Interfaces Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We present a new mixed-integer programming model and a column generation method for the survivable design of telecommunication networks. ...
Even though the complexity of pricing the exponentially many variables of the model is ¡ £ ¢ -hard, in our computational experiments, we are able to produce capacity-efficient survivable networks with ...
Interestingly, in contrast to (GLR), (RFS) requires only one additional constraint for each arc than the regular network design problem (NDP) without survivability requirement. ...
doi:10.1007/978-1-4757-3762-2_4
fatcat:7w3pduvvzza5xld2p7l5dbfeda
Modeling and optimization of maximum flow survivable overlay multicast with predefined routing trees
2013
Telecommunications Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Hence, we also design and evaluate heuristic searches dedicated to optimization of maximum flow survivable overlay multicast networks. ...
This paper focuses on modeling and optimization of overlay multicast networks aimed at realizing maximum throughput with survivability constraints, where survivability defines the ability of a multicast ...
and the source are credited. ...
doi:10.1007/s11235-013-9823-x
fatcat:7zuhg6xeujebvjrznzlne6ivt4
Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios
2008
Omega : The International Journal of Management Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
For the smallest instances (8 nodes, 10 origin-destination pairs, and 10 failure scenarios), the Benders implementation consumes only 10% of the time required by the mixedinteger programming formulation ...
Such a design must build enough capacity and diverse routing paths through the network to ensure that feasible multicommodity flows continue to exist, even when components of the network fail. ...
Rios, Marianov, and Gutierrez [28] study a similar survivable network problem in which capacities must be determined on the arcs. ...
doi:10.1016/j.omega.2006.05.006
fatcat:hhfkro4ihfgcnlbsulep4gk6wu
Response surface analysis of stochastic network performance
1989
Proceedings of the 21st conference on Winter simulation - WSC '89
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This occurs in spite of the fact that ten arcs from Nodes 8 and 9 to the sink nodes were screened for both capacity and survival rate. ...
This network differs from Network C in that several nodes and arcs are dependent on the survival rates of other nodes and arcs. ...
The capacity and survivability of the networks' nodes and arcs formed the parameters of interest in the experimental design used to develop a response surface model. ...
doi:10.1145/76738.76793
dblp:conf/wsc/BaileyBM89
fatcat:ydw66dmwqjbjvhpicsxz7q4ewq
Survivable Capacitated Network Design Problem: New Formulation and Lagrangean Relaxation
2000
Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
costs for each arc, find minimum cost capacity expansions such that these demands can be met even if a network component fails. ...
A set of traffic demands between several communicating node pairs is also given. There are specific survivability require- ments for every source-destination pair. ...
doi:10.2307/254188
fatcat:nba5achzf5ctzczizev6mb3gfi
Survivable network design under optimal and heuristic interdiction scenarios
2006
Journal of Global Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
certain survivability constraints under any single node or arc failure. ...
That is, the network is survivable if specified percentages of demands can be satisfied when any single node or arc fails. ...
Associated with each arc i ∈ A are a nonnegative Survivable Network Design 5 construction cost c i , a nonnegative interdiction cost b i , and an arc capacity q i . ...
doi:10.1007/s10898-006-9067-3
fatcat:ioyqzfwdangmjdxxnvihghzkvm
Survivable Network Design Problem in the Case of Arc Failure
2015
Indian Journal of Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This problem is about selecting a set of fixed-charge arcs inorder to build a survivable network with the cost being kept to a minimum and the flow requirements being satisfied. ...
The system is subject to failure and capacity restriction. Failure is defined as simultaneous failure of arcs. To solve the problem, first a mixed integer linear program is introduced. ...
constraints, and arc capacity requirements is called a feasible flow. ...
doi:10.17485/ijst/2015/v8is8/70746
fatcat:lvpmsvxpsfhkhdcd7orruqgk6e
Page 1612 of Mathematical Reviews Vol. , Issue 87c
[page]
1987
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
As a survivability measure, therefore, we define the generalized connectivity as the minimum number of events (rather than the minimum number of node removals) required to disconnect the network. ...
In this paper a branch-and-bound algorithm is given for finding the foremost arcs in a network with parametric arc capacities c; + Ad; (2 = 1,2,---,m), where X is a parameter which varies in the given ...
« Previous
Showing results 1 — 15 out of 7,531 results