Towards a unified theory of policy-based routing

被引：0

作者：

Chau, Chi-kin ^{[1
]}

Gibbens, Richard ^{[1
]}

Griffin, Timothy G. ^{[1
]}

机构：

[1] Univ Cambridge, Comp Lab, Cambridge CB2 1TN, England

来源：

25TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-7, PROCEEDINGS IEEE INFOCOM 2006 | 2006年

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We use the term policy-based routing to refer collectively to the Stable Paths Problem, Sobrinho's Routing Algebras, and to classical Path Algebras (semi-rings used to generalise minimum-weight routing). These theories all contain sufficient conditions that ensure the existence of solutions (stable routings) for labelled graphs. We attempt to provide a unified theory from which all of these seemingly disparate sufficient conditions can be derived. Our theory is based purely on abstract relations and their properties and not on the syntactic or axiomatic details of the policy-based theories.

引用

页码：470 / 481

页数：12

共 17 条

[1] Network information flow [J].

Ahlswede, R ;

Cai, N ;

Li, SYR ;

Yeung, RW .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216

[2]

Aho A.V., 1974, The Design and Analysis of Computer Algorithms

[3]

[Anonymous], 1995, 1771 RFC

[4]

[Anonymous], 1979, GRAPHS NETWORKS

[5]

Bertsekas Dimitri P., 1989, PARALLEL DISTRIBUTED

[6]

CORMEN TH, 1992, INTRO ALGORITHMS

[7]

Davey B. A., 2002, INTRO LATTICES ORDER, DOI DOI 10.1017/CBO9780511809088

[8]

GAUBERT S, 1997, P S THEOR ASP COMP S

[9]

Gondran M., 1984, Graphs and algorithms

[10]

GRIFFIN T, 2005, P ACM SIGCOMM SEPT

← 1 2 →