Lagrangian Relaxation and Linear Intersection Based QoS Routing Algorithm

International Journal of Electronics and Telecommunications
doi 10.2478/v10177-012-0042-2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Walter de Gruyter GmbH

Related search

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

English

QoS Routing Algorithm Based on Entropy Granularity in the Network Transmission

Cybernetics and Information Technologies
Computer Science
2019English

Or Practice—Lagrangian Relaxation for Testing Infeasibility in VLSI Routing

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1986English

An Efficient Ant Based QOS Aware Intelligent Temporally Ordered Routing Algorithm for MANETS

International Journal of Computer Networks and Communications
HardwareComputer NetworksArchitectureCommunications
2013English

Secure and Robust Multi-Constrained QoS Aware Routing Algorithm for VANETs

IEEE Transactions on Dependable and Secure Computing
Electronic EngineeringElectricalComputer Science
2016English

QoS-based Routing Over Software Defined Networks

2017English

A Qos Routing Protocol Based on AODV

MATEC Web of Conferences
Materials ScienceEngineeringChemistry
2016English

A Lagrangian Relaxation-Based Solution Method for a Green Vehicle Routing Problem to Minimize Greenhouse Gas Emissions

Sustainability
DevelopmentManagementMonitoringEnvironmental ScienceRenewable EnergyEnergy EngineeringLawSustainabilityPlanningPolicyPower Technologythe EnvironmentGeography
2017English

A QoS-Guaranteed Coverage Precedence Routing Algorithm for Wireless Sensor Networks

Sensors
InstrumentationInformation SystemsElectronic EngineeringBiochemistryAnalytical ChemistryMolecular Physics,ElectricalAtomicMedicineOptics
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy