Amanote Research

Amanote Research

    RegisterSign In

An Optimal Distributed Routing Algorithm Using Dual Decomposition Techniques

Communications in Information and Systems
doi 10.4310/cis.2008.v8.n3.a5
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2008

Authors
John S. BarasPunyaslok Purkayastha
Publisher

International Press of Boston


Related search

Distributed Asynchronous Optimal Routing in Data Networks

1987English

Sublogarithmic Distributed MIS Algorithm for Sparse Graphs Using Nash-Williams Decomposition

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2009English

A Delay Constrained Minimum Hop Distributed Routing Algorithm Using Adaptive Path Prediction

Journal of Networks
2007English

Research on Internet Model and Distributed Routing Algorithm

2016English

A Responsive Distributed Routing Algorithm for Computer Networks

IEEE Transactions on Communications
Electronic EngineeringElectrical
1982English

Distributed Quasi-Nonlinear Model Predictive Control by Dual Decomposition

IFAC Proceedings Volumes
2011English

An Efficient Multipath Routing Algorithm

DEStech Transactions on Computer Science and Engineering
2018English

Optimal Placement of Distributed Generation Units in Radial Distribution System Using Hybrid Techniques

International Journal of Engineering and Advanced Technology
EngineeringComputer Science ApplicationsEnvironmental Engineering
2019English

A Dual Tabu Search Algorithm for Vehicle Routing Problem

2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy