A Characterized and Optimized Approach for End-to-End Delay Constrained QoS Routing

Prakash, P. S.; Selvan, S.
March 2008
International Journal of Computer & Information Science & Engine;2008, Vol. 2 Issue 2, p116
Academic Journal
QoS Routing aims to find paths between senders and receivers satisfying the QoS requirements of the application which efficiently using the network resources and underlying routing algorithm to be able to find low-cost paths that satisfy given QoS constraints. The problem of finding least-cost routing is known to be NP hard or complete and some algorithms have been proposed to find a near optimal solution. But these heuristics or algorithms either impose relationships among the link metrics to reduce the complexity of the problem which may limit the general applicability of the heuristic, or are too costly in terms of execution time to be applicable to large networks. In this paper, we analyzed two algorithms namely Characterized Delay Constrained Routing (CDCR) and Optimized Delay Constrained Routing (ODCR). The CDCR algorithm dealt an approach for delay constrained routing that captures the trade-off between cost minimization and risk level regarding the delay constraint. The ODCR which uses an adaptive path weight function together with an additional constraint imposed on the path cost, to restrict search space and hence ODCR finds near optimal solution in much quicker time.


Related Articles

  • Aspects of sensory guidance in sequence learning. Robertson, E. M.; Pascual-Leone, A. // Experimental Brain Research;Apr2001, Vol. 137 Issue 3/4, p336 

    We explored the effects of sensory information upon procedural learning using three versions of the serial reaction-time task (SRTT): a standard task where the position of the stimulus cued the response; a non-standard task where the color of the stimulus was related to the correct response; and...

  • Dynamic Routing for Priority Shipments in LTL Service Networks. Cheung, Raymond K.; Muralidharan, B. // Transportation Science;Feb2000, Vol. 34 Issue 1, p86 

    Currently, less-than-truckload (LTL) carriers route both the regular and the priority shipments through their service networks using some fixed route patterns, known as load plans. In this paper, we consider an alternative strategy for routing priority shipments in LTL networks. This strategy...

  • Optimization of Route Planning using Simulated Ant Agent System.  // International Journal of Computer Applications;Jul2010, Vol. 4, p1 

    The article presents a study which examines the use of simulated ant agent system (SAAS) in optimizing route planning. It mentions that SAAS is proposed using modified ant colony optimization algorithm for dealing with online route planning and is being compared with evolutionary technique on...

  • Variable Step-Size Affine Projection Algorithm with a Weighted and Regularized Projection Matrix. Dai, Tao; Adler, Andy; Shahrrava, Behnam // International Journal of Computer, Information & Systems Science;2008, Vol. 2 Issue 3, p203 

    This paper presents a forgetting factor scheme for variable step-size affine projection algorithms (APA). The proposed scheme uses a forgetting processed input matrix as the projection matrix of pseudo-inverse to estimate system deviation. This method introduces temporal weights into the...

  • Efficient Routing using Partitive Clustering Algorithms in Ferry-based Delay Tolerant Networks. Jedari, Behrouz; Goudarzi, Rouhollah; Dehghan, Mehdi // International Journal of Future Generation Communication & Netwo;2009, Vol. 2 Issue 4, p1 

    The Delay Tolerant Networks (DTNs) generally contain relatively sparse nodes that are frequently disconnected. Message Ferrying (MF) is a mobility-assisted approach which utilizes a set of mobile elements to provide communication service in ferry-based DTNs. In this paper, we propose a...

  • Solution approaches to hub location problems. Abdinnour-Helm, Sue; Venkataramanan, M. A. // Annals of Operations Research;1998, Vol. 78 Issue 1-4, p31 

    The hub location problem involves a network of origins and destinations over which transport takes place. Any distribution system falls into this type of category. In this paper, we present a new quadratic integer formulation for the Uncapacitated Hub Location Problem (UHP), which is based on...

  • A REVIEW OF RULES FAMILY OF ALGORITHMS. Aksoy, Mehmet Sabih // Mathematical & Computational Applications;Apr2008, Vol. 13 Issue 1, p51 

    In recent years, there has been a growing amount of research on inductive learning. Out of this research a number of promising algorithms have surfaced. In the paper after a brief description of knowledge acquisition, induction and inductive learning; RULES family of inductive learning...

  • Power Aware Chain Routing Protocol for Data Gathering in Sensor Networks. Minh-Long Pham; Daeyoung Kim; Seong-Eun Yoo; Yoonmee Doh // International Journal of Distributed Sensor Networks;2005, Vol. 1 Issue 2, p253 

    To prolong the network lifetime, we propose an energy efficient chain-based routing scheme and a distributed algorithm for constructing the routing chain based on the minimum cost tree. The chain construction algorithm calculates the transmission cost based on optimal transmission power....

  • Hardware.  // IEEE Internet Computing;Mar/Apr2003, Vol. 7 Issue 2, p13 

    Presents a summary of the study 'Enterprise Backbone Routers: Is Integration the Destination?,' by Doug Allen.


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics