Pub Date : 2022-02-18DOI: 10.1109/GLOCOM.2005.1578257
E. Perevalov, Rick S. Blum, A. Nigara, Xun Chen
Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network n. However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity dramatically
{"title":"Route discovery and capacity of ad hoc networks","authors":"E. Perevalov, Rick S. Blum, A. Nigara, Xun Chen","doi":"10.1109/GLOCOM.2005.1578257","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578257","url":null,"abstract":"Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network n. However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity dramatically","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127823352","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}
Pub Date : 2007-12-01DOI: 10.1049/iet-com:20060570
W. Chin, D. Ward, A. Constantinides
This paper is concerned with the problem of channel estimation and symbol detection in fast fading channels, which is one of the challenges faced by extending spatial multiplexing to mobile terminals. A method of resolving this problem is the use of pilot aided channel interpolation techniques which are common in single channel systems. We propose an iterative algorithm that substantially improves the performance of pilot aided MIMO channel interpolation systems by exploiting the time selectivity of the channel.
{"title":"An algorithm for exploiting channel time selectivity in pilot-aided MIMO systems","authors":"W. Chin, D. Ward, A. Constantinides","doi":"10.1049/iet-com:20060570","DOIUrl":"https://doi.org/10.1049/iet-com:20060570","url":null,"abstract":"This paper is concerned with the problem of channel estimation and symbol detection in fast fading channels, which is one of the challenges faced by extending spatial multiplexing to mobile terminals. A method of resolving this problem is the use of pilot aided channel interpolation techniques which are common in single channel systems. We propose an iterative algorithm that substantially improves the performance of pilot aided MIMO channel interpolation systems by exploiting the time selectivity of the channel.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132508000","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}
Pub Date : 2007-06-01DOI: 10.1109/GLOCOM.2005.1577669
Jianbin Wei, Chengzhong Xu
Proportional delay differentiation (PDD) aims to maintain pre-specified packet queueing-delay ratios between different classes of traffic at each hop. Existing bandwidth-allocation approaches for PDD services rely on the assumption that average queueing delay of a class is inversely proportional to its allocated bandwidth, which is valid only in a heavy-utilized link. Consequently, in a non-heavy utilized link, they are unable to provide consistent PDD services effectively. As a remedy, in this paper, we propose a novel bandwidth-allocation approach that applies fuzzy control theory to reflect the nonlinearity between the queueing delay and the allocated bandwidth. In the approach, the bandwidth of a class is adjusted according to a set of fuzzy control rules defined over its error, the change of error, and the change of bandwidth allocation. Simulation results demonstrate that, in comparison with other bandwidth-allocation approaches, the fuzzy control approach is able to provide consistent PDD services under light, moderate, and heavy utilization conditions. They also show its robustness under various operation environments.
{"title":"Consistent proportional delay differentiation: a fuzzy control approach","authors":"Jianbin Wei, Chengzhong Xu","doi":"10.1109/GLOCOM.2005.1577669","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577669","url":null,"abstract":"Proportional delay differentiation (PDD) aims to maintain pre-specified packet queueing-delay ratios between different classes of traffic at each hop. Existing bandwidth-allocation approaches for PDD services rely on the assumption that average queueing delay of a class is inversely proportional to its allocated bandwidth, which is valid only in a heavy-utilized link. Consequently, in a non-heavy utilized link, they are unable to provide consistent PDD services effectively. As a remedy, in this paper, we propose a novel bandwidth-allocation approach that applies fuzzy control theory to reflect the nonlinearity between the queueing delay and the allocated bandwidth. In the approach, the bandwidth of a class is adjusted according to a set of fuzzy control rules defined over its error, the change of error, and the change of bandwidth allocation. Simulation results demonstrate that, in comparison with other bandwidth-allocation approaches, the fuzzy control approach is able to provide consistent PDD services under light, moderate, and heavy utilization conditions. They also show its robustness under various operation environments.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"281 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121822903","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}
Pub Date : 2007-05-15DOI: 10.1109/GLOCOM.2005.1577892
Wei Dai, Y. Liu, B. Rider
This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volume of a metric ball in the Grassmann manifold when the radius is sufficiently small. This volume formula holds for Grassmann manifolds with arbitrary dimension n and p, while previous results are only valid for either p = 1 or a fixed p with asymptotically large n. Based on the volume formula, the Gilbert-Varshamov and Hamming bounds for sphere packings are obtained. Assuming a uniformly distributed source and a distortion metric based on the squared chordal distance, tight lower and upper bounds are established for the distortion rate tradeoff. Simulation results match the derived results. As an application of the derived quantization bounds, the information rate of a multiple-input multiple-output (MIMO) system with finite-rate channel-state feedback is accurately quantified for arbitrary finite number of antennas, while previous results are only valid for either multiple-input single-output (MISO) systems or those with asymptotically large number of transmit antennas but fixed number of receive antennas.
{"title":"Quantization bounds on Grassmann manifolds of arbitrary dimensions and MIMO communications with feedback","authors":"Wei Dai, Y. Liu, B. Rider","doi":"10.1109/GLOCOM.2005.1577892","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577892","url":null,"abstract":"This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volume of a metric ball in the Grassmann manifold when the radius is sufficiently small. This volume formula holds for Grassmann manifolds with arbitrary dimension n and p, while previous results are only valid for either p = 1 or a fixed p with asymptotically large n. Based on the volume formula, the Gilbert-Varshamov and Hamming bounds for sphere packings are obtained. Assuming a uniformly distributed source and a distortion metric based on the squared chordal distance, tight lower and upper bounds are established for the distortion rate tradeoff. Simulation results match the derived results. As an application of the derived quantization bounds, the information rate of a multiple-input multiple-output (MIMO) system with finite-rate channel-state feedback is accurately quantified for arbitrary finite number of antennas, while previous results are only valid for either multiple-input single-output (MISO) systems or those with asymptotically large number of transmit antennas but fixed number of receive antennas.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125347739","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}
Pub Date : 2007-03-01DOI: 10.1504/IJSN.2007.012824
Ozgün Erdogan, P. Cao
Fast virus scanning is becoming increasingly important in today's Internet. While Moore's law continues to double CPU cycle speed, virus scanning applications fail to ride on the performance wave due to their frequent random memory accesses. This paper proposes Hash-AV, a virus scanning "booster" technique that aims to take advantage of improvements in CPU performance. Using a set of hash functions and a bloom filter array that fits in CPU second-level (L2) caches, Hash-AV determines the majority of "no-match" cases without accesses to main memory. Experiments show that Hash-AV improves the performance of the open-source virus scanner Clam-AV by a factor of 2.5 to 10. The key to Hash-AV's success lies in a set of "bad but cheap" hash functions that are used as initial hashes. The speed of Hash-AV makes it well suited for "on-access" virus scanning, providing greater protections to the user. Through intercepting system calls and wrapping glibc libraries, we have implemented an "on-access" version for Hash-AV+Clam-AV. The on-access scanner can examine input data at a throughput of over 200 Mb/s, making it suitable for network-based virus scanning.
{"title":"Hash-AV: fast virus signature scanning by cache-resident filters","authors":"Ozgün Erdogan, P. Cao","doi":"10.1504/IJSN.2007.012824","DOIUrl":"https://doi.org/10.1504/IJSN.2007.012824","url":null,"abstract":"Fast virus scanning is becoming increasingly important in today's Internet. While Moore's law continues to double CPU cycle speed, virus scanning applications fail to ride on the performance wave due to their frequent random memory accesses. This paper proposes Hash-AV, a virus scanning \"booster\" technique that aims to take advantage of improvements in CPU performance. Using a set of hash functions and a bloom filter array that fits in CPU second-level (L2) caches, Hash-AV determines the majority of \"no-match\" cases without accesses to main memory. Experiments show that Hash-AV improves the performance of the open-source virus scanner Clam-AV by a factor of 2.5 to 10. The key to Hash-AV's success lies in a set of \"bad but cheap\" hash functions that are used as initial hashes. The speed of Hash-AV makes it well suited for \"on-access\" virus scanning, providing greater protections to the user. Through intercepting system calls and wrapping glibc libraries, we have implemented an \"on-access\" version for Hash-AV+Clam-AV. The on-access scanner can examine input data at a throughput of over 200 Mb/s, making it suitable for network-based virus scanning.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"474 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127555181","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}
Pub Date : 2006-07-17DOI: 10.1109/GLOCOM.2005.1578299
Y. Gan, W. Mow
Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood receiver yet with complexity similar to linear receiver. However, these lattice-reduction-aided detectors are based on the traditional LLL reduction algorithm that was originally introduced for reducing real lattice basis, even though the channel matrices are inherently complex-valued. In this paper, we introduce the complex LLL algorithm for direct application to the channel matrix which naturally defines the basis of a complex lattice. Simulation results reveal that the new complex LLL algorithm can achieve a saving in complexity of nearly 50% over the traditional LLL algorithm, when applied to MIMO detection. We also show that the algorithm can further be accelerated by pre-ordering the basis vectors prior to the lattice reduction. It is noteworthy that the complex LLL algorithms aforementioned incur negligible bit-error-rate performance loss relative to the traditional LLL algorithm
{"title":"Complex lattice reduction algorithms for low-complexity MIMO detection","authors":"Y. Gan, W. Mow","doi":"10.1109/GLOCOM.2005.1578299","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578299","url":null,"abstract":"Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood receiver yet with complexity similar to linear receiver. However, these lattice-reduction-aided detectors are based on the traditional LLL reduction algorithm that was originally introduced for reducing real lattice basis, even though the channel matrices are inherently complex-valued. In this paper, we introduce the complex LLL algorithm for direct application to the channel matrix which naturally defines the basis of a complex lattice. Simulation results reveal that the new complex LLL algorithm can achieve a saving in complexity of nearly 50% over the traditional LLL algorithm, when applied to MIMO detection. We also show that the algorithm can further be accelerated by pre-ordering the basis vectors prior to the lattice reduction. It is noteworthy that the complex LLL algorithms aforementioned incur negligible bit-error-rate performance loss relative to the traditional LLL algorithm","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133944777","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}
Pub Date : 2006-02-01DOI: 10.1093/ietcom/e89-b.2.621
Yaya Wei, Chuang Lin, Xin Jin, R. Raad, Fengyuan Ren
The guard channel scheme in wireless mobile networks has attracted and is still drawing research interest owing to easy implementation and flexible control. However guard channel schemes can not adapt to changing traffic loads because of static reserved guard channels. Therefore dynamic guard channel schemes have been proposed in the literature to adapt to varying traffic load. This paper presents a novel control-theoretic approach to dynamically reserve guard channels called PI-guard channel (PI-GC) controller. Experiments show that our proposed scheme can maintain the handoff blocking probability (HBP) to a predefined value while it still improves the channel resource utilization
{"title":"Dynamic channel allocation for mobile cellular systems using a control theoretical approach","authors":"Yaya Wei, Chuang Lin, Xin Jin, R. Raad, Fengyuan Ren","doi":"10.1093/ietcom/e89-b.2.621","DOIUrl":"https://doi.org/10.1093/ietcom/e89-b.2.621","url":null,"abstract":"The guard channel scheme in wireless mobile networks has attracted and is still drawing research interest owing to easy implementation and flexible control. However guard channel schemes can not adapt to changing traffic loads because of static reserved guard channels. Therefore dynamic guard channel schemes have been proposed in the literature to adapt to varying traffic load. This paper presents a novel control-theoretic approach to dynamically reserve guard channels called PI-guard channel (PI-GC) controller. Experiments show that our proposed scheme can maintain the handoff blocking probability (HBP) to a predefined value while it still improves the channel resource utilization","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114138787","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}
Pub Date : 2005-12-02DOI: 10.1109/GLOCOM.2005.1578253
Hannan Xiao, K. Chua, J. Malcolm, Ying Zhang
Researchers have used extensive simulation and experimental studies to understand TCP performance in adhoc wireless networks. In contrast, the objective of this paper is to theoretically analyze TCP performance in this environment. By examining the case of running one TCP session over a string topology, a system model for analyzing TCP performance in adhoc wireless networks is proposed, which considers packet buffering, nodes' contention for access to the wireless channel, and spatial reuse of the wireless channel. Markov chain modelling is applied to analyze this system model. Analytical results show that when the number of hops that the TCP session crosses is fixed, the TCP throughput is independent of the TCP congestion window size. When the number of hops increases from one, the TCP throughput decreases first, and then stabilizes when the number of hops becomes large. The analysis is validated by comparing the numerical and simulation results
{"title":"Theoretical analysis of TCP throughput in adhoc wireless networks","authors":"Hannan Xiao, K. Chua, J. Malcolm, Ying Zhang","doi":"10.1109/GLOCOM.2005.1578253","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578253","url":null,"abstract":"Researchers have used extensive simulation and experimental studies to understand TCP performance in adhoc wireless networks. In contrast, the objective of this paper is to theoretically analyze TCP performance in this environment. By examining the case of running one TCP session over a string topology, a system model for analyzing TCP performance in adhoc wireless networks is proposed, which considers packet buffering, nodes' contention for access to the wireless channel, and spatial reuse of the wireless channel. Markov chain modelling is applied to analyze this system model. Analytical results show that when the number of hops that the TCP session crosses is fixed, the TCP throughput is independent of the TCP congestion window size. When the number of hops increases from one, the TCP throughput decreases first, and then stabilizes when the number of hops becomes large. The analysis is validated by comparing the numerical and simulation results","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125935421","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}
Pub Date : 2005-12-01DOI: 10.1109/GLOCOM.2005.1578436
Jyh-cheng Chen, J. Yeh, Yi-Wen Lan, Li-Wei Lin, Fu-Cheng Chen, S. Hung
There are many incompatible wireless systems. How to integrate them has become an important issue. The integration should be done in both radio access networks (RANs) and core networks. The current trend is to integrate various RANs with an IP-based core network so users with a multi-mode handset or reconfigurable radio, such as software defined radio (SDR), could seamlessly roam among different RANs. With this all-IP paradigm, there should be one common core network, or various core networks should be compatible. Unfortunately, although both 3GPP and 3GPP2 have adopted IP in their packet-switched core networks, the architectures and protocols are not necessary compatible. In addition, they are also different from today's Internet. A user with reconfigurable radio still could not roam seamlessly among 3GPP, 3GPP2, and other IP core networks. As that in RANs, in this paper we propose a reconfigurable architecture in which users could use different protocols in core networks dynamically. There are many potential research topics for the reconfigurable core network. This paper focuses on reconfigurable mobility management. An architecture called reconfigurable architecture and mobility platform (RAMP) is proposed. Both analytical model and simulation are developed to analyze the architecture. In addition, a testbed is constructed. Empirical experiments are conducted to demonstrate the feasibility of the proposed idea
{"title":"RAMP: reconfigurable architecture and mobility platform","authors":"Jyh-cheng Chen, J. Yeh, Yi-Wen Lan, Li-Wei Lin, Fu-Cheng Chen, S. Hung","doi":"10.1109/GLOCOM.2005.1578436","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578436","url":null,"abstract":"There are many incompatible wireless systems. How to integrate them has become an important issue. The integration should be done in both radio access networks (RANs) and core networks. The current trend is to integrate various RANs with an IP-based core network so users with a multi-mode handset or reconfigurable radio, such as software defined radio (SDR), could seamlessly roam among different RANs. With this all-IP paradigm, there should be one common core network, or various core networks should be compatible. Unfortunately, although both 3GPP and 3GPP2 have adopted IP in their packet-switched core networks, the architectures and protocols are not necessary compatible. In addition, they are also different from today's Internet. A user with reconfigurable radio still could not roam seamlessly among 3GPP, 3GPP2, and other IP core networks. As that in RANs, in this paper we propose a reconfigurable architecture in which users could use different protocols in core networks dynamically. There are many potential research topics for the reconfigurable core network. This paper focuses on reconfigurable mobility management. An architecture called reconfigurable architecture and mobility platform (RAMP) is proposed. Both analytical model and simulation are developed to analyze the architecture. In addition, a testbed is constructed. Empirical experiments are conducted to demonstrate the feasibility of the proposed idea","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124843158","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}
Pub Date : 2005-12-01DOI: 10.1109/GLOCOM.2005.1577752
A. Elwalid, D. Mitra, Qiong Wang
The Internet transport infrastructure is moving towards a model of high-speed router networks that are directly interconnected by re-configurable optical core networks. This IP over optical (IPO) architecture, when coupled with the emerging IP-based generalized multi-protocol label switching (GMPLS) control plane, offers network operators opportunities for dynamic, multi-layer optimization of traffic engineering. We present a novel approach for joint optical network provisioning and IP traffic engineering, in which the IP and optical network domains collaboratively achieve the objective of maximizing the benefit of carrying end-to-end IP traffic at the minimum lightpath design cost. Our approach is developed under the overlay inter-networking model with each network having a limited view of the other. The cooperation is achieved through minimal information exchange. Our solution is based on a novel application of generalized bender's decomposition to implement distributed, multi-layer optimization. The process converges to the optimal value of the objective function. A case study is presented to illustrate the proposed method.
互联网传输基础设施正在向高速路由器网络模式发展，这种网络通过可重新配置的光核心网络直接互联。这种IP over optical (IPO)架构与新兴的基于IP的通用多协议标签交换(GMPLS)控制平面相结合，为网络运营商提供了动态、多层优化流量工程的机会。我们提出了一种用于联合光网络配置和IP流量工程的新方法，其中IP和光网络域协同实现以最小光路设计成本最大化承载端到端IP流量的目标。我们的方法是在覆盖的内部网络模型下开发的，每个网络对另一个网络具有有限的视图。合作是通过最小的信息交换来实现的。我们的解决方案是基于广义bender分解的一种新应用，以实现分布式的多层优化。该过程收敛到目标函数的最优值。最后给出了一个实例来说明所提出的方法。
{"title":"Distributed optimization of converged IP-optical networks","authors":"A. Elwalid, D. Mitra, Qiong Wang","doi":"10.1109/GLOCOM.2005.1577752","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577752","url":null,"abstract":"The Internet transport infrastructure is moving towards a model of high-speed router networks that are directly interconnected by re-configurable optical core networks. This IP over optical (IPO) architecture, when coupled with the emerging IP-based generalized multi-protocol label switching (GMPLS) control plane, offers network operators opportunities for dynamic, multi-layer optimization of traffic engineering. We present a novel approach for joint optical network provisioning and IP traffic engineering, in which the IP and optical network domains collaboratively achieve the objective of maximizing the benefit of carrying end-to-end IP traffic at the minimum lightpath design cost. Our approach is developed under the overlay inter-networking model with each network having a limited view of the other. The cooperation is achieved through minimal information exchange. Our solution is based on a novel application of generalized bender's decomposition to implement distributed, multi-layer optimization. The process converges to the optimal value of the objective function. A case study is presented to illustrate the proposed method.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125160973","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：