Performance Evaluation of Delay-Constrained Least-Cost QoS Routing Algorithms Based on Linear and Nonlinear Lagrange Relaxation

doi 10.1109/icc.2002.997251
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE

Related search

Lagrangian Relaxation and Linear Intersection Based QoS Routing Algorithm

International Journal of Electronics and Telecommunications
2012English

New Algorithms for Delay-Constrained Multicast Routing

2002English

Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay Networks

Journal of Applied Mathematics
Applied Mathematics
2013English

QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2006English

Algorithms and Protocols for Stateless Constrained-Based Routing

Computer Communications
Computer NetworksCommunications
2003English

A New Delay-Constrained Multicast Routing Algorithm Based on Shared Edges

Communications and Network
2014English

Performance Evaluation of Routing Protocols for Delay Tolerant Networks

2015English

On the Solution of Constrained and Weighted Linear Least Squares Problems

International Mathematical Forum
2006English

A Qos Routing Protocol Based on AODV

MATEC Web of Conferences
Materials ScienceEngineeringChemistry
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy