FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W42656562> ?p ?o ?g. }

• W42656562 abstract "There is a high degree of uncertainty regarding the nature of traffic on future integrated service networks. This uncertainty motivates the use of adaptive resource allocation policies that can take advantage of the statistical fluctuations in the traffic demands. The adaptive control mechanisms must be 'lightweight', in terms of their overheads, and scale to potentially large networks with many traffic flows. Adaptive routing is one form of adaptive resource allocation, and this thesis considers the application of Stochastic Learning Automata (SLA) for distributed, lightweight adaptive routing in future integrated service communication networks. The thesis begins with a broad critical review of the use of Artificial Intelligence (AI) techniques applied to the control of communication networks. Detailed simulation models of integrated service networks are then constructed, and learning automata based routing is compared with traditional techniques on large scale networks. Learning automata are examined for the 'Quality-of-Service' (QoS) routing problem in realistic network topologies, where flows may be routed in the network subject to multiple QoS metrics, such as bandwidth and delay. It is found that learning automata based routing gives considerable blocking probability improvements over shortest path routing, despite only using local connectivity information and a simple probabilistic updating strategy. Furthermore, automata are considered for routing in more complex environments spanning issues such as multi-rate traffic, trunk reservation, routing over multiple domains, routing in high bandwidth-delay product networks and the use of learning automata as a background learning process. Automata are also examined for routing of both 'real-time' and 'non-real-time' traffics in an integrated traffic environment, where the non-real-time traffic has access to the bandwidth 'left over' by the real-time traffic. It is found that adopting learning automata for the routing of the real-time traffic may improve the performance to both real and non-real-time traffics under certain conditions. In addition, it is found that one set of learning automata may route both traffic types satisfactorily. Automata are considered for the routing of multicast connections in receiver-oriented, dynamic environments, where receivers may join and leave the multicast sessions dynamically. Automata are shown to be able to minimise the average delay or the total cost of the resulting trees using the appropriate feedback from the environment. Automata provide a distributed solution to the dynamic multicast problem, requiring purely local connectivity information and a simple updating strategy. Finally, automata are considered for the routing of multicast connections that require QoS guarantees, again in receiver-oriented dynamic environments. It is found that the distributed application of learning automata leads to considerably lower blocking probabilities than a shortest path tree approach, due to a combination of load balancing and minimum cost behaviour." @default.
• W42656562 created "2016-06-24" @default.
• W42656562 creator A5040269100 @default.
• W42656562 date "1998-01-01" @default.
• W42656562 modified "2023-09-27" @default.
• W42656562 title "Learning algorithms for the control of routing in integrated service communication networks" @default.
• W42656562 hasPublicationYear "1998" @default.
• W42656562 type Work @default.
• W42656562 sameAs 42656562 @default.
• W42656562 citedByCount "1" @default.
• W42656562 crossrefType "dissertation" @default.
• W42656562 hasAuthorship W42656562A5040269100 @default.
• W42656562 hasConcept C104954878 @default.
• W42656562 hasConcept C112505250 @default.
• W42656562 hasConcept C115443555 @default.
• W42656562 hasConcept C120314980 @default.
• W42656562 hasConcept C154945302 @default.
• W42656562 hasConcept C177818476 @default.
• W42656562 hasConcept C196423136 @default.
• W42656562 hasConcept C204948658 @default.
• W42656562 hasConcept C2776807809 @default.
• W42656562 hasConcept C31258907 @default.
• W42656562 hasConcept C32244324 @default.
• W42656562 hasConcept C41008148 @default.
• W42656562 hasConcept C74172769 @default.
• W42656562 hasConcept C76522221 @default.
• W42656562 hasConcept C89305328 @default.
• W42656562 hasConcept C9659607 @default.
• W42656562 hasConceptScore W42656562C104954878 @default.
• W42656562 hasConceptScore W42656562C112505250 @default.
• W42656562 hasConceptScore W42656562C115443555 @default.
• W42656562 hasConceptScore W42656562C120314980 @default.
• W42656562 hasConceptScore W42656562C154945302 @default.
• W42656562 hasConceptScore W42656562C177818476 @default.
• W42656562 hasConceptScore W42656562C196423136 @default.
• W42656562 hasConceptScore W42656562C204948658 @default.
• W42656562 hasConceptScore W42656562C2776807809 @default.
• W42656562 hasConceptScore W42656562C31258907 @default.
• W42656562 hasConceptScore W42656562C32244324 @default.
• W42656562 hasConceptScore W42656562C41008148 @default.
• W42656562 hasConceptScore W42656562C74172769 @default.
• W42656562 hasConceptScore W42656562C76522221 @default.
• W42656562 hasConceptScore W42656562C89305328 @default.
• W42656562 hasConceptScore W42656562C9659607 @default.
• W42656562 hasLocation W426565621 @default.
• W42656562 hasOpenAccess W42656562 @default.
• W42656562 hasPrimaryLocation W426565621 @default.
• W42656562 hasRelatedWork W146128134 @default.
• W42656562 hasRelatedWork W1497297211 @default.
• W42656562 hasRelatedWork W1553085518 @default.
• W42656562 hasRelatedWork W1569976541 @default.
• W42656562 hasRelatedWork W1602423779 @default.
• W42656562 hasRelatedWork W1660138765 @default.
• W42656562 hasRelatedWork W2037165644 @default.
• W42656562 hasRelatedWork W2038744510 @default.
• W42656562 hasRelatedWork W2090565901 @default.
• W42656562 hasRelatedWork W2103496593 @default.
• W42656562 hasRelatedWork W2115130564 @default.
• W42656562 hasRelatedWork W2127447929 @default.
• W42656562 hasRelatedWork W2132692133 @default.
• W42656562 hasRelatedWork W2522184489 @default.
• W42656562 hasRelatedWork W2604972185 @default.
• W42656562 hasRelatedWork W3029869916 @default.
• W42656562 hasRelatedWork W3151803043 @default.
• W42656562 hasRelatedWork W2093550967 @default.
• W42656562 hasRelatedWork W2101186694 @default.
• W42656562 hasRelatedWork W214615435 @default.
• W42656562 isParatext "false" @default.
• W42656562 isRetracted "false" @default.
• W42656562 magId "42656562" @default.
• W42656562 workType "dissertation" @default.