Share Email Print

Proceedings Paper

The capacity kernel of communication networks
Author(s): Wentu Song; Kai Cai; Rongquan Feng; Pingyi Fan
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The capacity factor, as a useful tool, was used to characterize the dependence of every link on the capacity changes of a network coding based network. In this paper, we shall investigate the relationship between the network capacity and the set of capacity factors. We firstly introduce a new concept, the capacity kernel, which is a subnetwork deduced from the original network. It will be shown that the capacity kernel of a network maintains most important capacity-related properties of the original network. The capacity kernel can also deduce a projection operator, which to the best of our knowledge, is the first known projection operator acting on the space of all the communication networks. We further introduce and discuss the properties of the C-contra links based on the capacity kernel. As an application, a tighter upper bound on the capacity factor size is then obtained.

Paper Details

Date Published: 5 March 2013
PDF: 5 pages
Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 876804 (5 March 2013); doi: 10.1117/12.2010537
Show Author Affiliations
Wentu Song, Peking Univ. (China)
Kai Cai, Arizona State Univ. (United States)
Rongquan Feng, Peking Univ. (China)
Pingyi Fan, Tsinghua Univ. (China)

Published in SPIE Proceedings Vol. 8768:
International Conference on Graphic and Image Processing (ICGIP 2012)
Zeng Zhu, Editor(s)

© SPIE. Terms of Use
Back to Top