European Transactions on Telecommunications最新文献

英文中文

A new statistical method for detecting network anomalies in TCP traffic 一种检测TCP流量中网络异常的统计方法

European Transactions on Telecommunications

Pub Date : 2010-11-01 DOI: 10.1002/ett.1432

C. Callegari, Sandrine Vaton, M. Pagano

SUMMARY In the last few years, the number and impact of security attacks over the Internet have been continuously increasing. To face this issue, the use of Intrusion Detection Systems (IDSs) has emerged as a key element in network security. In this paper we address the problem considering a novel statistical technique for detecting network anomalies. Our approach is based on the use of different families of Markovian models, namely high order and non-homogeneous Markov chains, for modeling network traffic running over TCP. The performance results shown in the paper justify the proposed method and highlight the improvements over commonly used statistical techniques. Copyright © 2010 John Wiley & Sons, Ltd.

在过去的几年里，互联网上的安全攻击的数量和影响都在不断增加。针对这一问题，使用入侵检测系统(ids)已成为网络安全的一个关键因素。在本文中，我们考虑一种新的统计技术来检测网络异常来解决这个问题。我们的方法是基于使用不同家族的马尔可夫模型，即高阶和非齐次马尔可夫链，用于在TCP上运行的网络流量建模。本文的性能结果证明了所提出的方法是正确的，并突出了对常用统计技术的改进。版权所有©2010 John Wiley & Sons, Ltd

引用次数: 13

Relay association method for optimal path in IEEE 802.16j mobile multi-hop relay networks IEEE 802.16j移动多跳中继网络中最优路径的中继关联方法

European Transactions on Telecommunications

Pub Date : 2010-11-01 DOI: 10.1002/ett.1419

Sojeong Ann, H. Kim

IEEE 802.16j mobile multi-hop relay (MMR) is an attractive solution for coverage extension and throughput enhancement on IEEE 802.16e networks. IEEE 802.16j MMR requires a method for finding the relay station (RS) route that minimises latency and maximises throughput. In this paper, we propose such a path selection method called optimal path relay association (OPRA). In this method, each RS in the MMR network is capable of finding its optimal path with path metrics which are available link bandwidth, signal-to-noise ratio (SNR), and hop count. Simulation results show that OPRA achieves performance gains over other path selection methods. Copyright © 2010 John Wiley & Sons, Ltd.

IEEE 802.16j移动多跳中继(MMR)是IEEE 802.16e网络覆盖扩展和吞吐量增强的一个有吸引力的解决方案。IEEE 802.16j MMR需要一种寻找中继站(RS)路由的方法，使延迟最小化，吞吐量最大化。本文提出了一种称为最优路径中继关联(OPRA)的路径选择方法。在该方法中，MMR网络中的每个RS都能够通过可用链路带宽、信噪比(SNR)和跳数等路径指标找到其最优路径。仿真结果表明，与其他路径选择方法相比，OPRA算法的性能有所提高。版权所有©2010 John Wiley & Sons, Ltd

引用次数: 15

Pre-LNA smart soft antenna selection for MIMO spatial multiplexing/diversity system when amplifier/sky noise dominates 放大器/天空噪声占主导的MIMO空间复用/分集系统的预lna智能软天线选择

European Transactions on Telecommunications

Pub Date : 2010-11-01 DOI: 10.1002/ett.1430

J. Ahmadi-shokouh, S. H. Jamali, S. Safavi-Naeini

