Simulative analysis of optimal resource allocation and routing in IBCN's

Sykas Efstathios, D; Vlakos Konstantinos, M; Venieris Iakovos, S; Protonotarios Emmanuel, N

dc.contributor.author	Sykas Efstathios, D	en
dc.contributor.author	Vlakos Konstantinos, M	en
dc.contributor.author	Venieris Iakovos, S	en
dc.contributor.author	Protonotarios Emmanuel, N	en
dc.date.accessioned	2014-03-01T01:08:32Z
dc.date.available	2014-03-01T01:08:32Z
dc.date.issued	1991	en
dc.identifier.issn	0733-8716	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10557
dc.subject	Asynchronous Transfer Mode	en
dc.subject	Broadband Communication	en
dc.subject	Optimal Resource Allocation	en
dc.subject	Resource Allocation	en
dc.subject	Routing Algorithm	en
dc.subject	Simulation Analysis	en
dc.subject	Software Package	en
dc.subject	Complete Sharing	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Optimization	en
dc.subject.other	Probability	en
dc.subject.other	Switching Theory - Asynchronous Sequential Logic	en
dc.subject.other	Telecommunication - Traffic	en
dc.subject.other	ATM Virtual Connection	en
dc.subject.other	Blocking Probability	en
dc.subject.other	Integrated Broadband Communication Networks	en
dc.subject.other	Movable Boundary Policies	en
dc.subject.other	Optimal Resource Allocation	en
dc.subject.other	Digital Communication Systems	en
dc.title	Simulative analysis of optimal resource allocation and routing in IBCN's	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/49.76648	en
heal.identifier.secondary	http://dx.doi.org/10.1109/49.76648	en
heal.language	English	en
heal.publicationDate	1991	en
heal.abstract	The problem of resource allocation for future integrated broadband communication networks (IBCNs) is addressed. It mainly involves resource allocation at the connection level. The resource allocation problem is decomposed into the following interdependent tasks: (i) given that a network can accommodate the bandwidth demand of a call request, determine a route for the corresponding asynchronous transfer mode (ATM) virtual connection, and (ii) allocate bandwidth, i.e., links inside the trunks of the chosen route, to this connection according to predefined limits on bandwidth use by various service calls. Hence, (i) is mainly the responsibility of the routing algorithm used by the network operator, while (ii) depends on the link allocation scheme used to reserve trunk bandwidth, i.e., links, for each service. Various link allocation schemes combined with routing algorithms are examined. Their performance in terms of service call blocking is evaluated using a software package developed for that purpose. It is shown that the traditional complete sharing (CS) and complete partitioning (CP) policies are not adequate for IBCNs. Movable boundary (MB) policies are more flexible and present near-optimal performance when access of broadband service to narrowband service resources is allowed and suitable routing algorithms are dynamically applied.	en
heal.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC	en
heal.journalName	IEEE Journal on Selected Areas in Communications	en
dc.identifier.doi	10.1109/49.76648	en
dc.identifier.isi	ISI:A1991FF93900024	en
dc.identifier.volume	9	en
dc.identifier.issue	3	en
dc.identifier.spage	486	en
dc.identifier.epage	492	en