Abstract

In the conventional Internal Border Gateway Protocol (IBGP), the BGP sessions between all BGP speakers in a single Autonomous System (AS) form a full mesh. For scalability reasons, route reflection is proposed as an alternative to the full mesh inside an AS. The selection of route reflectors and their clients determines the paths used by IBGP route advertising. Thus, the design of the route reflection graph is an important issue for improving IBGP operating efficiency and reliability. This paper focuses on the topology optimization for the route reflection graph, i.e., the selection of the reflectors and the interconnections between reflectors and clients. We propose the Optimum Reflection Graph (ORG) problem to find the best topology for IBGP reflection according to the efficiency or reliability metrics. We give the solvability conditions for the problem and present a solution based on the Integer Programming model. Our approach Is also highly flexible. Human decisions or constraints can be easily incorporated to find a topology which satisfies AS administrators' manual configurations.

Original languageEnglish (US)
Pages (from-to)1765-1769
Number of pages5
JournalIEEE International Conference on Communications
Volume3
StatePublished - Jul 18 2003
Event2003 International Conference on Communications (ICC 2003) - Anchorage, AK, United States
Duration: May 11 2003May 15 2003

Fingerprint

Topology
Shape optimization
Integer programming
Scalability
Marketing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Optimizing IBGP route reflection network. / Xiao, Li; Wang, Jun; Nahrstedt, Klara.

In: IEEE International Conference on Communications, Vol. 3, 18.07.2003, p. 1765-1769.

Research output: Contribution to journalConference article

@article{82696c1934ee4dcb97b41680976e6bf6,
title = "Optimizing IBGP route reflection network",
abstract = "In the conventional Internal Border Gateway Protocol (IBGP), the BGP sessions between all BGP speakers in a single Autonomous System (AS) form a full mesh. For scalability reasons, route reflection is proposed as an alternative to the full mesh inside an AS. The selection of route reflectors and their clients determines the paths used by IBGP route advertising. Thus, the design of the route reflection graph is an important issue for improving IBGP operating efficiency and reliability. This paper focuses on the topology optimization for the route reflection graph, i.e., the selection of the reflectors and the interconnections between reflectors and clients. We propose the Optimum Reflection Graph (ORG) problem to find the best topology for IBGP reflection according to the efficiency or reliability metrics. We give the solvability conditions for the problem and present a solution based on the Integer Programming model. Our approach Is also highly flexible. Human decisions or constraints can be easily incorporated to find a topology which satisfies AS administrators' manual configurations.",
author = "Li Xiao and Jun Wang and Klara Nahrstedt",
year = "2003",
month = "7",
day = "18",
language = "English (US)",
volume = "3",
pages = "1765--1769",
journal = "Conference Record - International Conference on Communications",
issn = "0536-1486",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Optimizing IBGP route reflection network

AU - Xiao, Li

AU - Wang, Jun

AU - Nahrstedt, Klara

PY - 2003/7/18

Y1 - 2003/7/18

N2 - In the conventional Internal Border Gateway Protocol (IBGP), the BGP sessions between all BGP speakers in a single Autonomous System (AS) form a full mesh. For scalability reasons, route reflection is proposed as an alternative to the full mesh inside an AS. The selection of route reflectors and their clients determines the paths used by IBGP route advertising. Thus, the design of the route reflection graph is an important issue for improving IBGP operating efficiency and reliability. This paper focuses on the topology optimization for the route reflection graph, i.e., the selection of the reflectors and the interconnections between reflectors and clients. We propose the Optimum Reflection Graph (ORG) problem to find the best topology for IBGP reflection according to the efficiency or reliability metrics. We give the solvability conditions for the problem and present a solution based on the Integer Programming model. Our approach Is also highly flexible. Human decisions or constraints can be easily incorporated to find a topology which satisfies AS administrators' manual configurations.

AB - In the conventional Internal Border Gateway Protocol (IBGP), the BGP sessions between all BGP speakers in a single Autonomous System (AS) form a full mesh. For scalability reasons, route reflection is proposed as an alternative to the full mesh inside an AS. The selection of route reflectors and their clients determines the paths used by IBGP route advertising. Thus, the design of the route reflection graph is an important issue for improving IBGP operating efficiency and reliability. This paper focuses on the topology optimization for the route reflection graph, i.e., the selection of the reflectors and the interconnections between reflectors and clients. We propose the Optimum Reflection Graph (ORG) problem to find the best topology for IBGP reflection according to the efficiency or reliability metrics. We give the solvability conditions for the problem and present a solution based on the Integer Programming model. Our approach Is also highly flexible. Human decisions or constraints can be easily incorporated to find a topology which satisfies AS administrators' manual configurations.

UR - http://www.scopus.com/inward/record.url?scp=0038308087&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038308087&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0038308087

VL - 3

SP - 1765

EP - 1769

JO - Conference Record - International Conference on Communications

JF - Conference Record - International Conference on Communications

SN - 0536-1486

ER -