ROUTING IN MULTIDOMAIN NETWORKS

DIMITRIJEVIC, DD; MAGLARIS, B; BOORSTYN, RR

dc.contributor.author	DIMITRIJEVIC, DD	en
dc.contributor.author	MAGLARIS, B	en
dc.contributor.author	BOORSTYN, RR	en
dc.date.accessioned	2014-03-01T01:10:15Z
dc.date.available	2014-03-01T01:10:15Z
dc.date.issued	1994	en
dc.identifier.issn	1063-6692	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11345
dc.subject	Global Routing	en
dc.subject	Incomplete Information	en
dc.subject	Network Control	en
dc.subject	Network Management	en
dc.subject	Network Performance	en
dc.subject	Packet Switched	en
dc.subject	Lower Bound	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.title	ROUTING IN MULTIDOMAIN NETWORKS	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/90.311623	en
heal.identifier.secondary	http://dx.doi.org/10.1109/90.311623	en
heal.language	English	en
heal.publicationDate	1994	en
heal.abstract	We investigate the problem of management and control in a large and, for simplicity, homogeneous packet-switched network. Specifically we focus on routing, an important function of network management. The network consists of several individually controlled domains. Domains are interconnected via gateway links. Each domain is controlled by its own Network Control Center, while the overall network performance is managed by an Integrated Network Control Center. Each Center has only a portion of the information required for global routing. We investigate the impact of the reduced information available at each center on network performance (average delay in our case). We present a general approach to designing a hierarchical algorithm for routing in multidomain networks. We propose a heuristic procedure suitable for packet-switched networks. Several numerical examples will illustrate the impact of incomplete information on the network. Performance is compared with a lower bound obtained, which is not differentiating destinations in other domains. Therefore, for this bound, each domain is perceived as a single node in a simplified model of the network.	en
heal.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC	en
heal.journalName	IEEE-ACM TRANSACTIONS ON NETWORKING	en
dc.identifier.doi	10.1109/90.311623	en
dc.identifier.isi	ISI:A1994QR38100005	en
dc.identifier.volume	2	en
dc.identifier.issue	3	en
dc.identifier.spage	252	en
dc.identifier.epage	262	en