On the public citation graph

Multi‐hour design of survivable classical IP networks

https://doi.org/10.1002/dac.551
0 signed · 49 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/1097-0037(200008)36:1<17::aid-net3>3.0.co;2-zopenalex-snapshot
Constrained length connectivity and survivable networks
inferredcites →https://doi.org/10.1002/net.3230190305openalex-snapshot
Networks synthesis and optimum network design problems: Models, solution methods and applications
inferredcites →https://doi.org/10.1007/bf01386316openalex-snapshot
Partitioning procedures for solving mixed-variables programming problems
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01585693openalex-snapshot
On an instance of the inverse shortest paths problem
inferredcites →https://doi.org/10.1007/bf02114303openalex-snapshot
Multi-hour design of computer backbone networks
inferredcites →https://doi.org/10.1007/bf02999404openalex-snapshot
Multihour engineering and traffic routing optimization in hierarchical telephone networks
inferredcites →https://doi.org/10.1007/s002110050054openalex-snapshot
A polyhedral approach to multicommodity survivable network design
inferredcites →https://doi.org/10.1016/0377-2217(96)00007-0openalex-snapshot
General local search methods
inferredcites →https://doi.org/10.1023/a:1019148207669openalex-snapshot
Some approaches to solving a multihour broadband network capacity design problem with single-path routing
inferredcites →https://doi.org/10.1109/26.297842openalex-snapshot
Capacity planning of private networks using DCS under multibusy-hour traffic
inferredcites →https://doi.org/10.1109/90.251898openalex-snapshot
Dimensioning of adaptively routed networks
inferredcites →https://doi.org/10.1109/90.650152openalex-snapshot
Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing
inferredcites →https://doi.org/10.1109/90.664269openalex-snapshot
Optimal capacity and flow assignment for self-healing ATM networks based on line and end-to-end restoration
inferredcites →https://doi.org/10.1109/infcom.1999.751452openalex-snapshot
A new approach to routing with dynamic metrics
inferredcites →https://doi.org/10.1109/infcom.2000.832225openalex-snapshot
Internet traffic engineering by optimizing OSPF weights
inferredcites →https://doi.org/10.1109/infcom.2001.916782openalex-snapshot
Internet traffic engineering without full mesh overlaying
inferredcites →https://doi.org/10.1109/milcom.1989.103929openalex-snapshot
Performance of the revised routing metric in the ARPANET and MILNET
inferredcites →https://doi.org/10.1109/tac.1982.1102884openalex-snapshot
Dynamic behavior of shortest path routing algorithms for communication networks
inferredcites →https://doi.org/10.1137/s0895480100377428openalex-snapshot
Internet Routing and Related Topology Issues
inferredcites →https://doi.org/10.1145/141800.141805openalex-snapshot
Analysis of shortest-path routing algorithms in a dynamic network environment
inferredcites →https://doi.org/10.1287/ijoc.1.3.190openalex-snapshot
Tabu Search—Part I
inferredcites →https://doi.org/10.17487/rfc1058openalex-snapshot
Routing Information Protocol
inferredcites →https://doi.org/10.17487/rfc1142openalex-snapshot
OSI IS-IS Intra-domain Routing Protocol
inferredcites →https://doi.org/10.17487/rfc1583openalex-snapshot
OSPF Version 2
inferredcites →https://doi.org/10.2307/1911818openalex-snapshot
The Decomposition Algorithm for Linear Programs
inferredcites →https://doi.org/10.7551/mitpress/4931.003.0017openalex-snapshot
*13 Simulated Annealing and Boltzmann Machines

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/dac.2733openalex-snapshot
Multi‐topology routing based egress selection approach to achieve hybrid intra‐AS and inter‐AS traffic engineering
inferred← citeshttps://doi.org/10.1002/net.20163openalex-snapshot
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
inferred← citeshttps://doi.org/10.1002/net.20303openalex-snapshot
Approximability of unsplittable shortest path routing problems
inferred← citeshttps://doi.org/10.1002/net.21461openalex-snapshot
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
inferred← citeshttps://doi.org/10.1002/net.21792openalex-snapshot
Open shortest path first routing under random early detection
inferred← citeshttps://doi.org/10.1007/11422778_51openalex-snapshot
Making IGP Routing Robust to Link Failures
inferred← citeshttps://doi.org/10.1007/978-3-540-45076-4_34openalex-snapshot
HIDRA: HIstory Directed Routing Algorithm for IP Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77903-2_2openalex-snapshot
Routing and Capacity Optimization for IP Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_8openalex-snapshot
Optimization of OSPF Routing in IP Networks
inferred← citeshttps://doi.org/10.1007/bf03002698openalex-snapshot
Calcul des métriques de routage pour Internet
inferred← citeshttps://doi.org/10.1007/s10288-009-0113-0openalex-snapshot
Intra-domain traffic engineering with shortest path routing protocols
inferred← citeshttps://doi.org/10.1007/s10479-012-1270-7openalex-snapshot
Intra-domain traffic engineering with shortest path routing protocols
inferred← citeshttps://doi.org/10.1016/b978-012557189-0/50024-xopenalex-snapshot
BIBLIOGRAPHY
inferred← citeshttps://doi.org/10.1016/j.comnet.2010.10.013openalex-snapshot
Multi-hour network planning based on domination between sets of traffic matrices
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2004.05.003openalex-snapshot
On the joint link dimensioning and routing metric assignment problem for reliable WDM networks
inferred← citeshttps://doi.org/10.1016/s0967-0661(03)00055-8openalex-snapshot
Integration of pricing models between best-effort and guaranteed performance services in telecommunication networks
inferred← citeshttps://doi.org/10.1109/drcn.2007.4762277openalex-snapshot
Between fully dynamic routing and robust stable routing
inferred← citeshttps://doi.org/10.1109/jlt.2012.2232281openalex-snapshot
Survivable Topology Design of Submarine Networks
inferred← citeshttps://doi.org/10.31428/10317/1762openalex-snapshot
Optimización y planificación de redes ópticas transparentes WDM
inferred← citeshttps://doi.org/10.4018/978-1-5225-7146-9.ch007openalex-snapshot
Future Networks
inferred← citeshttps://doi.org/10.4018/978-1-7998-7708-0.ch028openalex-snapshot
Future Networks
inferred← citeshttps://doi.org/10.4018/jitn.2013010103openalex-snapshot
Designing an IP Link Topology for a Metro Area Backbone Network
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.