Skip to main content
Springer Nature Link
Log in

Constructing Edge-Colored Graph for Heterogeneous Networks

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In order to build a fault-tolerant network, heterogeneous facilities are arranged in the network to prevent homogeneous faults from causing serious damage. This paper uses edge-colored graph to investigate the features of a network topology which is survivable after a set of homogeneous devices malfunction. We propose an approach to designing such networks under arbitrary parameters. We also show that the proposed approach can be used to optimize inter-router connections in network-on-chip to reduce the additional consumption of energy and time delay.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Wang Y, Desmedt Y. Edge-colored graphs with applications to homogeneous faults. Information Processing Letters, 2011, 111(13): 634–641.

    Article  MATH  MathSciNet  Google Scholar 

  2. Wang Y. LT codes for efficient and reliable distributed storage systems revisited. arXiv: 1207.5542, 2012. http://arxiv.org/abs/1207.5542, Feb. 2015.

  3. Wang Y. Array BP-XOR codes for reliable cloud storage systems. In Proc. ISIT, Jul. 2013, pp.326-330.

  4. Tan S, Lv J. Characterizing the effect of population heterogeneity on evolutionary dynamics on complex networks. Scientific Reports 4, 2014, Article No. 5034.

  5. Arora S, Barak B. Computational Complexity: A Modern Approach. Cambridge: Cambridge University Press, 2009.

    Book  Google Scholar 

  6. Constantine G. Colorful isomorphic spanning trees in complete graphs. Annals of Combinatorics, 2005, 9(2): 163–167.

    Article  MATH  MathSciNet  Google Scholar 

  7. Hammadi A, Mhamdi L. A survey on architectures and energy efficiency in Data Center Networks. Computer Communications, 2014, 40(1): 1–21.

    Article  Google Scholar 

  8. Stensgaard M B, Sparso J. ReNoC: A network-on-chip architecture with reconfigurable topology. In Proc. the 2nd NoCS, Apr. 2008, pp.55-64.

  9. Murali S, De Micheli G. Bandwidth-constrained mapping of cores onto NoC architectures. In Proc. DATE, Feb. 2004, pp.896-901.

  10. Gao Y, Jin Y, Chang Z, Hu W. Ultra-low latency reconfigurable photonic network on chip architecture based on application pattern. In Proc. OFC, Mar. 2009.

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Software Engineering, Tianjin Polytechnic University, Tianjin, 300387, China

    Rui Hou & Ji-Gang Wu

  2. State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, 100190, China

    Ji-Gang Wu & Xiu-Feng Sui

  3. Department of Computer Science, University of Otago, Dunedin, 9054, New Zealand

    Yawen Chen & Haibo Zhang

Authors
  1. Rui Hou
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Ji-Gang Wu
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Yawen Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Haibo Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Xiu-Feng Sui
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Ji-Gang Wu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hou, R., Wu, JG., Chen, Y. et al. Constructing Edge-Colored Graph for Heterogeneous Networks. J. Comput. Sci. Technol. 30, 1154–1160 (2015). https://doi.org/10.1007/s11390-015-1551-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-015-1551-0

Keywords