首页 > 最新文献

European Transactions on Telecommunications最新文献

英文 中文
A routing algorithm with precomputation for Multiprotocol Label Switching Traffic Engineering 一种多协议标签交换流量工程中带预计算的路由算法
Pub Date : 2011-10-01 DOI: 10.1002/ett.1481
Tao He, Suoping Wang
The Label Switch Path routing algorithm in Multiprotocol Label Switching (MPLS) has become an important topic in Traffic Engineering. This paper presents a new routing scheme with precomputation, called the Least Maximum Flow Categories Routing Algorithm. In the MPLS network, different ingress–egress pairs have different maximum flow values on different links. Each link has a vector consisting of the maximum flow values flowing through it. This paper considers these vectors as weights of links and presents a method for calculating them. Simulation results show that the algorithm has the same precision as the other algorithms but has less computational complexity. Copyright © 2011 John Wiley & Sons, Ltd.
多协议标签交换(MPLS)中的标签交换路径路由算法已成为流量工程中的一个重要课题。本文提出了一种新的路由算法,称为最小最大流类路由算法。在MPLS网络中,不同的入出对在不同的链路上有不同的最大流量值。每个环节都有一个矢量,由流经它的最大流量值组成。本文将这些向量视为链路权值,并给出了一种计算方法。仿真结果表明,该算法具有与其他算法相同的精度,但计算复杂度较低。版权所有©2011 John Wiley & Sons, Ltd
{"title":"A routing algorithm with precomputation for Multiprotocol Label Switching Traffic Engineering","authors":"Tao He, Suoping Wang","doi":"10.1002/ett.1481","DOIUrl":"https://doi.org/10.1002/ett.1481","url":null,"abstract":"The Label Switch Path routing algorithm in Multiprotocol Label Switching (MPLS) has become an important topic in Traffic Engineering. This paper presents a new routing scheme with precomputation, called the Least Maximum Flow Categories Routing Algorithm. In the MPLS network, different ingress–egress pairs have different maximum flow values on different links. Each link has a vector consisting of the maximum flow values flowing through it. This paper considers these vectors as weights of links and presents a method for calculating them. Simulation results show that the algorithm has the same precision as the other algorithms but has less computational complexity. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"6 1","pages":"315-321"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83148988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Real-time bandwidth measurements over mobile connections 实时带宽测量移动连接
Pub Date : 2011-10-01 DOI: 10.1002/ett.1474
Erik Bergfeldt, S. Ekelin, J. Karlsson
The first study that investigates the characteristics of received probe packets and the reliability of bandwidth estimates when actively measuring the available bandwidth over radio interfaces in mobile communication networks is presented. Knowledge of available bandwidth is very useful in various contexts, e.g. in network management and adaptive streaming applications. Bandwidth measuring tools have so far primarily been designed for and evaluated in wired networks. However, such tools should also be examined in wireless networks since the use of, e.g., mobile broadband is rapidly increasing. The properties of wired and wireless links differ substantially, which affect the performance of the tools. We have made active-probing experiments over a high-speed downlink shared channel, which is used for High-Speed Downlink Packet Access (HSDPA) in the mobile communication technology UMTS, and over a forward traffic channel in CDMA2000 1xEV-DO. Both experiments were performed over commercial networks. They show that one cannot always expect uniform per-packet processing over the radio channel in mobile networks, which is expected by many probing tools. This reduces the reliability of the available-bandwidth estimates, however we suggest how this can be handled. Finally, the mobile-network measurements are compared to experiments performed in an IEEE 802.11 wireless LAN, where the radio channel does not create the same packet-processing behaviour. We also discuss the possibility of using the probe traffic for the purpose of identifying the communication technology at the bottleneck of the network path, assumed this is a wireless broadband link, by mapping specifications of standardised communication technologies to observed probe-traffic characteristics. Copyright © 2011 John Wiley & Sons, Ltd.
本文首次研究了在主动测量移动通信网络中无线电接口上的可用带宽时,接收到的探测数据包的特性和带宽估计的可靠性。了解可用带宽在各种情况下非常有用,例如在网络管理和自适应流应用程序中。到目前为止,带宽测量工具主要是为有线网络设计和评估的。但是,由于诸如移动宽带的使用正在迅速增加,因此在无线网络中也应审查这些工具。有线和无线链路的特性有很大的不同,这影响了工具的性能。在移动通信技术UMTS中用于高速下行分组接入(HSDPA)的高速下行共享信道和CDMA2000 1xEV-DO中的转发业务信道上进行了主动探测实验。这两个实验都是在商业网络上进行的。它们表明,人们不能总是期望在移动网络的无线电信道上进行统一的每包处理,这是许多探测工具所期望的。这降低了可用带宽估计的可靠性,但是我们建议如何处理这个问题。最后,将移动网络的测量结果与IEEE 802.11无线局域网的实验结果进行比较,后者的无线信道不会产生相同的分组处理行为。我们还讨论了使用探测流量来识别网络路径瓶颈处通信技术的可能性,假设这是一个无线宽带链路,通过将标准化通信技术的规范映射到观察到的探测流量特征。版权所有©2011 John Wiley & Sons, Ltd
{"title":"Real-time bandwidth measurements over mobile connections","authors":"Erik Bergfeldt, S. Ekelin, J. Karlsson","doi":"10.1002/ett.1474","DOIUrl":"https://doi.org/10.1002/ett.1474","url":null,"abstract":"The first study that investigates the characteristics of received probe packets and the reliability of bandwidth estimates when actively measuring the available bandwidth over radio interfaces in mobile communication networks is presented. Knowledge of available bandwidth is very useful in various contexts, e.g. in network management and adaptive streaming applications. Bandwidth measuring tools have so far primarily been designed for and evaluated in wired networks. However, such tools should also be examined in wireless networks since the use of, e.g., mobile broadband is rapidly increasing. The properties of wired and wireless links differ substantially, which affect the performance of the tools. We have made active-probing experiments over a high-speed downlink shared channel, which is used for High-Speed Downlink Packet Access (HSDPA) in the mobile communication technology UMTS, and over a forward traffic channel in CDMA2000 1xEV-DO. Both experiments were performed over commercial networks. They show that one cannot always expect uniform per-packet processing over the radio channel in mobile networks, which is expected by many probing tools. This reduces the reliability of the available-bandwidth estimates, however we suggest how this can be handled. Finally, the mobile-network measurements are compared to experiments performed in an IEEE 802.11 wireless LAN, where the radio channel does not create the same packet-processing behaviour. We also discuss the possibility of using the probe traffic for the purpose of identifying the communication technology at the bottleneck of the network path, assumed this is a wireless broadband link, by mapping specifications of standardised communication technologies to observed probe-traffic characteristics. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"1 1","pages":"255-267"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79034122","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Spectral and power efficiency of IEEE802.11n MIMO-OFDM WLAN systems using space-multimode-polarization diversity compact stacked circular microstrip antenna arrays 使用空间多模极化分集紧凑堆叠圆形微带天线阵列的IEEE802.11n MIMO-OFDM WLAN系统的频谱和功率效率
Pub Date : 2011-08-01 DOI: 10.1002/ett.1499
A. Yavanoglu, Ö. Ertug
Recent developments in wireless communication systems in indoor environments require high data rates and high transmission qualities especially for multimedia applications in wireless local area network (WLAN) systems. The support of high data rate multiple-input multiple-output (MIMO) spatial-multiplexing communication in orthogonal frequencydivision multiplexing WLAN systems conforming to IEEE802.11n standard requires the use of compact antennas with low correlation ports. In this paper, we analyse a MIMO array consisting of higher-order space-multimode-polarization diversity stacked circular microstrip patch uniform linear antenna arrays (SMP-SCP-ULAs) to exploit SMP diversity for use in WLAN systems. Using higher number of antenna ports in lower space and low cross-polar discrimination values between each transmit and receive antenna, SMP-SCP-ULA yields higher multiplexing gain and satisfies more restrictive size constraints in clustered MIMO systems. The performance gains of higher-order modal SMP-SCP-ULA are presented in terms of modal correlation, ergodic spectral efficiency, average bit error rate and compactness gain with respect to dipole and circular microstrip patch uniform linear arrays. Copyright © 2011 John Wiley & Sons, Ltd.
室内无线通信系统的最新发展要求高数据速率和高传输质量,特别是无线局域网(WLAN)系统中的多媒体应用。在符合IEEE802.11n标准的正交频分复用WLAN系统中,要支持高数据速率的多输入多输出(MIMO)空间复用通信,需要使用具有低相关端口的紧凑型天线。在本文中,我们分析了由高阶空间多模极化分集堆叠圆形微带贴片均匀线性天线阵列(SMP- scp - ula)组成的MIMO阵列,以利用SMP分集用于WLAN系统。SMP-SCP-ULA利用更低空间的天线端口数量和每个发射和接收天线之间的低交叉极性鉴别值,可以获得更高的复用增益,并满足集群MIMO系统中更严格的尺寸约束。相对于偶极子和圆形微带贴片均匀线性阵列,高阶模态SMP-SCP-ULA在模态相关、遍频效率、平均误码率和紧凑性增益方面的性能得到了提高。版权所有©2011 John Wiley & Sons, Ltd
{"title":"Spectral and power efficiency of IEEE802.11n MIMO-OFDM WLAN systems using space-multimode-polarization diversity compact stacked circular microstrip antenna arrays","authors":"A. Yavanoglu, Ö. Ertug","doi":"10.1002/ett.1499","DOIUrl":"https://doi.org/10.1002/ett.1499","url":null,"abstract":"Recent developments in wireless communication systems in indoor environments require high data rates and high transmission qualities especially for multimedia applications in wireless local area network (WLAN) systems. The support of high data rate multiple-input multiple-output (MIMO) spatial-multiplexing communication in orthogonal frequencydivision multiplexing WLAN systems conforming to IEEE802.11n standard requires the use of compact antennas with low correlation ports. In this paper, we analyse a MIMO array consisting of higher-order space-multimode-polarization diversity stacked circular microstrip patch uniform linear antenna arrays (SMP-SCP-ULAs) to exploit SMP diversity for use in WLAN systems. Using higher number of antenna ports in lower space and low cross-polar discrimination values between each transmit and receive antenna, SMP-SCP-ULA yields higher multiplexing gain and satisfies more restrictive size constraints in clustered MIMO systems. The performance gains of higher-order modal SMP-SCP-ULA are presented in terms of modal correlation, ergodic spectral efficiency, average bit error rate and compactness gain with respect to dipole and circular microstrip patch uniform linear arrays. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"10 1","pages":"231-239"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79413324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Linear combination-based energy detection algorithm in low signal-to-noise ratio for cognitive radios 基于线性组合的认知无线电低信噪比能量检测算法
Pub Date : 2011-08-01 DOI: 10.1002/ett.1470
Shibing Zhang, Zhihua Bao
This paper considers the spectrum sensing technique for cognitive radio-based on energy detection. It proposes an improved spectrum sensing algorithm by linearly combining the criteria of the probability of detection and the probability of false alarm. Then, the optimal decision threshold is derived for energy detection in the proposed linear combination (LC) algorithm. The performance of primal user detection is significantly improved by using the proposed LC algorithm, especially under low signal-to-noise ratios. Simulation results verify the effectiveness of the proposed algorithm with different kinds of primary user signals. Copyright © 2011 John Wiley & Sons, Ltd.
研究了基于能量检测的认知无线电频谱感知技术。将检测概率准则和虚警概率准则线性结合,提出了一种改进的频谱感知算法。在此基础上,推导出线性组合算法中能量检测的最优决策阈值。该算法显著提高了原始用户检测的性能,特别是在低信噪比条件下。仿真结果验证了该算法在不同类型主用户信号下的有效性。版权所有©2011 John Wiley & Sons, Ltd
{"title":"Linear combination-based energy detection algorithm in low signal-to-noise ratio for cognitive radios","authors":"Shibing Zhang, Zhihua Bao","doi":"10.1002/ett.1470","DOIUrl":"https://doi.org/10.1002/ett.1470","url":null,"abstract":"This paper considers the spectrum sensing technique for cognitive radio-based on energy detection. It proposes an improved spectrum sensing algorithm by linearly combining the criteria of the probability of detection and the probability of false alarm. Then, the optimal decision threshold is derived for energy detection in the proposed linear combination (LC) algorithm. The performance of primal user detection is significantly improved by using the proposed LC algorithm, especially under low signal-to-noise ratios. Simulation results verify the effectiveness of the proposed algorithm with different kinds of primary user signals. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"98 1","pages":"211-217"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79267345","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
MAP channel estimation with turbo processing for orthogonal space-time block coded MISO systems 基于turbo处理的正交空时分组编码MISO系统MAP信道估计
Pub Date : 2011-08-01 DOI: 10.1002/ett.1473
I. Kammoun, M. Siala
In this paper, we investigate fast time-varying channel estimation for two orthogonal space–time block-coded systems with either two or three transmit antennas and with one receive antenna. We propose an iterative expectation–maximisation-based maximum a posteriori (MAP) semi-blind algorithm for the estimation of the discrete propagation channels seen from the transmit antennas. This algorithm requires a convenient representation of the channel using a discrete version of the Karhunen-Loeve expansion theorem. It incorporates the coded structure of each block in a turbo-processing fashion and uses the MAP training-based channel estimation algorithm for its optimum initialisation. The transmit antennas are assumed to be spatially correlated for the system with two transmit antennas and spatially uncorrelated for the three-antenna system. The validity of the proposed algorithm is highlighted by simulation results. The performance of the proposed receivers, based on MAP channel estimation, for the two systems approaches that of the perfect channel state information receiver, even for very time selective fading channels. Copyright © 2011 John Wiley & Sons, Ltd.
本文研究了具有两个或三个发射天线和一个接收天线的两个正交空时分组编码系统的快速时变信道估计问题。我们提出了一种基于迭代期望最大化的最大后验(MAP)半盲算法,用于估计从发射天线看到的离散传播信道。该算法需要使用Karhunen-Loeve展开定理的离散版本来方便地表示信道。它将每个块的编码结构以涡轮处理的方式合并,并使用基于MAP训练的信道估计算法进行最佳初始化。对于具有两个发射天线的系统,假设发射天线空间相关,对于三天线系统,假设发射天线空间不相关。仿真结果验证了该算法的有效性。基于MAP信道估计的两种系统接收机的性能接近于完美信道状态信息接收机的性能,即使对于非常时间选择性衰落信道也是如此。版权所有©2011 John Wiley & Sons, Ltd
{"title":"MAP channel estimation with turbo processing for orthogonal space-time block coded MISO systems","authors":"I. Kammoun, M. Siala","doi":"10.1002/ett.1473","DOIUrl":"https://doi.org/10.1002/ett.1473","url":null,"abstract":"In this paper, we investigate fast time-varying channel estimation for two orthogonal space–time block-coded systems with either two or three transmit antennas and with one receive antenna. We propose an iterative expectation–maximisation-based maximum a posteriori (MAP) semi-blind algorithm for the estimation of the discrete propagation channels seen from the transmit antennas. This algorithm requires a convenient representation of the channel using a discrete version of the Karhunen-Loeve expansion theorem. It incorporates the coded structure of each block in a turbo-processing fashion and uses the MAP training-based channel estimation algorithm for its optimum initialisation. The transmit antennas are assumed to be spatially correlated for the system with two transmit antennas and spatially uncorrelated for the three-antenna system. The validity of the proposed algorithm is highlighted by simulation results. The performance of the proposed receivers, based on MAP channel estimation, for the two systems approaches that of the perfect channel state information receiver, even for very time selective fading channels. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"209 1","pages":"218-230"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77762536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Carrier sense adaptation with enhanced fairness in IEEE 802.15.4 WPAN IEEE 802.15.4 WPAN中增强公平性的载波感知自适应
Pub Date : 2011-08-01 DOI: 10.1002/ett.1467
Kyung-Joon Park, Kwanhee Jeong, Hyuk Lim, Daeyoung Park
We propose an adaptive carrier sense (CS) scheme with enhanced fairness based on an observation that the conventional adaptive CS mechanism may lead to significant unfairness. Our experimental study with an IEEE 802.15.4 WPAN testbed shows that the proposed algorithm significantly improves fairness compared to the conventional mechanism while providing competitive throughput performance. Copyright # 2011 John Wiley & Sons, Ltd.
在观察到传统的自适应载波感知机制可能导致显著不公平的基础上,提出了一种增强公平性的自适应载波感知方案。我们在IEEE 802.15.4 WPAN测试平台上的实验研究表明,与传统机制相比,该算法显著提高了公平性,同时提供了具有竞争力的吞吐量性能。版权所有# 2011约翰威利父子有限公司
{"title":"Carrier sense adaptation with enhanced fairness in IEEE 802.15.4 WPAN","authors":"Kyung-Joon Park, Kwanhee Jeong, Hyuk Lim, Daeyoung Park","doi":"10.1002/ett.1467","DOIUrl":"https://doi.org/10.1002/ett.1467","url":null,"abstract":"We propose an adaptive carrier sense (CS) scheme with enhanced fairness based on an observation that the conventional adaptive CS mechanism may lead to significant unfairness. Our experimental study with an IEEE 802.15.4 WPAN testbed shows that the proposed algorithm significantly improves fairness compared to the conventional mechanism while providing competitive throughput performance. Copyright # 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"1 1","pages":"179-184"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90610210","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
TCP flow aware adaptive path switching in diffserv enabled MPLS networks 支持diffserv的MPLS网络中TCP流感知自适应路径交换
Pub Date : 2011-08-01 DOI: 10.1002/ett.1468
O. Alparslan, N. Akar, Ezhan Karasan
We propose an adaptive flow-level multi-path routing-based traffic engineering solution for an IP backbone network carrying TCP/IP traffic. Incoming TCP flows are switched between two explicitly routed paths, namely the primary and secondary paths (PP and SP), for resilience and potential goodput improvement at the TCP layer. In the proposed architecture, PPs receive a preferential treatment over SPs using differentiated services mechanisms. The reason for this choice is not for service differentiation but for coping with the detrimental knock-on effect stemming from theuse of longer SP that is well known for conventional network load balancing algorithms. Moreover, both paths are congestion-controlled using Explicit Congestion Notification marking at the core and Additive Increase Multiplicative Decrease rate adjustment at the ingress nodes. The delay difference between PP and SP is estimated using two per-egress rate-controlling buffers maintained at the ingress nodes for each path, and this delay difference is used to determine the path over which a new TCP flow will be routed. We perform extensive simulations using ns-2 in order to demonstrate the viability of the proposed distributed adaptive multi-path routing method in terms of per-flow TCP goodput. The proposed solution consistently outperforms the single-path routing policy and provides substantial per-flow goodput gains under poor PP conditions. Moreover, highest goodput improvements under the proposed scheme are achieved by flows that receive the lowest goodputs with single-path routing, while the performance of the flows with high goodputs with single-path routing does not deteriorate with the proposed path switching technique. Copyright # 2011 John Wiley & Sons, Ltd.
针对承载TCP/IP流量的IP骨干网,提出了一种基于自适应流级多路径路由的流量工程解决方案。传入的TCP流在两个显式路由路径之间切换,即主路径和辅助路径(PP和SP),以提高TCP层的弹性和潜在的性能。在提出的体系结构中,使用差异化服务机制,pp比sp获得优先待遇。选择此选项的原因不是为了服务差异化,而是为了应对由于使用较长的SP(传统网络负载平衡算法中众所周知的SP)而产生的有害连锁效应。此外,这两条路径都使用显式拥塞通知标记作为核心,在入口节点使用加性增加乘性减少率调整来控制拥塞。PP和SP之间的延迟差异是使用在每个路径的入口节点上维护的两个每个出口速率控制缓冲区来估计的,并且该延迟差异用于确定新TCP流路由的路径。我们使用ns-2进行了广泛的模拟,以证明所提出的分布式自适应多路径路由方法在每流TCP good - put方面的可行性。所提出的解决方案始终优于单路径路由策略,并在较差的PP条件下提供可观的每流good - put增益。此外,在提出的方案下,单路径路由下获得最低优卖权的流获得了最大的优卖权改进,而单路径路由下获得高优卖权的流的性能不会因所提出的路径交换技术而下降。版权所有# 2011约翰威利父子有限公司
{"title":"TCP flow aware adaptive path switching in diffserv enabled MPLS networks","authors":"O. Alparslan, N. Akar, Ezhan Karasan","doi":"10.1002/ett.1468","DOIUrl":"https://doi.org/10.1002/ett.1468","url":null,"abstract":"We propose an adaptive flow-level multi-path routing-based traffic engineering solution for an IP backbone network carrying TCP/IP traffic. Incoming TCP flows are switched between two explicitly routed paths, namely the primary and secondary paths (PP and SP), for resilience and potential goodput improvement at the TCP layer. In the proposed architecture, PPs receive a preferential treatment over SPs using differentiated services mechanisms. The reason for this choice is not for service differentiation but for coping with the detrimental knock-on effect stemming from theuse of longer SP that is well known for conventional network load balancing algorithms. Moreover, both paths are congestion-controlled using Explicit Congestion Notification marking at the core and Additive Increase Multiplicative Decrease rate adjustment at the ingress nodes. The delay difference between PP and SP is estimated using two per-egress rate-controlling buffers maintained at the ingress nodes for each path, and this delay difference is used to determine the path over which a new TCP flow will be routed. We perform extensive simulations using ns-2 in order to demonstrate the viability of the proposed distributed adaptive multi-path routing method in terms of per-flow TCP goodput. The proposed solution consistently outperforms the single-path routing policy and provides substantial per-flow goodput gains under poor PP conditions. Moreover, highest goodput improvements under the proposed scheme are achieved by flows that receive the lowest goodputs with single-path routing, while the performance of the flows with high goodputs with single-path routing does not deteriorate with the proposed path switching technique. Copyright # 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"80 1","pages":"185-199"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86832341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
On fair rate adaption in interference-limited systems 限制干扰系统中的公平速率自适应
Pub Date : 2011-08-01 DOI: 10.1002/ett.1469
A. Schmeink
A fair allocation of scarce resources is crucial in systems where multiple entities compete for the same goods. General interference-limited communication systems with rate adaption are investigated in this paper and the problem of fair resource allocation is addressed by two different approaches. First, a non game theoretic fairness approach is applied to the system model. Then bargaining theory is exploited to derive a game theoretic fairness concept. To compensate the information transmission necessary in the bargaining game, so-called incentive parameters are introduced. The solution of the thereby obtained local problem coincides with the Nash bargaining solution of the global problem if the incentive parameters are properly chosen. Numerical results show the advantage of the game theoretical modelling with respect to fairness and efficiency. Copyright © 2011 John Wiley & Sons, Ltd.
在多个实体竞争同一商品的系统中,稀缺资源的公平分配至关重要。本文研究了具有速率自适应的一般干扰限制通信系统,并通过两种不同的方法解决了资源公平分配问题。首先,将非博弈论的公平方法应用于系统模型。然后利用议价理论推导出博弈论的公平概念。为了补偿讨价还价博弈中必要的信息传递,引入了所谓的激励参数。在适当选择激励参数的情况下,得到的局部问题解与全局问题的纳什议价解一致。数值结果表明了博弈论模型在公平和效率方面的优势。版权所有©2011 John Wiley & Sons, Ltd
{"title":"On fair rate adaption in interference-limited systems","authors":"A. Schmeink","doi":"10.1002/ett.1469","DOIUrl":"https://doi.org/10.1002/ett.1469","url":null,"abstract":"A fair allocation of scarce resources is crucial in systems where multiple entities compete for the same goods. General interference-limited communication systems with rate adaption are investigated in this paper and the problem of fair resource allocation is addressed by two different approaches. First, a non game theoretic fairness approach is applied to the system model. Then bargaining theory is exploited to derive a game theoretic fairness concept. To compensate the information transmission necessary in the bargaining game, so-called incentive parameters are introduced. The solution of the thereby obtained local problem coincides with the Nash bargaining solution of the global problem if the incentive parameters are properly chosen. Numerical results show the advantage of the game theoretical modelling with respect to fairness and efficiency. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"94 1","pages":"200-210"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81114663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Common problems in delay-based congestion control algorithms: a gallery of solutions 基于延迟的拥塞控制算法中的常见问题:一系列解决方案
Pub Date : 2011-06-01 DOI: 10.1002/ett.1485
M. Rodríguez-Pérez, S. Herrería-Alonso, M. Fernández-Veiga, C. López-García
Although delay-based congestion control protocols such as FAST Transmission Control Protocol (TCP) promise to deliver better performance than traditional TCP Reno, they have not yet been widely incorporated to the Internet. Several factors have contributed to their lack of deployment. Probably, the main contributing factor is that they are not able to compete fairly against loss-based congestion control protocols. In fact, the transmission rate in equilibrium of delay-based approaches is always less than their fair share when they share the network with traditional TCP Reno derivatives that employ packet losses as their congestion signal. There are also other performance impairments caused by the sensitivity to errors in the measurement of the congestion signal (queuing delay) that reduce the efficiency and the intra-protocol fairness of the algorithms. In this paper, we report, analyse and discuss some recent proposals in the literature to improve the dynamic behaviour of delay-based congestion control algorithms, FAST in particular. The coexistence of sources reacting differently to congestion, the identification of congestion appearance in the reverse path and the persistent congestion problem are the issues specifically addressed. Copyright © 2011 John Wiley & Sons, Ltd.
尽管基于延迟的拥塞控制协议,如FAST传输控制协议(TCP)承诺提供比传统TCP Reno更好的性能,但它们还没有被广泛地纳入互联网。有几个因素导致它们没有得到部署。可能,主要的影响因素是它们无法与基于损失的拥塞控制协议公平竞争。事实上,当基于延迟的方法与使用丢包作为拥塞信号的传统TCP Reno衍生物共享网络时,其均衡传输速率总是小于其公平份额。此外,由于对拥塞信号(排队延迟)测量误差的敏感性,还会导致其他性能损害,从而降低算法的效率和协议内公平性。在本文中,我们报告、分析和讨论了一些最近在文献中的建议,以改善基于延迟的拥塞控制算法的动态行为,特别是FAST。对拥塞作出不同反应的源的共存,反向路径中拥塞外观的识别以及持续拥塞问题是具体解决的问题。版权所有©2011 John Wiley & Sons, Ltd
{"title":"Common problems in delay-based congestion control algorithms: a gallery of solutions","authors":"M. Rodríguez-Pérez, S. Herrería-Alonso, M. Fernández-Veiga, C. López-García","doi":"10.1002/ett.1485","DOIUrl":"https://doi.org/10.1002/ett.1485","url":null,"abstract":"Although delay-based congestion control protocols such as FAST Transmission Control Protocol (TCP) promise to deliver better performance than traditional TCP Reno, they have not yet been widely incorporated to the Internet. Several factors have contributed to their lack of deployment. Probably, the main contributing factor is that they are not able to compete fairly against loss-based congestion control protocols. In fact, the transmission rate in equilibrium of delay-based approaches is always less than their fair share when they share the network with traditional TCP Reno derivatives that employ packet losses as their congestion signal. There are also other performance impairments caused by the sensitivity to errors in the measurement of the congestion signal (queuing delay) that reduce the efficiency and the intra-protocol fairness of the algorithms. In this paper, we report, analyse and discuss some recent proposals in the literature to improve the dynamic behaviour of delay-based congestion control algorithms, FAST in particular. The coexistence of sources reacting differently to congestion, the identification of congestion appearance in the reverse path and the persistent congestion problem are the issues specifically addressed. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"15 1","pages":"168-179"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73235589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Traffic models for future backbone networks - a service-oriented approach 未来骨干网的流量模型——面向服务的方法
Pub Date : 2011-06-01 DOI: 10.1002/ett.1464
E. Palkopoulou, Christian Merkle, D. Schupke, C. Gruber, A. Kirstädter
In this paper we present a novel approach to assess the impact of new and existing services on traffic volume in current and future backbone networks. Several proposals to model traffic load in access and backbone networks exist in the literature. These proposals consider current Internet traffic like http, smtp, ftp and Peer-to-Peer (P2P). We expect, however, that there will be a change in traffic load for future networks caused by services like IP Television (IPTV), Video on Demand (VoD) and Virtual Private Networks (VPN). Additionally, population-based models may no longer be applicable due to the widespread use of service-providers and hierarchical routing through network peering points. Therefore, it is important to reassess future traffic volumes and traffic patterns and to identify those services that have the most impact on the networks. We model today's traffic volume of each of the described services and estimate future traffic volumes taking peering points into account. To illustrate the different traffic flows and to characterise the traffic distribution we apply our results to a Germany reference network. Copyright © 2010 John Wiley & Sons, Ltd.
在本文中,我们提出了一种新的方法来评估新的和现有的服务对当前和未来骨干网络流量的影响。文献中存在几种对接入网和骨干网流量负荷建模的建议。这些建议考虑了当前的互联网流量,如http、smtp、ftp和点对点(P2P)。然而,我们预计,未来网络的流量负荷将因IP电视(IPTV)、视频点播(VoD)和虚拟专用网(VPN)等服务而发生变化。此外,由于服务提供者和通过网络对等点的分层路由的广泛使用,基于人口的模型可能不再适用。因此,重新评估未来的交通量和交通模式并确定那些对网络影响最大的服务是很重要的。我们对所描述的每个服务的当前流量进行建模,并将对等点考虑在内,估计未来的流量。为了说明不同的交通流量和表征交通分布,我们将我们的结果应用于德国参考网络。版权所有©2010 John Wiley & Sons, Ltd
{"title":"Traffic models for future backbone networks - a service-oriented approach","authors":"E. Palkopoulou, Christian Merkle, D. Schupke, C. Gruber, A. Kirstädter","doi":"10.1002/ett.1464","DOIUrl":"https://doi.org/10.1002/ett.1464","url":null,"abstract":"In this paper we present a novel approach to assess the impact of new and existing services on traffic volume in current and future backbone networks. Several proposals to model traffic load in access and backbone networks exist in the literature. These proposals consider current Internet traffic like http, smtp, ftp and Peer-to-Peer (P2P). We expect, however, that there will be a change in traffic load for future networks caused by services like IP Television (IPTV), Video on Demand (VoD) and Virtual Private Networks (VPN). Additionally, population-based models may no longer be applicable due to the widespread use of service-providers and hierarchical routing through network peering points. Therefore, it is important to reassess future traffic volumes and traffic patterns and to identify those services that have the most impact on the networks. We model today's traffic volume of each of the described services and estimate future traffic volumes taking peering points into account. To illustrate the different traffic flows and to characterise the traffic distribution we apply our results to a Germany reference network. Copyright © 2010 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"58 1","pages":"137-150"},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85096602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
期刊
European Transactions on Telecommunications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1