Result 1 to 10 of 10 total
A polynomial multicommodity flow problem with difficult path generation (English)
ICUMT, 1-5 (2011).
1
SNDlib 1.0 ‒ survivable network design library. (English)
Networks 55, No. 3, 276-286 (2010).
2
On the complexity of resilient network design. (English)
Networks 55, No. 2, 108-118 (2010).
3
Optimization of OSPF routing in IP networks. (English)
Koster, Arie M. C. A. (ed.) et al., Graphs and algorithms in communication networks. Studies in broadband, optical, wireless and ad hoc networks. Berlin: Springer (ISBN 978-3-642-02249-4/hbk; 978-3-642-02250-0/ebook). Texts in Theoretical Computer Science. An EATCS Series, 199-240 (2010).
4
Complexity of resilient network optimisation (English)
European Transactions on Telecommunications 20, No. 7, 701-709 (2009).
5
A distributed scheme for optimization of interdomain routing between collaborating domains (English)
Annales des Télécommunications 63, No. 11-12, 631-638 (2008).
6
A subgradient optimization approach to inter-domain routing in IP/MPLS networks (English)
Networking, 1241-1244 (2007).
7
Distributed inter-domain link capacity optimization for inter-domain IP/MPLS routing (English)
GLOBECOM, 1872-1877 (2007).
8
Design of mixed MPLS/OSPF routing in IP networks. (English)
Syst. Sci. 32, No. 3, 55-59 (2006).
9
A polynomial algorithm for solving a general Max-min fairness problem (English)
European Transactions on Telecommunications 16, No. 3, 233-240 (2005).
10
Result 1 to 10 of 10 total
Start
Contact
Print
General Help
