Amanote Research

Amanote Research

    RegisterSign In

Link-State Routing With Hop-By-Hop Forwarding Can Achieve Optimal Traffic Engineering

doi 10.1109/infocom.2007.94
Full Text
Open PDF
Abstract

Available in full text

Date

April 1, 2008

Authors
D. XuM. ChiangJ. Rexford
Publisher

IEEE


Related search

Determination of Array Gain of Single Hop to Achieve the Performance of a 2-Hop Wireless Link

Journal of Computer and Communications
2018English

Near-Optimal Nonlinear Forwarding Strategy for Two-Hop MIMO Relaying

2011English

Traffic-Differentiated Two-Hop Routing for QoS in Wireless Sensor Networks

2013English

Effect of Limiting the Hop Count: Distributed Three-Hop Routing Protocol

International Journal of Advance Engineering and Research Development
2017English

Properties of Optimal Hop-By-Hop Allocation Policies in Networks With Multiple Transmitters and Linear Equal Holding Costs

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
1991English

Integrated Cost-Based MAC and Routing Techniques for Hop Count Forwarding in Wireless Sensor Networks

IEEE Transactions on Mobile Computing
Computer NetworksElectronic EngineeringSoftwareElectricalCommunications
2007English

Strategic Pricing in Next-Hop Routing With Elastic Demands

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2012English

Cooperation and Routing in Multi-Hop Networks

2007English

Throughput-Optimal Multi-Hop Broadcast Algorithms

2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy