R. Albert, A. Barabàsiacl00, ]. W. Aiello, F. Chung, and L. Lu, Topology of Evolving Networks: Local Events and Universality, Proceedings of STOC'00, 32nd annual ACM symposium on theory of computing, pp.5234-171180, 2000.
DOI : 10.1103/PhysRevLett.85.5234

E. N. Aschenbruck, M. Gerhards-padilla, M. Gerharz, P. Frank, and . Martini, Modelling mobility in disaster area scenarios, Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems , MSWiM '07, 2007.
DOI : 10.1145/1298126.1298131

]. W. Arn51 and . Arnoldi, The principle of minimized iterations in the solutions of the matrix eigenvalue problems, Quart. Appl. Math, vol.19, p.1729, 1951.

]. K. Ati92 and . Atif, Modellisation du parallelisme et de la synchronisation, Thèse de l'Institut National Polytechnique de Grenoble, 1992.

]. O. Aud07 and . Audouin, CARRIOCAS description and how it will require changes in the network to support Grids, 20th Open Grid Forum, 2007.

[. Barabàsi and R. Albert, Emergence of scaling in random networks, Science, vol.286, issue.5439, p.509, 1999.

]. S. Bbc-+-98, D. Blake, M. Black, E. Carlson, Z. Davies et al., RFC 2475 an architecture for dierentiated services, 1998.

. G. Bbc-+-05-]-e, D. Boman, §. Bozda, U. Catalyurek, A. H. Gebremedhin et al., A scalable parallel graph coloring algorithm for distributed memory computers, Proceedings of EuroPar 2005 Parallel Processing, p.241251, 2005.

A. [. Bouabdallah, E. Beylot, G. Dotaro, and . Pujolle, Resolving the fairness issue in bus-based optical access networks, IEEE JSAC, vol.23, issue.8, p.14441457, 2005.

]. A. Bbf-+-03, L. Benoit, P. Brenner, B. Fernandes, W. J. Plateau et al., The PEPS Software Tool, Computer Performance Evaluation, p.98115, 2003.

D. [. Benallouche, O. Barth, and . Marcé, Minimizing Routing Delay Variation in Case of Mobility, 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, p.370375, 2009.
DOI : 10.1109/WiMob.2009.69

]. D. Bcg-+-05, §. Bozda, U. Catalyurek, A. H. Gebremedhin, F. Manne et al., A parallel distance-2 graph coloring algorithm for distributed memory computers, High Performance Computing and Communcations, p.796806, 2005.

]. J. Bea89 and . Beasly, An SST-based algorithm for the Steiner problem in graphs, Networks, vol.19, 1989.

. Beh-+-07-]-g, T. Di-battista, A. Erlebach, M. Hall, M. Patrignani et al., Computing the types of the relationships between autonomous systems, IEEE/ACM Transactions on Networking, vol.15, issue.2, p.267280, 2007.

L. [. Barth, C. Echabbi, S. Hamlaoui, and . Vial, An economic and algorithmic model for QoS provisioning BGP interdomain network, Proceedings of the EuroNGI Workshop on QoS and Trac Control, 2005.

]. C. Ber66 and . Berge, The theory of graphs and its applications, 1966.

]. C. Bet01 and . Bettstetter, Smooth is better than sharp : a random mobility model for simulation of wireless networks, Proceedings of the 4th ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, p.1927, 2001.

J. Byrka, F. Grandoni, T. Rothvoÿ, and L. Sanita, An improved LP-based approximation for steiner tree, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, 2010.
DOI : 10.1145/1806689.1806769