Due to a beamforming capability, Soft Antenna Selection (SAS) techniques have shown great performance improvements over the traditional antenna sub-set selection schemes for Multi-Input and Multi-Output (MIMO) communication systems. A SAS method is basically defined by a pre-processing matrix which is located in RF domain, either before or after the Low Noise Amplifier (LNA). In this paper, we propose a pre-LNA SAS module which is adaptively tuned to maximise the mutual information or the Signal to Noise Ratio (SNR) gain for spatial multiplexing or diversity transmissions, respectively. The SAS optimality is discussed for the two practical cases where either the sky noise or the amplifier noise dominates. We analytically show that the pre-LNA SAS method even outperforms the full-complexity MIMO system for when the number of receive Radio Frequency (RF) chains is greater than or equal to the number of the transmit RF chains. The simulation results verify this claim and also superiority of the proposed scheme to the post-LNA SAS. Copyright © 2010 John Wiley & Sons, Ltd.

由于具有波束形成能力，软天线选择(SAS)技术在多输入多输出(MIMO)通信系统中比传统的天线子集选择方案表现出了很大的性能改进。SAS方法基本上是由位于RF域的预处理矩阵定义的，该预处理矩阵位于低噪声放大器(LNA)之前或之后。在本文中，我们提出了一种预lna SAS模块，该模块可自适应调谐，分别用于空间复用或分集传输，以最大化互信息或信噪比(SNR)增益。针对天空噪声或放大器噪声占主导地位的两种实际情况，讨论了SAS的最优性。分析表明，当接收射频链的数量大于或等于发射射频链的数量时，pre-LNA SAS方法甚至优于全复杂度MIMO系统。仿真结果验证了这一说法，也证明了该方案相对于后lna SAS的优越性。版权所有©2010 John Wiley & Sons, Ltd

引用次数: 6

Covariance precoding schemes for MIMO OFDM over transmit-antenna and path-correlated channels 发射天线和路径相关信道上MIMO OFDM的协方差预编码方案

European Transactions on Telecommunications

Pub Date : 2010-11-01 DOI: 10.1002/ett.1429

Y. Fu, W. Krzymień, C. Tellambura

This paper considers covariance-feedback based linear precoding (LP) and nonlinear Tomlinson–Harashima precoding (THP) for multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems. Orthogonal space–time block coded (OSTBC)‡ OFDM and spatially-multiplexed (SM)§ OFDM are analysed. The main objective is to design precoders to mitigate the impact of transmit-antenna and path correlations. The impact of path correlations on the pairwise error probability (PEP) of MIMO OFDM is also analysed. Closed-form, waterfilling-based covariance precoders are derived to minimize the worst case PEP in OSTBC OFDM. An adaptive transmission strategy is also developed for switching between precoded SM OFDM and precoded OSTBC OFDM. The switching criterion is the minimum Euclidean distance of the received codebook. The switching decision sent to the transmitter requires one feedback bit per subcarrier. The proposed precoders considerably reduce the error rate in antenna and path-correlated channels; nonlinear precoders perform better than linear precoders. We show that the adaptive strategy can achieve full diversity gain, and it outperforms either SM or OSTBC applied individually in terms of the bit error rate (BER). Copyright © 2010 John Wiley & Sons, Ltd.

研究了多输入多输出正交频分复用(OFDM)系统中基于协方差反馈的线性预编码(LP)和非线性Tomlinson-Harashima预编码(THP)。分析了正交空时分组编码(OSTBC) OFDM和空间复用(SM) OFDM。主要目标是设计预编码器，以减轻发射天线和路径相关的影响。分析了路径相关性对MIMO OFDM的成对误差概率(PEP)的影响。导出了封闭形式的、基于注水的协方差预编码器，以最小化OSTBC OFDM中最坏情况下的PEP。在预编码的SM OFDM和预编码的OSTBC OFDM之间，提出了一种自适应传输策略。切换准则是接收码本的最小欧氏距离。发送到发射机的开关决定需要每个子载波一个反馈位。所提出的预编码器大大降低了天线和路径相关信道中的误码率;非线性预编码器比线性预编码器性能更好。研究表明，该自适应策略可以获得完全的分集增益，并且在误码率(BER)方面优于SM或OSTBC单独应用。版权所有©2010 John Wiley & Sons, Ltd

