3 research outputs found
Reducing the effects of routing inaccuracy by means of prediction and an innovative link-state cost
The routing inaccuracy problem is one of the major
issues impeding the evolution and deployment of Constraint-
Based Routing (CBR) techniques. This paper proposes a promising
CBR strategy that combines the strengths of prediction with
an innovative link-state cost. The latter explicitly integrates a
two-bit counter predictor, with a novel metric that stands for
the degree of inaccuracy (seen by the source node) of the state
information associated with the links along a path. In our routing
model, Link-State Advertisements (LSAs) are only distributed
upon topological changes in the network, i.e., the state and
availability of network resources along a path are predicted
from the source rather than updated through conventional LSAs.
As a proof-of-concept, we apply our routing strategy in the
context of circuit-switched networks. We show that our approach
considerably reduces the impact of routing inaccuracy on the
blocking probability, while eliminating the typical LSAs caused
by the traffic dynamics in CBR protocols.Postprint (published version
Reducing the effects of routing inaccuracy by means of prediction and an innovative linkstate cost
Abstract-The routing inaccuracy problem is one of the major issues impeding the evolution and deployment of ConstraintBased Routing (CBR) techniques. This paper proposes a promising CBR strategy that combines the strengths of prediction with an innovative link-state cost. The latter explicitly integrates a two-bit counter predictor, with a novel metric that stands for the degree of inaccuracy (seen by the source node) of the state information associated with the links along a path. In our routing model, Link-State Advertisements (LSAs) are only distributed upon topological changes in the network, i.e., the state and availability of network resources along a path are predicted from the source rather than updated through conventional LSAs. As a proof-of-concept, we apply our routing strategy in the context of circuit-switched networks. We show that our approach considerably reduces the impact of routing inaccuracy on the blocking probability, while eliminating the typical LSAs caused by the traffic dynamics in CBR protocols
Recommended from our members
Localised Routing Algorithms in Communication Networks with Quality of Service Constraints. Performance Evaluation and Enhancement of New Localised Routing Approaches to Provide Quality of Service for Computer and Communication Networks.
The Quality of Service (QoS) is a profound concept which is gaining increasing attention in the Internet industry. Best-effort applications are now no longer acceptable in certain situations needing high bandwidth provisioning, low loss and streaming of multimedia applications. New emerging multimedia applications are requiring new levels of quality of services beyond those supported by best-effort networks. Quality of service routing is an essential part in any QoS architecture in communication networks. QoS routing aims to select a path among the many possible choices that has sufficient resources to accommodate the QoS requirements. QoS routing can significantly improve the network performance due to its awareness of the network QoS state. Most QoS routing algorithms require maintenance of the global network¿s state information to make routing decisions. Global state information needs to be periodically exchanged among routers since the efficiency of a routing algorithm depends on link-state information accuracy. However, most QoS routing algorithms suffer from scalability due to the high communication overhead and the high computation effort associated with maintaining accurate link state information and distributing global state information to each node in the network. The ultimate goal of this thesis is to contribute towards enhancing the scalability of QoS routing algorithms. Towards this goal, the thesis is focused on Localised QoS routing algorithms proposed to overcome the problems of using global network state information. Using such an approach, the source node makes routing decisions based on the local state information for each node in the path.
Localised QoS routing algorithms avoid the problems associated in the global network state, like high communication and processing overheads. In Localised QoS routing algorithms each source node maintains a predetermined set of candidate paths for each destination and avoids the problems associated with the
maintenance of a global network state by using locally collected flow statistics and flow blocking probabilities.Libya's higher educatio