A. [. Bai and . Helmy, Wireless ad hoc and sensor networks, chapter A survey of mobility modeling and analysis in wireless ad hoc networks, 2004.

T. [. Barth, D. Mautor, . Villa, and . Monteiro, Impact of Alliances on End-to-End QoS Satisfaction in an Interdomain Network, 2009 IEEE International Conference on Communications, p.16, 2009.
DOI : 10.1109/ICC.2009.5199065

D. [. Bu and . Towsley, On distinguishing between Internet power law topology generators, Proceedings of INFOCOM'02, 21st IEEE International Conference on Computer Communications, p.638647, 2002.

. [. Callegati, Research on Optical Core Networks in the e-Photon/ONe Network of Excellence, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, p.15, 2006.
DOI : 10.1109/INFOCOM.2006.14

H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, Towards capturing representative AS-level Internet topologies, Computer Networks, vol.44, issue.6, pp.737-755, 2004.
DOI : 10.1016/j.comnet.2003.03.001

G. [. Castel and . Hebuterne, Performance Analysis of an Optical MAN Ring for Asynchronous Variable Length Packets, Proceedings of IEEE ICT, 2004.
DOI : 10.1007/978-3-540-27824-5_30

]. S. Cn98a, K. Chen, and . Nahrstedt, An overview of quality-of-service routing for the next generation high-speed networks : Problems and solutions, IEEE Networks, vol.12, issue.6, pp.64-79, 1998.

]. S. Cn98b, K. Chen, and . Narhstedt, On nding multi-constrainted paths, Proceedings of ICC'98, IEEE International Conference on Communications, p.874879, 1998.

D. [. Chiaroni, C. Neilson, J. Simonneau, and . Antona, Novel optical packet switching nodes for metro and backbone networks, Proceedings of ONDM, 2010.

Y. [. Cidon and . Ofek, MetaRing a full duplex ring with fairness and spatial reuse, IEEE Trans. on Comm, vol.41, issue.1, p.110120, 1993.

O. [. Cardwell, H. Wasem, and . Kobrinski, WDM architecture and economics in metropolitan area, SPIE Optical Network Mag, 2000.

]. M. Dav81 and . Davio, Kronecker product and shue algebra, IEEE Trans on Comp, vol.20, issue.2, pp.116-125, 1981.

A. [. Dolev, S. Israeli, and . Moran, Uniform dynamic self-stabilizing leader election. Distributed Algorithms, p.167180, 1997.

. A. Dkf-+-07-]-x, D. V. Dimitropoulos, M. Krioukov, B. Fomenkov, Y. Huaker et al., AS relationships : inference and validation, Computer Communication Review, vol.37, issue.1, p.2940, 2007.

]. M. Doa96 and . Doar, A better model for generating test networks, Proceedings of GLOBE- COM'96, IEEE Global Telecommunications Conference, p.8693, 1996.

S. [. Djukic and . Valaee, Link Scheduling for Minimum Delay in Spatial Re-Use TDMA, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications
DOI : 10.1109/INFCOM.2007.12

. Edf and . Edf, Le rapport interne d'EDF pour le projet CARRIOCAS

. E. Ed and . Mannie, RFC 3945 generalized multi-protocol label switching (GMPLS) architecture, 2004.

A. [. Farrel, J. P. Ayyangar, and . Vasseur, RFC 6051 inter-domain MPLS and GM- PLS trac engineering ressource reservation protocol trac engineering (RSVP- TE) extentions, 2008.

C. [. Foster and . Kesselman, Globus: a Metacomputing Infrastructure Toolkit, International Journal of High Performance Computing Applications, vol.11, issue.2, p.115128, 1997.
DOI : 10.1177/109434209701100205

C. [. Foster and . Kesselman, The anatomy of the grid : Enabling scalable virtual organizations, International Journal of High Performance Computing Applications, vol.5, issue.3, p.200202, 2001.

C. [. Foster and . Kesselman, Computational Grids, The Grid : Blueprint for a New Computing Infrastructure, 2002.
DOI : 10.1007/3-540-44942-6_2

]. I. Fos05 and . Foster, Globus toolkit version 4 : Software for service-oriented systems, LNCS, vol.3779, p.213, 2005.

C. [. Feigenbaum, R. Papadimitriou, S. Sami, and . Shenker, A BGP-based mechanism for lowest-cost routing, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, p.173182, 2002.
DOI : 10.1145/571825.571856

. [. Gravey, Multiservice optical network : Main concepts and rst achievements of the ROM Project, IEEE Journal of Lightwave Technology, vol.19, p.2331, 2001.

. Ph, M. F. Gill, Z. Arlitt, A. Li, and . Mahanti, The attening Internet topology : Natural evolution, unsightly barnacles or contrived collapse, Proceedings of PAM, p.110, 2008.

]. L. Gao01 and . Gao, On inferring autonomous system relationships in the Internet, IEEE/ACM Transactions on Networking, issue.96, p.73745, 2001.

D. [. Ge, S. Figueiredo, L. Jaiswal, and . Gao, On the hierarchical structure of the logical Internet graph, Proceedings of SPIE ITCOM'01, Conference on Multimedia Systems and Applications, p.208222, 2001.

T. [. Gao, J. Grin, and . Rexford, Inherently safe backup routing with BGP, Proceedings of INFOCOM'01, 20th Annual Joint Conference of the IEEE Computer and Communications Societies, p.547556, 2001.

]. A. Gib85 and . Gibbons, Algorithmic Graph Theory, 1985.

D. [. Garey and . Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness. W. H. Freeman and company, 1979.

A. [. Guerin and . Orda, QoS based routing in networks with inaccurate information: theory and algorithms, Proceedings of INFOCOM '97, p.7583, 1997.
DOI : 10.1109/INFCOM.1997.635116

J. [. Gao and . Rexford, Stable Internet routing without global coordination, Proceedings of SIGMETRICS'00, ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, p.307317, 2000.

H. [. Gerstel and . Raza, On the synergy between electrical and photonic switching, IEEE Communications Magazine, vol.41, issue.4, p.98104, 2003.
DOI : 10.1109/MCOM.2003.1193982

]. J. Grö00 and . Grönkvist, Assignment methods for spatial reuse TDMA, Proceedings of the 1st ACM International Symposium on Mobile ad hoc Networking & Computing (Mobi- Hoc'00), p.119124, 2000.

M. Gyarmati, U. Schilcher, G. Brandner, C. Bettstetter, Y. W. Chung et al., Impact of Random Mobility on the Inhomogeneity of Spatial Distributions, IEEE GLOBECOM 2008, 2008 IEEE Global Telecommunications Conference, p.404408, 2008.
DOI : 10.1109/GLOCOM.2008.ECP.85

F. [. Gao and . Wang, The extent of AS path ination by routing policies, Proceedings of GLOBECOM'02, p.21802184, 2002.

I. [. Hunter and . Andonovic, Approaches to optical Internet packet switching, IEEE Communications Magazine, vol.38, issue.9, p.116122, 2000.
DOI : 10.1109/35.868150

X. Hong, M. Gerla, G. Pei, and C. Chiang, A group mobility model for ad hoc wireless networks, Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems , MSWiM '99, p.5360, 1999.
DOI : 10.1145/313237.313248

]. J. Hil96 and . Hillston, A Compositional Approach to Performance Modelling, 1996.

D. [. Hwang and . Richards, Steiner tree problems. Networks, p.5589, 1992.

J. [. Hillston and . Tomasik, Amalgamation of transition sequences in the PEPA formalism, Proceedings of PAPM 2000, the 8th International Workshop on Process Algebra and Performance Modelling, ICALP Satellite Workshops, p.523534, 2000.

S. [. Herman and . Tixeuil, A distributed TDMA slot assignment algorithm for wireless sensor networks. Algorithmic Aspects of Wireless Sensor Networks, p.4558, 2004.

T. Hsu, K. Tsai, D. Wang, and D. T. Lee, Steiner problems on directed acyclic graphs Terms and denitions related to quality of service and network performance including dependability, COCOON'96 : Proceedings of the 2nd Annual International Conference on Computing and Combinatorics, p.2130, 1996.

]. J. Jaf84 and . Jae, Algorithms for nding paths with multiple constraints, pp.95-116, 1984.

E. [. Jardosh, K. C. Belding-royer, S. Almeroth, and . Suri, Towards realistic mobility models for mobile ad hoc networks, Proceedings of the 9th annual international conference on Mobile computing and networking , MobiCom '03, p.217229, 2003.
DOI : 10.1145/938985.939008

[. Jin, Q. Chen, and S. Jamin, Inet : Internet topology generator, 2000.

D. [. Johnson and . Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks, Mobile Computing, p.153181, 1996.
DOI : 10.1007/978-0-585-29603-6_5

]. D. Joh73 and . Johnson, Approximation algorithms for combinatorial problems, Proceedings of the 5th Annual ACM Symposium on Theory of Computing (STOC'73), p.3849, 1973.

T. [. Kotuliak, D. Atmaca, and . Popa, Performance issues in all-optical networks : Fixed and variable packet format, 2003.

]. R. Kar72 and . Karp, Complexity of Computer Computation, chapter Reductibility Among Combinatorials Problems, p.85106, 1972.

T. [. Kurkowski, M. Camp, and . Colagrosso, MANET simulation studies, ACM SIGMOBILE Mobile Computing and Communications Review, vol.9, issue.4, p.5061, 2005.
DOI : 10.1145/1096166.1096174

M. [. Korkmaz and . Krunz, A randomized algorithm for nding a path subject to multiple QoS requirements, Computer Networks, vol.36, issue.23, p.251268, 2001.

P. [. Kuipers and . Van-mieghem, Conditions that impact the complexity of QoS routing, IEEE/ACM Transactions on Networking, vol.13, issue.4, p.717730, 2005.
DOI : 10.1109/TNET.2005.852882

M. [. Kumar, S. Marathe, A. Parthasarathy, and . Srinivasan, Algorithmic aspects of capacity in wireless networks, Proc. of the ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), 2005.

T. [. Kodialam and . Nandagopal, Characterizing the capacity region in multi-radio multi-channel wireless mesh networks, Proceedings of the 11th annual international conference on Mobile computing and networking , MobiCom '05, 2005.
DOI : 10.1145/1080829.1080837

K. [. Kurose and . Ross, Computer Networking : a Top-Down Approach Featuring the Internet, 2003.

E. [. Kleinberg and . Tardos, Algorithm Design, 2006.

A. Kanzaki, T. Uemukai, T. Hara, and S. Nishio, Dynamic TDMA slot assignment in ad hoc networks, 17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003., 2003.
DOI : 10.1109/AINA.2003.1192899

]. K. Mat62 and . Matthes, Zür Theorie der Bedienungprozesse, The 3rd Prague Conference Inf. Th, p.513528, 1962.

A. [. Medina, I. Lakhina, J. Matta, and . Byers, BRITE: an approach to universal topology generation, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2001.
DOI : 10.1109/MASCOT.2001.948886

B. [. Mihelic and . Robic, Solving the k-center problem eciently with a dominating set algorithm, J. of Comp. and Info. Tech. (CIT), vol.13, issue.3, p.225233, 2005.

P. [. Ma and . Steenkiste, Quality of service routing for trac with performance guarantees, Proceedings of IFIP'97 1st IEEE/IFIP International Workshop on Quality of Service, p.115126, 1997.

P. [. Martello and . Toth, Knapsack problems : algorithms and computer implementations, 1990.

]. J. Myc-+-00, X. Myoungki, H. C. Yijun, M. Cankaya, C. Vandenhoute et al., Ecient multicast schemes for optical burst-switched WDM networks, Proc. of IEEE ICC, 2000.

X. [. Malli, C. Zhang, and . Qiao, Benets of multicasting in all-optical networks, Proc. of SPIE, All Optical Networking, p.209220, 1998.

[. Ns, Network simulator [Online] Available : http ://nsnam .isi.edu/nsnam/index.php/Main_Page, 2007.

. [. Mahony, The application of optical packet switching in future communications networks, IEEE Comm. Mag, p.125128, 2001.

. V. Opw-+-08-]-r, D. Oliveira, W. Pei, B. Willinger, L. Zhang et al., In search of the elusive ground truth : the Internet's AS-level connectivity structure, Proceedings of SIGMETRICS'08, p.217228, 2008.

]. D. Pa03 and . Popa, Evaluating the performance of an all-optical metro ring network : Fixed-length packet-switching versus variable-length packet-switching technology, Proceedings of HET-NETs, 2003.

T. [. Popa and . Atmaca, A distributed fairness algorithm for bus-based metropolitan optical network, 2006 IEEE International Performance Computing and Communications Conference, 2006.
DOI : 10.1109/.2006.1629418

J. [. Plateau and . Fourneau, A methodology for solving markov models of parallel systems, Journal of Parallel and Distributed Computing, vol.12, issue.4, p.370387, 1991.
DOI : 10.1016/0743-7315(91)90007-V

]. B. Pla84 and . Plateau, De l'evaluation du parallelisme et de sa synchronisation, Thèse d'état, 1984.

J. [. Pomportes, A. Tomasik, V. Busson, and . Vèque, Self-stabilizing algorithm of two-hop conict resolution, Proceedings of the 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, p.288302, 2010.

J. [. Pomportes, A. Tomasik, V. Busson, and . Vèque, Resource Allocation in Ad Hoc Networks with Two-Hop Interference Resolution, 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011, 2011.
DOI : 10.1109/GLOCOM.2011.6133910

URL : https://hal.archives-ouvertes.fr/hal-00730650

J. [. Pomportes, V. Tomasik, and . Vèque, Ad hoc network in a disaster area: A composite mobility model and its evaluation, The 2010 International Conference on Advanced Technologies for Communications, 2010.
DOI : 10.1109/ATC.2010.5672729

URL : https://hal.archives-ouvertes.fr/hal-00544222

J. [. Pomportes, V. Tomasik, and . Vèque, A Composite Mobility Model for Ad Hoc Networks in Disaster Areas, REV Journal on Electronics and Communications, vol.1, issue.1, pp.62-68, 2011.
DOI : 10.21553/rev-jec.10

URL : https://hal.archives-ouvertes.fr/hal-00589846

D. Poulain, J. Tomasik, M. Weisser, and D. Barth, Optimal receiver cost and wavelength number minimization in all-optical ring networks, Proceedings of 11th International Conference on Telecommunications, p.411417, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00591503

]. C. Qia00 and . Qiao, Labeled optical burst switching for IP-over-WDM integration, IEEE Communications Magazine, vol.38, issue.9, p.104114, 2000.

J. [. Quessette and . Tomasik, Functional transitions in Stochastic Automata Networks, Archives of Theoretical and Applied Computer Science, vol.11, issue.1, p.6985, 1999.

]. F. Que94 and . Quessette, De nouvelles méthodes de résolution pour l'analyse quantitative des systèmes paralleles et des protocoles, 1994.

J. [. Robert and . Boudec, On a Markov modulated chain exhibiting selfsimilarities over nite timescale, Performance Evaluation, pp.27-28, 1996.

J. V. Reinhard, J. Cohen, D. Tomasik, M. Barth, and . Weisser, Optimal conguration of an optical network providing predened multicast transmissions, Computer Networks, 2011.

J. V. Reinhard, J. Cohen, D. Tomasik, M. Barth, and . Weisser, Performance Improvement of an Optical Network Providing Services Based on Multicast, Proceedings of ISCIS, 2011.
DOI : 10.1007/978-1-4471-2155-8_30

P. [. Royer, L. E. Melliar-smith, and . Moser, An analysis of the optimum node density for ad hoc mobile networks, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240), p.857861, 2001.
DOI : 10.1109/ICC.2001.937360

M. I. Rhee, S. Shin, K. Hong, S. Lee, and . Chong, On the Levy-Walk nature of human mobility, Proc. of INFOCOM : IEEE Conference on Computer Communications, p.924932, 2008.

]. V. Rt08a, J. Reinhard, and . Tomasik, A centralised control mechanism for network resource allocation in grid applications, International Journal of Web and Grid Services, vol.4, issue.4, pp.461-475, 2008.

]. V. Rt08b, J. Reinhard, and . Tomasik, A model of application-network interactions in a highspeed optical network, Proceedings of 2nd International Workshop on P2P, Parallel, Grid and Internet Computing, 2008.

V. Reinhard, J. Tomasik, D. Barth, and M. Weisser, Bandwith optimisation for multicast transmissions in virtual circuits networks, Proceedings of IFIP Networking 2009, 2009.

J. [. Raghavachari and . Veerasamy, Approximation algorithms for mixed postman problem, SIAM Journal on Discrete Mathematics, vol.12, issue.4, p.425433, 1999.

A. [. Rhee, J. Warrier, L. Min, . [. Xu, A. Robins et al., DRAND:, Proceedings of the seventh ACM international symposium on Mobile ad hoc networking and computing , MobiHoc '06, 1980.
DOI : 10.1145/1132905.1132927

L. Subramanian, S. Agarwal, J. Rexford, and R. H. Katz, Characterizing the Internet hierarchy from multiple vantage points, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, p.618627, 2002.
DOI : 10.1109/INFCOM.2002.1019307

F. Sivrikaya, C. Busch, M. Magdon-ismail, and B. Yener, ASAND : asynchronous slot assignment and neighbor discovery protocol for wireless networks, p.2731, 2007.

. L. Sdd-+-01-]-n, A. Sauze, E. Dupas, L. Dotaro, M. Ciavaglia et al., A novel, low cost optical packet metropolitan ring architecture Siganos and M. Faloutsos. Analyzing BGP policies : Methodology and tool, Proc. of ECOC Proceedings of INFOCOM'04, 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, p.6667, 2001.

]. S. Sfk-+-10, M. Shakkottai, R. Fomenkov, D. Koga, K. F. Krioukov et al., Evolution of the Internet AS-level ecosystem Evaluation of multicast routing algorithms forreal-time communication on high-speed networks, Data and Computer CommunicationsSTT02] T. Salonidis, L. Tassiulas, and R. Tassiulas. Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks Proc. of IEEE International Workshop on Quality of Service (IWQoS), p.271278, 1997.

H. Tangmunarunkit, J. Doyle, R. Govindan, W. Willinger, S. Jamin et al., Does AS size determine degree in AS topology ? SIGCOMM Comput Performance of a multiservice switch using stochastic automata networks Amalgamation of transition sequences in the pepa formalism, Proceedings of Advanced Simulation Technologies Conference, p.78, 2000.

]. J. Th00b, J. Tomasik, and . Hillston, Transforming PEPA models to obtain product form bounds, 2000.

I. [. Tomasik and . Kotuliak, Current Research Progress of Optical Networks, chapter Markovian Analysis of a Synchronous Optical Packet Switch, p.4564, 2009.

I. [. Tomasik, T. Kotuliak, and . Atmaca, Markovian performance analysis of a synchronous optical packet switch, 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003., p.254257, 2003.
DOI : 10.1109/MASCOT.2003.1240669

A. [. Takahashi and . Matsuyama, An approximate solution for the Steiner problem in graphs The Stochastic Automata Network method for modelling elements of computer networks, Math. Jap, vol.24, issue.6, p.573577, 1980.

]. J. Tom99 and . Tomasik, An impact of source modulation on an autocorrelation function of a generated data stream, National Conference Computer Networks, p.357374, 1999.

]. J. Tom02 and . Tomasik, On Generalised Semi-Markov Processes, their insensitivity, and possible applications. Archives of Theoretical and Applied Computer Science Markovian model of an edge node in all-optical synchronous double bus networks, Proceedings of Computer and Communication Networks, CCN, p.2530, 2002.

D. [. Tomasik and . Popa, On Markov chain modelling of asynchronous optical CSMA/CA protocol, Proceedings of IEEE/ACM MASCOTS 2007, p.360365, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00243100

S. [. Tangmunarunkit, R. Shenker, S. Govindan, W. Jamin, and . Willinger, Network topology generators : Degree-based vs. structural, Proceedings of SIGCOMM'02, p.147159, 2002.

L. [. Tancevski, F. Tamil, and . Callegati, Nondegenerate buers : an approach for building large optical memories, IEEE Photonics Technology Letters, vol.11, issue.8, p.10721074, 1999.

]. J. Tw10a, M. Tomasik, and . Weisser, aSHIIP : autonomous generator of random Internetlike topologies with inter-domain hierarchy, Proceedings of IEEE/ACM MASCOTS 2010, 2010.

]. J. Tw10b, M. Tomasik, and . Weisser, Internet topology on AS-level : model, generation methods and tool, Proceedings of IEEE IPCCC 2010, 2010.

F. Télécom, Passeport Frame Relay NNI, 1996.

D. Verchère, O. Audouin, B. Berde, A. Chiosi, R. Douville et al., Automatic Network Services Aligned with Grid Application Requirements in CARRIOCAS Project, Proceedings of GridNets'08 Dijk. Queueing Networks and Product Forms : a System Approach, 1993.
DOI : 10.1007/978-3-642-02080-3_20

]. D. Ver07, . M. Verchèrewax88-]-b, . Waxman-[-wc96-]-z, J. Wang, and . Crowcroft, Orchestrating optimally IT and network resource allocations for stringent distributed applications over ultrahigh bit rate transmission networks Routing of multipoint connections Quality of service routing for supporting multimedia applications, European Conference and Exhibition on Optical Communication Weisser. La qualité de service dans le réseau inter-domaine Internet : algorithmes et modélisation, p.1617162212281234, 1988.

I. White, M. Rogge, K. Shrikhande, L. Kazovsky-weisser, J. Tomasik et al., A summary of the HORNET project : a next-generation metropolitan area network A distributed algorithm for resources provisioning in networks A distributed algorithm for inter-domain resources provisioning Inferring inter-domain relationships in randomly generated network models Automatic induction of inter-domain hierarchy in randomly generated network topologies Innapproximation proofs for directed Steiner tree and network problems, Proceeding of Second EuroNGI Conference Proceeding of Springsim 2007 : the 10th Communication and Networking Simulation Symposium (CNS'07) Weisser, J. Tomasik, and D. Barth. Congestion Avoiding Mechanism Based on Inter-Domain Hierarchy Weisser, J. Tomasik, and D. Barth. Intelligent Quality of Service Technologies and Network Management : Models for Enhancing Communication, chapter Exploiting the inter-domain hierarchy for the QoS management, pp.14781494-916, 2003.

X. Y. Wang, W. Z. Li, O. Song, and . Frieder, Ecient interference-aware TDMA link scheduling for static wireless networks, Proc. of the 12th ACM Annual International Conference on Mobile Computing and Networking (MobiCom), 2006.

L. Xiao, K. Lui, J. Wang, K. Nahrsted, S. Yao et al., QoS extension to BGP Advanced in photonic packet switching : an overview How to model an internetwork, ICNP'02 : Proceedings of the 10th IEEE International Conference on Network Protocols Proceedings of INFOCOM'96, 15th IEEE International Conference on Computer Communications, pp.100109-84, 1996.