Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints

Published:2009-04 Issue: Volume: Page:
ISSN:
Container-title:IEEE INFOCOM 2009 - The 28th Conference on Computer Communications
language:
Short-container-title:

Author:

Misra S.,Xue G.,Yang D.

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx5/5061887/5061888/05061962.pdf?arnumber=5061962

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dynamic Service Chaining for Ultra-Reliable Services in Softwarized Networks;IEEE Transactions on Network and Service Management;2023-09

2. EA-Market: Empowering Real-Time Big Data Applications with Short-Term Edge SLA Leases;2023 32nd International Conference on Computer Communications and Networks (ICCCN);2023-07

3. Reliability-Aware Flow Distribution Algorithm in SDN-Enabled Fog Computing for Smart Cities;IEEE Transactions on Vehicular Technology;2023-01

4. An improved Lagrangian relaxation algorithm based SDN framework for industrial internet hybrid service flow scheduling;Scientific Reports;2022-03-09

5. VEIN: High Scalability Routing Algorithm for Blockchain-based Payment Channel Networks;2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom);2021-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP