Constructing Edge-Colored Graph for Heterogeneous Networks

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 malf...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computer science and technology 2015-09, Vol.30 (5), p.1154-1160
Main Author: 侯睿 武继刚 陈亚文 张海波 隋秀峰
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Communication
Computer networks
Computer Science
Computers
Construction
Data Structures and Information Theory
Design
Energy consumption
Fault tolerance
Faults
Graph coloring
Graphs
Information Systems Applications (incl.Internet)
Joints
Laboratories
Network topologies
Networks
Regular Paper
Software Engineering
Software reliability
Studies
System on chip
Theory of Computation
Time delay
Windows operating system
容错网络
异构网络
时间延迟
构造
着色图
网络拓扑
设备故障
路由器
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 consum!otion of energy and time delay.
ISSN:1000-9000
1860-4749
DOI:10.1007/s11390-015-1551-0