BRITE

BRITE: A Flexible Generator of Internet Topologies. Abstract BRITE is a parameterized topology generation tool, which can be used to flexibly control various parameters (such as connectivity and growth models) and study various properties of generated network topologies (such power laws, path length and clustering coefficient). BRITE can be used to study the relevance of possible causes for properties recently observed in Internet topologies. Different combinations of possible causes can be tested. In this version, we consider four of them: (1) preferential connectivity of a new node to existing nodes; (2) incremental growth of the network; (3) geographical distribution of nodes; and (4) locality of edge connections. We use BRITE in [BU-CS-TR-2000-0004] to study the origin of power laws and other metrics in Internet topologies. BRITE (Boston university Representative Internet Topology gEnerator) is no longer supported by its developers.


References in zbMATH (referenced in 32 articles )

Showing results 1 to 20 of 32.
Sorted by year (citations)

1 2 next

  1. Chen, Yu; Duan, Zhe-min: Congested link inference algorithms in dynamic routing IP network (2017)
  2. Cugola, Gianpaolo; Margara, Alessandro: Deployment strategies for distributed complex event processing (2013) ioport
  3. Razzaq, Adil; Hidell, Markus; Sjödin, Peter: Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation (2012)
  4. Analoui, Morteza; Rezvani, Mohammad Hossein: Microeconomics-based resource allocation in overlay networks by using non-strategic behavior modeling (2011)
  5. Asaduzzaman, Shah; Maheswaran, Muthucumaru: Decentralized management of bi-modal network resources in a distributed stream processing platform (2011) ioport
  6. Rezvani, Mohammad Hossein; Analoui, Morteza: Strategic behavior modeling of multi-service overlay multicast networks based on auction mechanism design (2011)
  7. El Khayat, Ibtissam; Geurts, Pierre; Leduc, Guy: Enhancement of TCP over wired/wireless networks with packet loss classifiers inferred by supervised learning (2010) ioport
  8. Li, Jiaming; Yeo, Chai Kiat: Dynamic transmission scheduling for streaming applications via P2P overlay (2010) ioport
  9. Santos, Marcelo; Drummond, Lúcia M. A.; Uchoa, Eduardo: A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (2010)
  10. Wehrle, Klaus (ed.); Günes, Mesut (ed.); Gross, James (ed.): Modeling and tools for network simulation (2010)
  11. Wei, Guiyi; Ling, Yun; Vasilakos, Athanasios V.; Xiao, Bin; Zheng, Yao: PIVOT: an adaptive information discovery framework for computational grids (2010) ioport
  12. Cui, Yi; Cao, Yanchuan; Dai, Liang; Xue, Yuan: Optimizing P2P streaming throughput under peer churning (2009) ioport
  13. Deng, Yuhui; Wang, Frank; Ciura, Adrian: Ant colony optimization inspired resource discovery in P2P grid systems (2009) ioport
  14. Kantere, Verena; Tsoumakos, Dimitrios; Sellis, Timos; Roussopoulos, Nick: GrouPeer: dynamic clustering of P2P databases (2009) ioport
  15. Lee, Yong-Ju; Kim, Hag-Young; Lee, Cheol-Hoon: Cell approximation method in quorum systems for minimizing access time (2009) ioport
  16. Sato, Yasuhiro; Ata, Shingo; Oka, Ikuo: A strategic approach for re-organizing the internet topology by applying social behavior dynamics (2009) ioport
  17. Al-Kiswany, Samer; Ripeanu, Matei; Iamnitchi, Adriana; Vazhkudai, Sudharshan: Beyond music sharing: An evaluation of peer-to-peer data dissemination techniques in large scientific collaborations (2008) ioport
  18. Gotthelf, Pablo; Zunino, Alejandro; Mateos, Cristian; Campo, Marcelo: GMAC: an overlay multicast network for mobile agent platforms (2008)
  19. Kantere, Verena; Tsoumakos, Dimitrios; Sellis, Timos: A framework for semantic grouping in P2P databases (2008) ioport
  20. Zhu, Li; Li, Zhi-Shu; Chen, Liang-Yin; Cheng, Yan-Hong: Two-stage evolutionary algorithm for dynamic multicast routing in mesh network (2008)

1 2 next