Pub Date : 2010-05-23DOI: 10.1109/ICC.2010.5502033
Depeng Yang, Husheng Li, G. D. Peterson
A Space-Time Turbo Bayesian Compressed Sensing (STTBCS) algorithm is proposed for Ultra-Wideband (UWB) systems in this paper. Based on the sparsity of UWB signals, the STTBCS algorithm provides an efficient approach for integrating spatial and temporal redundancies. A space-time structure is also designed for exploiting and transferring the spatial and temporal emph{a priori} information for signal reconstructions in the framework of Bayesian Compressed Sensing (BCS). Simulation results using experimental UWB echo signals demonstrate that our STTBCS algorithm achieves good performance for UWB systems, compared with the traditional BCS and multitask BCS algorithms.
{"title":"Space-Time Turbo Bayesian Compressed Sensing for UWB Systems","authors":"Depeng Yang, Husheng Li, G. D. Peterson","doi":"10.1109/ICC.2010.5502033","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502033","url":null,"abstract":"A Space-Time Turbo Bayesian Compressed Sensing (STTBCS) algorithm is proposed for Ultra-Wideband (UWB) systems in this paper. Based on the sparsity of UWB signals, the STTBCS algorithm provides an efficient approach for integrating spatial and temporal redundancies. A space-time structure is also designed for exploiting and transferring the spatial and temporal emph{a priori} information for signal reconstructions in the framework of Bayesian Compressed Sensing (BCS). Simulation results using experimental UWB echo signals demonstrate that our STTBCS algorithm achieves good performance for UWB systems, compared with the traditional BCS and multitask BCS algorithms.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"39 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76944452","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 : 2010-05-23DOI: 10.1109/ICC.2010.5501757
Fengyuan Gong, Xinbing Wang, Qian Zhang
This paper studies the multicast capacity gain with network coding in static ad hoc wireless network. We consider $n$ nodes deployed in a square with $k$ nodes formulating multicast tree to employ network coding. In static unicast network, Liu et al. cite{Liujunning},cite{Liujunning2} have proved that the capacity gain with network coding is a constant without order change. In our work, we focus on the capacity gain with network coding in static multicast network, under the system model of Li cite{xiangyang}'s. Firstly, we modify the routing algorithm of multicast model and propose that the multicast capacity bound in cite{xiangyang} is just a theoretical result but not very tight in practical scenario. Then in static multicast transmission we calculate the probability of existing the butterfly model to employ network coding. Our result shows that there is no order change of the capacity. Finally, We prove that the bound of the capacity gain with network coding is $frac{tau}{sqrt{2}}$, where $tau=frac{sqrt{3}}{2}cdottau(2)$, and $tau(2)$ is a constant in dimension two, when network coding is applied to static multicast network.
{"title":"Multicast Capacity Gain and Routing Algorithm in Static Network with Network Coding","authors":"Fengyuan Gong, Xinbing Wang, Qian Zhang","doi":"10.1109/ICC.2010.5501757","DOIUrl":"https://doi.org/10.1109/ICC.2010.5501757","url":null,"abstract":"This paper studies the multicast capacity gain with network coding in static ad hoc wireless network. We consider $n$ nodes deployed in a square with $k$ nodes formulating multicast tree to employ network coding. In static unicast network, Liu et al. cite{Liujunning},cite{Liujunning2} have proved that the capacity gain with network coding is a constant without order change. In our work, we focus on the capacity gain with network coding in static multicast network, under the system model of Li cite{xiangyang}'s. Firstly, we modify the routing algorithm of multicast model and propose that the multicast capacity bound in cite{xiangyang} is just a theoretical result but not very tight in practical scenario. Then in static multicast transmission we calculate the probability of existing the butterfly model to employ network coding. Our result shows that there is no order change of the capacity. Finally, We prove that the bound of the capacity gain with network coding is $frac{tau}{sqrt{2}}$, where $tau=frac{sqrt{3}}{2}cdottau(2)$, and $tau(2)$ is a constant in dimension two, when network coding is applied to static multicast network.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"26 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78116315","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 : 2010-05-23DOI: 10.1109/ICC.2010.5502478
Wei Li, Q. Ni
This paper proposes to utilise Evolutionary Algorithm (EA) to jointly estimate the Time of Arrival, Direction of Arrival, and amplitude of impinging waves in a mobile radio environment. The problem is presented as the joint Maximum Likelihood (ML) estimation of the channel parameters where typically, the high dimensional non-linear cost function is deemed to be too computationally expensive to be solved directly. Simulation results show that the proposed method is extremely robust to initialisation errors and low SNR environments, while at the same time it is also computationally more efficient than popular iterative ML methods i.e. the Space-Alternating Generalised Expectation-maximisation (SAGE) algorithm.
{"title":"Joint Channel Parameter Estimation Using Evolutionary Algorithm","authors":"Wei Li, Q. Ni","doi":"10.1109/ICC.2010.5502478","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502478","url":null,"abstract":"This paper proposes to utilise Evolutionary Algorithm (EA) to jointly estimate the Time of Arrival, Direction of Arrival, and amplitude of impinging waves in a mobile radio environment. The problem is presented as the joint Maximum Likelihood (ML) estimation of the channel parameters where typically, the high dimensional non-linear cost function is deemed to be too computationally expensive to be solved directly. Simulation results show that the proposed method is extremely robust to initialisation errors and low SNR environments, while at the same time it is also computationally more efficient than popular iterative ML methods i.e. the Space-Alternating Generalised Expectation-maximisation (SAGE) algorithm.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"51 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78584912","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 : 2010-05-23DOI: 10.1109/ICC.2010.5502110
Chih-Yung Chang, Li-Ling Hung, Chih-Yu Lin, Ming-Hsien Li
Bounding-box mechanism is a well known low-cost localization approach for wireless sensor networks. However, the bounding-box location information can not distinguish the relative locations of neighboring sensors, hence leading to a poor performance for some applications such as location-aware routing. This paper proposes a Distinguishing Relative Locations (DRL) mechanism which uses a mobile anchor to broadcast tones and beacons aiming at distinguishing the relative locations of any two neighboring nodes. Experimental study reveals that the proposed DRL mechanism effectively distinguishes relative locations of any two neighboring nodes and hence significantly improves the performance of location-aware routing in wireless sensor networks (WSNs).
{"title":"On Distinguishing Relative Locations with Busy Tones for Wireless Sensor Networks","authors":"Chih-Yung Chang, Li-Ling Hung, Chih-Yu Lin, Ming-Hsien Li","doi":"10.1109/ICC.2010.5502110","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502110","url":null,"abstract":"Bounding-box mechanism is a well known low-cost localization approach for wireless sensor networks. However, the bounding-box location information can not distinguish the relative locations of neighboring sensors, hence leading to a poor performance for some applications such as location-aware routing. This paper proposes a Distinguishing Relative Locations (DRL) mechanism which uses a mobile anchor to broadcast tones and beacons aiming at distinguishing the relative locations of any two neighboring nodes. Experimental study reveals that the proposed DRL mechanism effectively distinguishes relative locations of any two neighboring nodes and hence significantly improves the performance of location-aware routing in wireless sensor networks (WSNs).","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75168993","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 : 2010-05-23DOI: 10.1109/ICC.2010.5502254
J. Prieto, S. Mazuelas, A. Bahillo, R. Lorenzo, P. Fernández, E. Abril
Several sources of error disturb the range estimates utilized to infer the position of a mobile user (MU). This paper presents a method which includes two stages of error reduction for a round-trip time (RTT)-based indoor location system. First, systematic error due to non-line of sight (NLOS) propagation is mitigated by adapting the prior-NLOS- measurements-correction (PNMC) technique to the input of a particle filter (PF). Thereupon, the latter is used to filter out the random error in the range estimates which is not assumed to be Gaussian distributed, on the contrary to what is commonly used in the literature. Both techniques are described and their performance is assessed in a real indoor environment achieving a reduction of more than 50% in the total error.
{"title":"NLOS Mitigation Prior to Range Estimation Smoothing for Wireless Location Systems","authors":"J. Prieto, S. Mazuelas, A. Bahillo, R. Lorenzo, P. Fernández, E. Abril","doi":"10.1109/ICC.2010.5502254","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502254","url":null,"abstract":"Several sources of error disturb the range estimates utilized to infer the position of a mobile user (MU). This paper presents a method which includes two stages of error reduction for a round-trip time (RTT)-based indoor location system. First, systematic error due to non-line of sight (NLOS) propagation is mitigated by adapting the prior-NLOS- measurements-correction (PNMC) technique to the input of a particle filter (PF). Thereupon, the latter is used to filter out the random error in the range estimates which is not assumed to be Gaussian distributed, on the contrary to what is commonly used in the literature. Both techniques are described and their performance is assessed in a real indoor environment achieving a reduction of more than 50% in the total error.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"17 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75484644","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 : 2010-05-23DOI: 10.1109/ICC.2010.5502213
Mayur M. Vegad, S. De, Brejesh Lall
Recent experimental results have shown that the minimum signal-to-interference ratio required at a receiver (CPth ) depends on the order of arrival of the overlapping frames. For a given sender-receiver distance, this differential capture capability of a receiver leads to two distinct interference ranges (ri ) around the receiver, and its value is much smaller when the sender's frame arrives earlier. This feature also suggests a possibility of increased spatial reuse by allowing the (secondary) nodes outside the primary receiver's ri to communicate concurrently once the primary receiver starts its DATA reception. In this paper, we propose a liberal carrier sensing (LCS) scheme wherein some already available information at an otherwise 'exposed' receiver are exploited to help decide when it is safe to respond to a secondary transmission request. The proposed modification in the carrier sensing approach results in a significantly improved spatial reuse, thereby increasing overall system throughput. Our simulation studies show that, compared to the conventional carrier sensing scheme with differential capture capable receivers, the end-to-end TCP throughput with LCS can be improved by more than 20% in regular topologies and up to about 9% in random topologies.
{"title":"A Liberal Carrier Sensing for Increased Spatial Reuse in Multi-Hop Wireless Ad Hoc Networks","authors":"Mayur M. Vegad, S. De, Brejesh Lall","doi":"10.1109/ICC.2010.5502213","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502213","url":null,"abstract":"Recent experimental results have shown that the minimum signal-to-interference ratio required at a receiver (CPth ) depends on the order of arrival of the overlapping frames. For a given sender-receiver distance, this differential capture capability of a receiver leads to two distinct interference ranges (ri ) around the receiver, and its value is much smaller when the sender's frame arrives earlier. This feature also suggests a possibility of increased spatial reuse by allowing the (secondary) nodes outside the primary receiver's ri to communicate concurrently once the primary receiver starts its DATA reception. In this paper, we propose a liberal carrier sensing (LCS) scheme wherein some already available information at an otherwise 'exposed' receiver are exploited to help decide when it is safe to respond to a secondary transmission request. The proposed modification in the carrier sensing approach results in a significantly improved spatial reuse, thereby increasing overall system throughput. Our simulation studies show that, compared to the conventional carrier sensing scheme with differential capture capable receivers, the end-to-end TCP throughput with LCS can be improved by more than 20% in regular topologies and up to about 9% in random topologies.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"144 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77985790","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 : 2010-05-23DOI: 10.1109/ICC.2010.5502137
Dian Zhang, Yanyan Yang, Dachao Cheng, Siyuan Liu, L. Ni
Traditional RF-based indoor positioning approaches use only Radio Signal Strength Indicator (RSSI) to locate the target object. But RSSI suffers significantly from the multi-path phenomenon and other environmental factors. Hence, the localization accuracy drops dramatically in a large tracking field. To solve this problem, this paper introduces one more resource, the dynamic of RSSI, which is the variance of signal strength caused by the target object and is more robust to environment changes. By combining these two resources, we are able to greatly improve the accuracy and scalability of current RF-based approaches. We call such hybrid approach COCKTAIL. It employs both the technologies of active RFID and Wireless Sensor Networks (WSNs). Sensors use the dynamic of RSSI to figure out a cluster of reference tags as candidates. The final target location is estimated by using the RSSI relationships between the target tag and candidate reference tags. Experiments show that COCKTAIL can reach a remarkable high degree of localization accuracy to 0:45m, which outperforms significantly to most of the pure RF-based localization approaches.
{"title":"COCKTAIL: An RF-Based Hybrid Approach for Indoor Localization","authors":"Dian Zhang, Yanyan Yang, Dachao Cheng, Siyuan Liu, L. Ni","doi":"10.1109/ICC.2010.5502137","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502137","url":null,"abstract":"Traditional RF-based indoor positioning approaches use only Radio Signal Strength Indicator (RSSI) to locate the target object. But RSSI suffers significantly from the multi-path phenomenon and other environmental factors. Hence, the localization accuracy drops dramatically in a large tracking field. To solve this problem, this paper introduces one more resource, the dynamic of RSSI, which is the variance of signal strength caused by the target object and is more robust to environment changes. By combining these two resources, we are able to greatly improve the accuracy and scalability of current RF-based approaches. We call such hybrid approach COCKTAIL. It employs both the technologies of active RFID and Wireless Sensor Networks (WSNs). Sensors use the dynamic of RSSI to figure out a cluster of reference tags as candidates. The final target location is estimated by using the RSSI relationships between the target tag and candidate reference tags. Experiments show that COCKTAIL can reach a remarkable high degree of localization accuracy to 0:45m, which outperforms significantly to most of the pure RF-based localization approaches.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"22 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78140287","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 : 2010-05-23DOI: 10.1109/ICC.2010.5502243
Jingjing Zhang, N. Ansari
Driven by emerging bandwidth-hungry applications, next generation passive optical networks (NG-PONs) provide higher bandwidth to users by using more wavelengths and increasing data rates of optical network units (ONUs). On the other hand, for smooth upgrading, NG-PON is desired to be backward compatible with the current TDM PONs where data rates of ONUs remain unchanged. Thus, both high-rate ONUs and low-rate ONUs may coexist in NG-PON. The key parameters of bandwidth allocation in this multi-rate multi-wavelength network include achieving fairness among all ONUs, encouraging low-rate ONUs to increase their data rates, and utilizing wavelength resources efficiently. This paper illustrates contributions in three main aspects. First, we define rate-dependent utilities for ONUs, which serve as the basis for bandwidth arbitration among low-rate and high-rate ONUs. Second, to achieve fairness among ONUs, we employ water-filling idea and formulate a utility max-min fair bandwidth allocation scheme. Third, to efficiently utilize the wavelengths, we map the resource allocation problem in multi-wavelength PON into a multi-processor scheduling problem and employ a heuristic algorithm to address the NP-hard wavelength assignment problem.
{"title":"Dynamic Time Allocation and Wavelength Assignment in Next Generation Multi-Rate Multi-Wavelength Passive Optical Networks","authors":"Jingjing Zhang, N. Ansari","doi":"10.1109/ICC.2010.5502243","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502243","url":null,"abstract":"Driven by emerging bandwidth-hungry applications, next generation passive optical networks (NG-PONs) provide higher bandwidth to users by using more wavelengths and increasing data rates of optical network units (ONUs). On the other hand, for smooth upgrading, NG-PON is desired to be backward compatible with the current TDM PONs where data rates of ONUs remain unchanged. Thus, both high-rate ONUs and low-rate ONUs may coexist in NG-PON. The key parameters of bandwidth allocation in this multi-rate multi-wavelength network include achieving fairness among all ONUs, encouraging low-rate ONUs to increase their data rates, and utilizing wavelength resources efficiently. This paper illustrates contributions in three main aspects. First, we define rate-dependent utilities for ONUs, which serve as the basis for bandwidth arbitration among low-rate and high-rate ONUs. Second, to achieve fairness among ONUs, we employ water-filling idea and formulate a utility max-min fair bandwidth allocation scheme. Third, to efficiently utilize the wavelengths, we map the resource allocation problem in multi-wavelength PON into a multi-processor scheduling problem and employ a heuristic algorithm to address the NP-hard wavelength assignment problem.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"57 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75960593","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 : 2010-05-23DOI: 10.1109/ICC.2010.5501889
J. S. Harsini, F. Lahouti, M. Levorato, M. Zorzi
This paper presents performance analysis and cross-layer design approaches for hybrid ARQ (HARQ) protocol in wireless networks which employ adaptive modulation and coding (AMC) at the physical layer and are subject to time-correlated fading channels. Utilizing a Markov channel model which accounts for the temporal correlation in successive parity transmissions by the adaptive rate HARQ protocol, we derive the system throughput and the packet loss probability based on a rate compatible punctured convolutional (RCPC) code family. As an application, we then present a cross-layer AMC design which takes into account the performance gain of the HARQ protocol at the link layer. The results illustrate that including AMC in the HARQ protocol leads to a substantial throughput gain, but the channel correlation strongly diminishes the performance of the HARQ protocol in terms of throughput and packet loss rate.
{"title":"A Type II Hybrid ARQ Protocol with Adaptive Modulation and Coding for Time-Correlated Fading Channels: Analysis and Design","authors":"J. S. Harsini, F. Lahouti, M. Levorato, M. Zorzi","doi":"10.1109/ICC.2010.5501889","DOIUrl":"https://doi.org/10.1109/ICC.2010.5501889","url":null,"abstract":"This paper presents performance analysis and cross-layer design approaches for hybrid ARQ (HARQ) protocol in wireless networks which employ adaptive modulation and coding (AMC) at the physical layer and are subject to time-correlated fading channels. Utilizing a Markov channel model which accounts for the temporal correlation in successive parity transmissions by the adaptive rate HARQ protocol, we derive the system throughput and the packet loss probability based on a rate compatible punctured convolutional (RCPC) code family. As an application, we then present a cross-layer AMC design which takes into account the performance gain of the HARQ protocol at the link layer. The results illustrate that including AMC in the HARQ protocol leads to a substantial throughput gain, but the channel correlation strongly diminishes the performance of the HARQ protocol in terms of throughput and packet loss rate.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"14 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72874086","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 : 2010-05-23DOI: 10.1109/ICC.2010.5501805
M. Chamania, M. Caria, A. Jukan
The Internet is susceptible to congestion due to progressively increasing traffic as well as short-lived traffic surges. Traditional mechanisms to counter these effects over-provision the IP network to a significant degree. At the same time, the advent of dynamic circuits in L2/L1 networks has fueled the research in the area of network engineering which deals with the ability to add capacity in the higher layer (IP) by establishing dynamic circuits in the lower layers. However, effective usage of dynamic circuits is a challenge, as they can lead to IP routing instabilities. We present an approach wherein IP bypass links are established using dynamic circuits to alleviate congestion while keeping the routing stable in the IP layer. Proposed is an ILP based approach which computes the optimal set of circuits with and without the knowledge of the traffic matrix in the IP layer. The results show that even without the knowledge of the traffic matrix, the proposed method computes only a marginally higher number of bypasses, albeit at a higher capacity.
{"title":"Effective Usage of Dynamic Circuits for IP Routing","authors":"M. Chamania, M. Caria, A. Jukan","doi":"10.1109/ICC.2010.5501805","DOIUrl":"https://doi.org/10.1109/ICC.2010.5501805","url":null,"abstract":"The Internet is susceptible to congestion due to progressively increasing traffic as well as short-lived traffic surges. Traditional mechanisms to counter these effects over-provision the IP network to a significant degree. At the same time, the advent of dynamic circuits in L2/L1 networks has fueled the research in the area of network engineering which deals with the ability to add capacity in the higher layer (IP) by establishing dynamic circuits in the lower layers. However, effective usage of dynamic circuits is a challenge, as they can lead to IP routing instabilities. We present an approach wherein IP bypass links are established using dynamic circuits to alleviate congestion while keeping the routing stable in the IP layer. Proposed is an ILP based approach which computes the optimal set of circuits with and without the knowledge of the traffic matrix in the IP layer. The results show that even without the knowledge of the traffic matrix, the proposed method computes only a marginally higher number of bypasses, albeit at a higher capacity.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"244 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74531034","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
扫码关注我们
求助内容：
应助结果提醒方式：