Flow-Path: An AllPath flow-based protocol

Elisa Rojas, G. Ibáñez, Diego Rivera, J. A. Carral
{"title":"Flow-Path: An AllPath flow-based protocol","authors":"Elisa Rojas, G. Ibáñez, Diego Rivera, J. A. Carral","doi":"10.1109/LCN.2012.6423619","DOIUrl":null,"url":null,"abstract":"This paper describes Flow-Path, an AllPath flow-based switching protocol that features improved load adaptive properties. Upon arrival of a new flow to the network, it explores every possible path reaching from source to destination host and selects the lowest latency path at the moment. It is based on the same basic principle than ARP-Path, that is, snooping the ARP protocol dialog (request and reply messages) to explore all available paths at the same time that address resolution takes place, but it is flow-based instead of source address-based. While preserving the main advantages of ARP-Path: shortest path bridging exploiting the full network topology, Flow-Path has the advantages of full independence of flows at the time of path creation and guarantees path symmetry (congruency) and increased path diversity. Flow-Path thus improves load distribution, at the expense of increased address table size in each bridge.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"37th Annual IEEE Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2012.6423619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper describes Flow-Path, an AllPath flow-based switching protocol that features improved load adaptive properties. Upon arrival of a new flow to the network, it explores every possible path reaching from source to destination host and selects the lowest latency path at the moment. It is based on the same basic principle than ARP-Path, that is, snooping the ARP protocol dialog (request and reply messages) to explore all available paths at the same time that address resolution takes place, but it is flow-based instead of source address-based. While preserving the main advantages of ARP-Path: shortest path bridging exploiting the full network topology, Flow-Path has the advantages of full independence of flows at the time of path creation and guarantees path symmetry (congruency) and increased path diversity. Flow-Path thus improves load distribution, at the expense of increased address table size in each bridge.
Flow-Path:基于AllPath流的协议
Flow-Path是一种基于AllPath流的交换协议,具有改进的负载自适应特性。当一个新流到达网络时,它探索从源到目的主机到达的所有可能路径,并选择当前延迟最低的路径。它基于与ARP- path相同的基本原理,即在进行地址解析的同时窥探ARP协议对话框(请求和应答消息),探索所有可用的路径,但它是基于流而不是基于源地址的。在保留了ARP-Path的主要优点的同时:利用完整的网络拓扑结构的最短路径桥接,Flow-Path在路径创建时具有完全独立的流的优点,并保证了路径对称(一致性)和增加的路径多样性。因此,Flow-Path以增加每个网桥中的地址表大小为代价,改善了负载分配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信