TY - GEN
T1 - Supporting Dynamic Inter-Domain Network Composition: Domain discovery
AU - Jesus, Vitor
AU - Aguiar, Rui L.
AU - Steenkiste, Peter
PY - 2009
Y1 - 2009
N2 - When two administratively independent domains need to engage in cooperation of some kind, some initial common known point of contact must exist, both in terms of the application topological position (i.e., IP address, transport protocol and port) and in terms of the interface technology (e.g., the protocol suite of the interaction). In a world of many domains of many types (not necessarily Autonomous Systems in the sense of interdomain routing), manual or single-directory-based operations are not practical (or even feasible); hence, some form of autonomic discovery and handshaking of domains is needed. We propose and evaluate several strategies to allow autonomic bootstrapping of inter-domain operations, all fit to be deployed as BGP extensions. We show the time/message overhead tradeoff: it's possible to obtain the absolute minimum message complexity of O(N) but at the cost of central administrative burden or, for fully distributed schemes, a tradeoff (message/time complexity) of O(N 2)/O(N) or O(N2)/O(log2N).
AB - When two administratively independent domains need to engage in cooperation of some kind, some initial common known point of contact must exist, both in terms of the application topological position (i.e., IP address, transport protocol and port) and in terms of the interface technology (e.g., the protocol suite of the interaction). In a world of many domains of many types (not necessarily Autonomous Systems in the sense of interdomain routing), manual or single-directory-based operations are not practical (or even feasible); hence, some form of autonomic discovery and handshaking of domains is needed. We propose and evaluate several strategies to allow autonomic bootstrapping of inter-domain operations, all fit to be deployed as BGP extensions. We show the time/message overhead tradeoff: it's possible to obtain the absolute minimum message complexity of O(N) but at the cost of central administrative burden or, for fully distributed schemes, a tradeoff (message/time complexity) of O(N 2)/O(N) or O(N2)/O(log2N).
KW - Autonomic networks
KW - Inter-domain
KW - Inter-domain service discovery
UR - http://www.scopus.com/inward/record.url?scp=70449505371&partnerID=8YFLogxK
UR - https://ieeexplore.ieee.org/document/5199501
U2 - 10.1109/ICC.2009.5199501
DO - 10.1109/ICC.2009.5199501
M3 - Conference publication
AN - SCOPUS:70449505371
BT - Proceedings - 2009 IEEE International Conference on Communications
T2 - 2009 IEEE International Conference on Communications, ICC 2009
Y2 - 14 June 2009 through 18 June 2009
ER -