{"title":"Covariance precoding schemes for MIMO OFDM over transmit-antenna and path-correlated channels","authors":"Y. Fu, W. Krzymień, C. Tellambura","doi":"10.1002/ett.1429","DOIUrl":"https://doi.org/10.1002/ett.1429","url":null,"abstract":"This paper considers covariance-feedback based linear precoding (LP) and nonlinear Tomlinson–Harashima precoding (THP) for multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems. Orthogonal space–time block coded (OSTBC)‡ OFDM and spatially-multiplexed (SM)§ OFDM are analysed. The main objective is to design precoders to mitigate the impact of transmit-antenna and path correlations. The impact of path correlations on the pairwise error probability (PEP) of MIMO OFDM is also analysed. Closed-form, waterfilling-based covariance precoders are derived to minimize the worst case PEP in OSTBC OFDM. An adaptive transmission strategy is also developed for switching between precoded SM OFDM and precoded OSTBC OFDM. The switching criterion is the minimum Euclidean distance of the received codebook. The switching decision sent to the transmitter requires one feedback bit per subcarrier. The proposed precoders considerably reduce the error rate in antenna and path-correlated channels; nonlinear precoders perform better than linear precoders. We show that the adaptive strategy can achieve full diversity gain, and it outperforms either SM or OSTBC applied individually in terms of the bit error rate (BER). Copyright © 2010 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"28 1","pages":"611-623"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91276599","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}

引用次数: 7

Probabilistic signal shaping in MIMO OFDM via successive candidate generation MIMO OFDM中通过连续候选生成的概率信号整形

European Transactions on Telecommunications

Pub Date : 2010-11-01 DOI: 10.1002/ett.1416

R. Fischer, C. Siegl

In this paper, the recently introduced method of channel-coding-based peak-to-average power ratio (PAR) reduction is further developed. On the one hand, not only PAR is considered, but a broad class of signal parameters to be optimised is treated by defining a respective metric to be minimised. On the other hand, the candidate generation and assessment is done successively. If a given tolerable metric limit is met the procedure stops. Analytical expressions for the average number of tested candidates and the achieved performance are derived. Critical metric values, as generalisation of the ‘critical’ PAR value ξ = log(D), where D is the number of carriers, are defined. The theoretical statements are covered by means of numerical simulations using either PAR or cubic metric as desired signal parameter. Copyright © 2010 John Wiley & Sons, Ltd.

本文对最近提出的基于信道编码的峰值平均功率比(PAR)降低方法进行了进一步的发展。一方面，不仅考虑了PAR，而且通过定义要最小化的相应度量来处理要优化的广泛的信号参数。另一方面，依次进行候选项的生成和评估。如果满足给定的可容忍度量限制，则过程停止。导出了平均考生人数和达到的成绩的解析表达式。定义了临界度量值，作为“临界”PAR值ξ = log(D)的概括，其中D是载流子的数量。理论陈述是通过使用PAR或立方度作为所需信号参数的数值模拟来涵盖的。版权所有©2010 John Wiley & Sons, Ltd

引用次数: 2

The persistent congestion problem of FAST-TCP: analysis and solutions FAST-TCP的持续拥塞问题分析与解决方法

European Transactions on Telecommunications

Pub Date : 2010-10-01 DOI: 10.1002/ett.1407

M. Rodríguez-Pérez, S. Herrería-Alonso, M. Fernández-Veiga, C. López-García

FAST-TCP achieves better performance than traditional TCP-Reno schemes, but unfortunately it is inherently unfair to older connections due to wrong estimations of the round-trip propagation delay. This paper presents a model for this anomalous behaviour of FAST flows, known as the persistent congestion problem. We first develop an elementary analysis for a scenario with just two flows, and then build up the general case with an arbitrary number of flows. The model correctly quantifies how much unfairness shows up among the different connections, confirming experimental observations made by several previous studies. We built on this model to develop an algorithm to obtain a good estimate of the propagation delay for FAST-TCP that enables to achieve fairness between aged and new connections while preserving the high throughput and low buffer occupancy of the original protocol. Furthermore, our proposal only requires a modification of the sender host, avoiding the need to upgrade the intermediate routers in any way. Copyright © 2010 John Wiley & Sons, Ltd.

FAST-TCP实现了比传统TCP-Reno方案更好的性能，但不幸的是，由于对往返传播延迟的错误估计，它对较旧的连接本质上是不公平的。本文提出了FAST流的这种异常行为的一个模型，称为持续拥塞问题。我们首先为只有两个流的场景开发一个基本分析，然后用任意数量的流构建一般情况。该模型正确地量化了不同连接之间出现的不公平程度，证实了之前几项研究的实验观察结果。在此模型的基础上，我们开发了一种算法来获得对FAST-TCP传播延迟的良好估计，该算法能够在保持原始协议的高吞吐量和低缓冲区占用的同时，实现旧连接和新连接之间的公平性。此外，我们的建议只需要修改发送主机，避免了以任何方式升级中间路由器的需要。版权所有©2010 John Wiley & Sons, Ltd

引用次数: 4

Power efficiency of thin clients 瘦客户机的电源效率

European Transactions on Telecommunications

Pub Date : 2010-10-01 DOI: 10.1002/ett.1431

W. Vereecken, L. Deboosere, P. Simoens, B. Vermeulen, D. Colle, Chris Develder, M. Pickavet, B. Dhoedt, P. Demeester

Worldwide, awareness for energy consumption is rising because of global energy production limits as well as because of environmental concerns. As the energy fraction currently consumed by ICT-related equipment is substantial (about 8 per cent of electricity consumption worldwide in the use phase) and the growth rate in this particular sector is spectacular, in the ICT sector, adequate solutions are needed to allow sustainable growth. In this paper we aim at reducing power consumption of desktop applications by applying a thin client approach and we analyse the conditions necessary. To this end, estimates on power consumptions in typical desktop scenarios and analogous thin client settings are made and analysed. The paper concludes with an experimental study on currently available equipment, to translate the generic conclusions into their current implications and trade-offs. Copyright © 2010 John Wiley & Sons, Ltd.

在世界范围内，由于全球能源生产的限制以及对环境的关注，对能源消耗的认识正在提高。由于目前与信通技术有关的设备消耗的能源比例很大(在使用阶段约占全世界电力消耗的8%)，而且这一特定部门的增长率惊人，因此在信通技术部门，需要适当的解决办法才能实现可持续增长。在本文中，我们旨在通过应用瘦客户机方法来降低桌面应用程序的功耗，并分析了必要的条件。为此，对典型桌面场景和类似瘦客户机设置下的功耗进行了估计和分析。本文最后对现有设备进行了实验研究，将一般结论转化为其当前的含义和权衡。版权所有©2010 John Wiley & Sons, Ltd

引用次数: 18

Ethernet label spaces dependency on network topology 以太网标签空间依赖于网络拓扑结构

European Transactions on Telecommunications

Pub Date : 2010-10-01 DOI: 10.1002/ett.1412

L. F. Caro, D. Papadimitriou, J. Marzo

Label space consumption has been studied in label-based forwarding architectures such as multi-protocol label switching (MPLS) to reduce forwarding table sizes and lookup complexity, to simplify network management, and to limit operational expenditures. On the other hand, nowadays label-based forwarding is also considered in the context of carrier class Ethernet architectures. Given that these architectures may use different label scopes (domain-wide vs. local) and size spaces (depending on their encoding), there is a need to analyse and compare the properties of their respective label spaces, particularly in terms of scalability. In this paper, the impact of topology characteristics on label space consumption is studied. The dependency on factors such as the number of nodes, the topology node degree and the network structure is determined (both analytically and via experimentation), allowing a detailed comparison between the properties of the evaluated label spaces. Proposed techniques that can be applied to improve label space usage for label-based Ethernet forwarding architectures are considered. The proposed methodology and results can serve as guidelines for the design of future label based forwarding architectures. Copyright © 2010 John Wiley & Sons, Ltd.

为了减少转发表的大小和查找复杂度，简化网络管理，限制运营支出，研究了基于标签的转发架构(如多协议标签交换MPLS)中标签空间的消耗。另一方面，目前基于标签的转发也被考虑在载波级以太网架构的背景下。考虑到这些体系结构可能使用不同的标签范围(域范围vs.局部)和大小空间(取决于它们的编码)，有必要分析和比较它们各自标签空间的属性，特别是在可伸缩性方面。本文研究了拓扑特征对标签空间消耗的影响。对诸如节点数量、拓扑节点度和网络结构等因素的依赖是确定的(通过分析和实验)，允许对评估的标签空间的属性进行详细的比较。在基于标签的以太网转发体系结构中，提出了可用于改进标签空间使用的技术。所提出的方法和结果可以作为未来基于标签的转发架构设计的指导方针。版权所有©2010 John Wiley & Sons, Ltd

{"title":"Ethernet label spaces dependency on network topology","authors":"L. F. Caro, D. Papadimitriou, J. Marzo","doi":"10.1002/ett.1412","DOIUrl":"https://doi.org/10.1002/ett.1412","url":null,"abstract":"Label space consumption has been studied in label-based forwarding architectures such as multi-protocol label switching (MPLS) to reduce forwarding table sizes and lookup complexity, to simplify network management, and to limit operational expenditures. On the other hand, nowadays label-based forwarding is also considered in the context of carrier class Ethernet architectures. Given that these architectures may use different label scopes (domain-wide vs. local) and size spaces (depending on their encoding), there is a need to analyse and compare the properties of their respective label spaces, particularly in terms of scalability. In this paper, the impact of topology characteristics on label space consumption is studied. The dependency on factors such as the number of nodes, the topology node degree and the network structure is determined (both analytically and via experimentation), allowing a detailed comparison between the properties of the evaluated label spaces. Proposed techniques that can be applied to improve label space usage for label-based Ethernet forwarding architectures are considered. The proposed methodology and results can serve as guidelines for the design of future label based forwarding architectures. Copyright © 2010 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"86 1","pages":"491-503"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89597891","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}

引用次数: 3

Uplink scheduling in LTE systems using distributed base stations 使用分布式基站的LTE系统中的上行链路调度

European Transactions on Telecommunications

Pub Date : 2010-10-01 DOI: 10.1002/ett.1408

E. Yaacoub, Z. Dawy

3GPP, 2006, 25814 3GPP TR; *ALC LUC, 2008, ALC LUC UNV 3G CDMA; *ALC LUC, 2008, ALC LUC EXP 3G W CDM; [Anonymous], 2008, 36213 3GPP TS; Calabrese F., 2008, P IEEE VEH TECHN C S; CHOI W, 2005, P INT C WIR NETW COM; Choi W, 2007, IEEE T WIREL COMMUN, V6, P69, DOI 10.1109-TWC.2007.05207; CLARK MV, 2001, P IEEE VEH TECHN C S; *CPRI, 2004, CPRI SPEC COMM PUBL; DAI L, 2002, P IEEE GLOB TAIP TAI; Dai L, 2005, IEEE T WIREL COMMUN, V4, P2613, DOI 10.1109-TWC.2005.858011; Ekstrom H, 2006, IEEE COMMUN MAG, V44, P38, DOI 10.1109-MCOM.2006.1607864; Gao L, 2008, IEEE T WIREL COMMUN, V7, P1507, DOI 10.1109-TWC.2008.061059; HADISUSANTO Y, 2008, P IEEE GLOB NEW ORL; HASEGAWA R, 2003, P IEEE VEH TECHN C F; HIGHSMITH WR, 2002, P IEEE SOUTH COL S C; Huang JW, 2009, IEEE J SEL AREA COMM, V27, P226, DOI 10.1109-JSAC.2009.090213; Kim K, 2005, IEEE COMMUN LETT, V9, P526, DOI 10.1109-LCOMM.2005.06018; LEROUX P, 2008, P INT C ADV TECHN CO; LIM J, 2006, P IEEE VEH TECHN C F; LUNTTILA T, 2007, P INT S WIR PERV COM; MYUNG HG, 2008, SINGLE CARRIER FDMA; Myung HG, 2006, IEEE VEH TECHNOL MAG, V1, P30, DOI 10.1109-MVT.2006.307304; Ng CY, 2008, IEEE T WIREL COMMUN, V7, P1667, DOI 10.1109-TWC.2008.060723; Qiu XX, 1999, IEEE T COMMUN, V47, P884; ROH W, 2002, P IEEE VEH TECHN C F; SALEH AAM, 1987, IEEE T COMMUN, V35, P1245, DOI 10.1109-TCOM.1987.1096716; SCHUH RE, 2002, P IEEE VEH TECHN C S; Song GC, 2005, IEEE T WIREL COMMUN, V4, P625, DOI 10.1109-TWC.2004.843067; Song GC, 2005, IEEE T WIREL COMMUN, V4, P614, DOI 10.1109-TWC.2004.843065; WANG X, 2008, P IEEE INT S INF THE; Wong CY, 1999, IEEE J SEL AREA COMM, V17, P1747; Wong IC, 2008, IEEE T WIREL COMMUN, V7, P962, DOI 10.1109-TWC.2008.060718; Wong IC, 2009, IEEE T WIREL COMMUN, V8, P2161, DOI 10.1109-TWC.2009.061038; Wu H., 2007, P IEEE INT S PERS IN; YAACOUB E, 2009, P IEEE WIR COMM NETW; YAACOUB E, 2009, P IEEE INT S COMP CO; ZHANG J, 2007, P IEEE GLOB WASH DC; Zhang J, 2008, IEEE T WIREL COMMUN, V7, P3636, DOI 10.1109-TWC.2008.070425

{"title":"Uplink scheduling in LTE systems using distributed base stations","authors":"E. Yaacoub, Z. Dawy","doi":"10.1002/ett.1408","DOIUrl":"https://doi.org/10.1002/ett.1408","url":null,"abstract":"3GPP, 2006, 25814 3GPP TR; *ALC LUC, 2008, ALC LUC UNV 3G CDMA; *ALC LUC, 2008, ALC LUC EXP 3G W CDM; [Anonymous], 2008, 36213 3GPP TS; Calabrese F., 2008, P IEEE VEH TECHN C S; CHOI W, 2005, P INT C WIR NETW COM; Choi W, 2007, IEEE T WIREL COMMUN, V6, P69, DOI 10.1109-TWC.2007.05207; CLARK MV, 2001, P IEEE VEH TECHN C S; *CPRI, 2004, CPRI SPEC COMM PUBL; DAI L, 2002, P IEEE GLOB TAIP TAI; Dai L, 2005, IEEE T WIREL COMMUN, V4, P2613, DOI 10.1109-TWC.2005.858011; Ekstrom H, 2006, IEEE COMMUN MAG, V44, P38, DOI 10.1109-MCOM.2006.1607864; Gao L, 2008, IEEE T WIREL COMMUN, V7, P1507, DOI 10.1109-TWC.2008.061059; HADISUSANTO Y, 2008, P IEEE GLOB NEW ORL; HASEGAWA R, 2003, P IEEE VEH TECHN C F; HIGHSMITH WR, 2002, P IEEE SOUTH COL S C; Huang JW, 2009, IEEE J SEL AREA COMM, V27, P226, DOI 10.1109-JSAC.2009.090213; Kim K, 2005, IEEE COMMUN LETT, V9, P526, DOI 10.1109-LCOMM.2005.06018; LEROUX P, 2008, P INT C ADV TECHN CO; LIM J, 2006, P IEEE VEH TECHN C F; LUNTTILA T, 2007, P INT S WIR PERV COM; MYUNG HG, 2008, SINGLE CARRIER FDMA; Myung HG, 2006, IEEE VEH TECHNOL MAG, V1, P30, DOI 10.1109-MVT.2006.307304; Ng CY, 2008, IEEE T WIREL COMMUN, V7, P1667, DOI 10.1109-TWC.2008.060723; Qiu XX, 1999, IEEE T COMMUN, V47, P884; ROH W, 2002, P IEEE VEH TECHN C F; SALEH AAM, 1987, IEEE T COMMUN, V35, P1245, DOI 10.1109-TCOM.1987.1096716; SCHUH RE, 2002, P IEEE VEH TECHN C S; Song GC, 2005, IEEE T WIREL COMMUN, V4, P625, DOI 10.1109-TWC.2004.843067; Song GC, 2005, IEEE T WIREL COMMUN, V4, P614, DOI 10.1109-TWC.2004.843065; WANG X, 2008, P IEEE INT S INF THE; Wong CY, 1999, IEEE J SEL AREA COMM, V17, P1747; Wong IC, 2008, IEEE T WIREL COMMUN, V7, P962, DOI 10.1109-TWC.2008.060718; Wong IC, 2009, IEEE T WIREL COMMUN, V8, P2161, DOI 10.1109-TWC.2009.061038; Wu H., 2007, P IEEE INT S PERS IN; YAACOUB E, 2009, P IEEE WIR COMM NETW; YAACOUB E, 2009, P IEEE INT S COMP CO; ZHANG J, 2007, P IEEE GLOB WASH DC; Zhang J, 2008, IEEE T WIREL COMMUN, V7, P3636, DOI 10.1109-TWC.2008.070425","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"51 1","pages":"532-543"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86171085","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}

引用次数: 18

Cost-effective upgrade of WDM all-optical networks using overlay fibres and hop reduction links 采用覆盖光纤和跳数减少链路的WDM全光网络的经济有效升级

European Transactions on Telecommunications

Pub Date : 2010-10-01 DOI: 10.1002/ett.1444

F. Farjady, K. Kim, N. E. Dahdah, N. Doran

Fibre overlay is a cost-effective technique to alleviate wavelength blocking in some links of a wavelength-routed optical network by increasing the number of wavelengths in those links. In this letter, we investigate the effects of overlaying fibre in an all-optical network (AON) based on GEANT2 topology. The constraint-based routing and wavelength assignment (CB-RWA) algorithm locates where cost-efficient upgrades should be implemented. Through numerical examples, we demonstrate that the network capacity improves by 25 per cent by overlaying fibre on 10 per cent of the links, and by 12 per cent by providing hop reduction links comprising 2 per cent of the links. For the upgraded network, we also show the impact of dynamic traffic allocation on the blocking probability. Copyright © 2010 John Wiley & Sons, Ltd.

光纤覆盖是一种经济有效的技术，通过增加波长路由光网络中某些链路的波长数来缓解波长阻塞。在这封信中，我们研究了基于GEANT2拓扑的全光网络(AON)中覆盖光纤的影响。基于约束的路由和波长分配(CB-RWA)算法定位于需要实现经济高效升级的地方。通过数值示例，我们证明通过在10%的链路上覆盖光纤，网络容量提高了25%，通过提供包含2%链路的跳数减少链路，网络容量提高了12%。对于升级后的网络，我们还展示了动态流量分配对阻塞概率的影响。版权所有©2010 John Wiley & Sons, Ltd

引用次数: 7

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

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.

﹀