A route pre-computation algorithm for integrated services networks

Boudec, Jean-Yves Le; Przygienda, Tony

doi:10.1007/bf02139533

Cited by 16 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such schemes are generally used to guarantee quality of service (QoS) to the user because the performance of the optimal routing can be evaluated before the connection is established. Such policies of using precalcuated routes for network traffic management has been illustrated by Boudec and Przygienda (1995) and Orda and Sprintson (2003). Most precomputing techniques assume that the network remains unchanged at least for the duration of the data transfer.…”

Section: Prior Artmentioning

confidence: 99%

An object-oriented approach to data routing in a network

Chatterjee

Chakraborty

2010

IJISE

View full text Add to dashboard Cite

In this paper, a suitable generalized object-oriented formulation is devised, which can be used to find the shortest paths between machines for all types of networks. Use of object-oriented programming paradigm allows the analyzer to add greater flexibilities to the programs by modeling them as entities (called Objects) that have certain common properties (which are defined by the Class that they belong to). Non-object oriented implementations make use of certain data structures which represent the parameters of a network (and thus its state at any point of time). But in object oriented implementation, the classes are modeled taking into account the physical parameters of a network. Hence, it is not difficult to grasp the data structures used. Moreover, Copyright c 200x Inderscience Enterprises Ltd. 2 P. Chatterjee and S. Chakraborty due to the use of object oriented methodologies, it is easier to visualize the operations in the algorithm. The same algorithm can be run without any modification, even if network characteristics and topology change. Addition or subtraction of routers and links can be achieved by simple addition and subtraction of Nodes and Edges. Additionally, for this algorithm the weighting function just needs to be changed to incorporate the requisite changes for different types of subnets. Finally, the algorithm is aptly illustrated by means of two representative case studies.

show abstract

Section: Prior Artmentioning

confidence: 99%

An object-oriented approach to data routing in a network

Chatterjee

Chakraborty

2010

IJISE

View full text Add to dashboard Cite

show abstract

“…For example, there has been research focused on path selection algorithms [2,15,19,21,23,27±30], cost and feasibility analysis [1,8] and processing cost reduction strategies [9,13,16]. In this section, we describe some early works on unicast path selection algorithm based on different metrics.…”

Section: Related Workmentioning

confidence: 99%

Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows

Tan

Lee

Vaillaint

2002

Computer Communications

View full text Add to dashboard Cite

This paper presents a new non-greedy routing and admission control algorithm for the dynamic routing of bandwidth-guaranteed tunnels. The algorithm operates online that is handling requests which arrive one at a time without prior knowledge of the traf®c pattern. It combines the key concepts in the minimum interference routing algorithm and the algorithms developed based on theoretic competitive analysis to provide ef®cient routing. Using extensive simulations, we show that our algorithm out-performs several previously proposed algorithms on several metrics such as the acceptance rate of the tunnel set-up requests, fairness and the capability of providing priorities to tunnel requests of certain source±destination pairs in the network. q

show abstract

“…QoS routing is, undoubtedly, one of the major building blocks for supporting QoS and, hence, a necessary component of future communication networks. Indeed, it has been the subject of several recent studies and proposals (see, e.g., [6], [7], [9], [11], [16], [19], [21], [24], [25], [27], [28], and references therein).…”

mentioning

confidence: 99%

Precomputation schemes for QoS routing

Orda

Sprintson

2003

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Precomputation-based methods have recently been proposed as an instrument to facilitate scalability, improve response time, and reduce computation load on network elements. The key idea is to effectively reduce the time needed to handle an event by performing a certain amount of computations in advance, i.e., prior to the event's arrival. Such computations are performed as background processes, thus enabling to promptly provide a solution upon a request, through a simple, fast procedure.In this paper, we investigate precomputation methods in the context of Quality-of-Service (QoS) routing. Precomputation is highly desirable for QoS routing schemes due to the high computation complexity of selecting QoS paths on the one hand, and the need to promptly provide a satisfactory path upon a request on the other hand. We consider two major settings of QoS routing. The first is the case where the QoS constraint is of the "bottleneck" type, e.g., a bandwidth requirement, and network optimization is sought through hop minimization. The second is the more general setting of "additive" QoS constraints (e.g., delay) and general link costs. This paper mainly focuses on the first setting. First, we show that, by exploiting the typical hierarchical structure of large-scale networks, one can achieve a substantial improvement in terms of computational complexity. Next, we consider networks with topology aggregation. We indicate that precomputation is a necessary element for any QoS routing scheme and establish a precomputation scheme appropriate for such settings. Finally, we consider the case of additive QoS constraints (e.g., delay) and general link costs. As the routing problem becomes -hard, we focus on -optimal approximations and derive a precomputation scheme that offers a major improvement over the standard approach.

show abstract

A route pre-computation algorithm for integrated services networks

Cited by 16 publications

References 23 publications

An object-oriented approach to data routing in a network

An object-oriented approach to data routing in a network

Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows

Precomputation schemes for QoS routing

Contact Info

Product

Resources

About