Pub Date : 2009-11-01DOI: 10.1109/COMNET.2009.5373552
Naoufel Debbabi, S. Chtourou, I. Kammoun, M. Siala
In radio mobile cellular networks, the users located at the cell border suffer from a bad quality of service (QoS). Cooperative communication is a promising technique that can overcome this weakness by allowing these users to profit from powerful benefits of spatial diversity. Nevertheless, abstraction is usually made on the impact of the additional multiple access interference inherent to relaying. In a previous work, we have optimized amplify-and-forward (AF) relaying scheme subject to a constant multiple access interference cost for CDMA (Code Division Multiple Access) uplink communications. Here, we extend this work by dealing with performance optimization for decode-and-forward (DF) relaying subject to the same cost constraint for the same framework. We compare the performance of both optimized AF and DF schemes for different scenarii. A variety of simulation results reveals that DF relaying provides cellular performance enhancement in terms of BER (Bit Error Rate) over both direct transmission and AF relaying schemes.
{"title":"Comparison of AF and DF relaying for uplink CDMA communications subject to constant multiple access interference cost","authors":"Naoufel Debbabi, S. Chtourou, I. Kammoun, M. Siala","doi":"10.1109/COMNET.2009.5373552","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373552","url":null,"abstract":"In radio mobile cellular networks, the users located at the cell border suffer from a bad quality of service (QoS). Cooperative communication is a promising technique that can overcome this weakness by allowing these users to profit from powerful benefits of spatial diversity. Nevertheless, abstraction is usually made on the impact of the additional multiple access interference inherent to relaying. In a previous work, we have optimized amplify-and-forward (AF) relaying scheme subject to a constant multiple access interference cost for CDMA (Code Division Multiple Access) uplink communications. Here, we extend this work by dealing with performance optimization for decode-and-forward (DF) relaying subject to the same cost constraint for the same framework. We compare the performance of both optimized AF and DF schemes for different scenarii. A variety of simulation results reveals that DF relaying provides cellular performance enhancement in terms of BER (Bit Error Rate) over both direct transmission and AF relaying schemes.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115466459","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 : 2009-11-01DOI: 10.1109/COMNET.2009.5373567
Jihane Ben Abderrazak, Y. Nishida, H. Nishikawa
Power consumption will be one of the most crucial issues to realize future communication environments. Mobile ad hoc networks have been the subject of active research for a number of years. They need no infrastructure and are low power consumption network alternative to existing infrastructure. On the other hand, unlike conventional processor platform, a data-driven multi-processor platform based on self-timed elastic pipeline is lower power architecture that establish parallel processing scheme without any runtime overhead. Thus, the power consumption of a data-driven processor is proportional to the throughput. This feature will be effective to predict and minimize power consumption by adjusting it to the demanded performance needed for a mobile ad hoc node. The research proposed in this paper is a first attempt to realize a system that consumes only substantially needed power by estimating the demanded performance and controlling the supplied power. This paper first proposes a method for estimating the demanded performance of a mobile ad hoc node. Then we try to estimate the suitable voltage and we present the data-driven power controlling scheme. We show that the performance estimation method combined with the power minimizing scheme can achieve minimum essential power consumption, 1/10 to 1/100 of the present.
{"title":"Performance estimation and power minimizing scheme for a mobile ad hoc networking node","authors":"Jihane Ben Abderrazak, Y. Nishida, H. Nishikawa","doi":"10.1109/COMNET.2009.5373567","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373567","url":null,"abstract":"Power consumption will be one of the most crucial issues to realize future communication environments. Mobile ad hoc networks have been the subject of active research for a number of years. They need no infrastructure and are low power consumption network alternative to existing infrastructure. On the other hand, unlike conventional processor platform, a data-driven multi-processor platform based on self-timed elastic pipeline is lower power architecture that establish parallel processing scheme without any runtime overhead. Thus, the power consumption of a data-driven processor is proportional to the throughput. This feature will be effective to predict and minimize power consumption by adjusting it to the demanded performance needed for a mobile ad hoc node. The research proposed in this paper is a first attempt to realize a system that consumes only substantially needed power by estimating the demanded performance and controlling the supplied power. This paper first proposes a method for estimating the demanded performance of a mobile ad hoc node. Then we try to estimate the suitable voltage and we present the data-driven power controlling scheme. We show that the performance estimation method combined with the power minimizing scheme can achieve minimum essential power consumption, 1/10 to 1/100 of the present.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129274190","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 : 2009-11-01DOI: 10.1109/COMNET.2009.5373560
Sinda Boussen, N. Tabbane, S. Tabbane
The Internet Protocol Stack provides a set of transport layer protocols. There are two dominant types of transport layer protocol used in the Internet: UDP (User Datagram Protocol) and TCP (Transmission Control Protocol). The transport layer provides end-to-end information transfer across a network with the quality of service needed by the application. In this paper, we provide a performance comparison of SCTP, TCP and UDP protocols in WLAN environments for different traffic flow: VoIP, video streaming and data traffic. The performance metrics used for this evaluation include throughput, end to end delay and packet loss rate. The comparison of performance of SCTP, UDP and TCP are done using the Network simulator NS-2.
{"title":"Performance analysis of SCTP protocol in WiFi network","authors":"Sinda Boussen, N. Tabbane, S. Tabbane","doi":"10.1109/COMNET.2009.5373560","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373560","url":null,"abstract":"The Internet Protocol Stack provides a set of transport layer protocols. There are two dominant types of transport layer protocol used in the Internet: UDP (User Datagram Protocol) and TCP (Transmission Control Protocol). The transport layer provides end-to-end information transfer across a network with the quality of service needed by the application. In this paper, we provide a performance comparison of SCTP, TCP and UDP protocols in WLAN environments for different traffic flow: VoIP, video streaming and data traffic. The performance metrics used for this evaluation include throughput, end to end delay and packet loss rate. The comparison of performance of SCTP, UDP and TCP are done using the Network simulator NS-2.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116221255","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 : 2009-11-01DOI: 10.1109/COMNET.2009.5373559
Ryma Abbassi, S. G. El Fatmi
Delegation is the process whereby a user can assign his authorizations to another user. This feature is necessary in today's communication networks principally because it allows the interaction between the entities composing such networks. This paper aims to give a first step toward a framework allowing to, formally, model delegation. Hence, we propose an extension of a previously proposed model by adding delegation and specially handling most of the delegation properties which we find in the literature. For this purpose, we model a delegation request based on two types: the grant and the transfer. We also propose an adapted verification process completing the delegation process. Finally, we discuss the revocation of delegations according to three schemes.
{"title":"A generic model for delegation in security policies","authors":"Ryma Abbassi, S. G. El Fatmi","doi":"10.1109/COMNET.2009.5373559","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373559","url":null,"abstract":"Delegation is the process whereby a user can assign his authorizations to another user. This feature is necessary in today's communication networks principally because it allows the interaction between the entities composing such networks. This paper aims to give a first step toward a framework allowing to, formally, model delegation. Hence, we propose an extension of a previously proposed model by adding delegation and specially handling most of the delegation properties which we find in the literature. For this purpose, we model a delegation request based on two types: the grant and the transfer. We also propose an adapted verification process completing the delegation process. Finally, we discuss the revocation of delegations according to three schemes.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126533308","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 : 2009-11-01DOI: 10.1109/COMNET.2009.5373557
Dhouha Kbaier, C. Douillard, S. Kerouédan
This paper deals with the performance improvement of a 3-dimensional turbo code based on the partial concatenation of the 3GPP2 code with a rate-1 post-encoder. First, we optimize the distance spectrum of the 3-dimensional 3GPP2 turbo code by means of the adoption of a non regular post-encoding pattern. This allows us to increase the minimum Hamming distance and thereby to improve the performance at very low error rates. Then, we propose a time varying construction of the post-encoded parity in order to reduce the observable loss of convergence at high error rates. The different improvement stages are illustrated with simulation results, asymptotical bounds and EXIT charts.
{"title":"Improving 3-dimensional turbo codes using 3GPP2 interleavers","authors":"Dhouha Kbaier, C. Douillard, S. Kerouédan","doi":"10.1109/COMNET.2009.5373557","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373557","url":null,"abstract":"This paper deals with the performance improvement of a 3-dimensional turbo code based on the partial concatenation of the 3GPP2 code with a rate-1 post-encoder. First, we optimize the distance spectrum of the 3-dimensional 3GPP2 turbo code by means of the adoption of a non regular post-encoding pattern. This allows us to increase the minimum Hamming distance and thereby to improve the performance at very low error rates. Then, we propose a time varying construction of the post-encoded parity in order to reduce the observable loss of convergence at high error rates. The different improvement stages are illustrated with simulation results, asymptotical bounds and EXIT charts.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115944877","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 : 2009-11-01DOI: 10.1109/COMNET.2009.5373569
Jamila Ben Slimane, Ye-Qiong Songi, A. Koubâa
This paper addresses a new prioritized multichannel multi-time slot MAC protocol (PMCMTP) for large-scale WSNs especially for Ultra-Wide Band (UWB) based networks. To reduce the complexity of resource sharing, the global network is composed of a set of Personal Area Networks (PANs) or cells. According to available resource and PANs duty cycle, PMCMTP can dynamically assign several data channels per PAN and efficiently allocate time slots to each PAN's members. This significantly decreases delay and increases throughput. Through some simulations, we evaluate the performance of the proposed protocol. The results show that PMCMTP ensures an efficient and fair channels allocation between cells permitting, on the one hand, an enhancement of quality-of-service inside each PAN and, on the other hand, a maximization of channel utility.
{"title":"A prioritized multi-channel multi-time slot MAC protocol for large-scale wireless sensor networks","authors":"Jamila Ben Slimane, Ye-Qiong Songi, A. Koubâa","doi":"10.1109/COMNET.2009.5373569","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373569","url":null,"abstract":"This paper addresses a new prioritized multichannel multi-time slot MAC protocol (PMCMTP) for large-scale WSNs especially for Ultra-Wide Band (UWB) based networks. To reduce the complexity of resource sharing, the global network is composed of a set of Personal Area Networks (PANs) or cells. According to available resource and PANs duty cycle, PMCMTP can dynamically assign several data channels per PAN and efficiently allocate time slots to each PAN's members. This significantly decreases delay and increases throughput. Through some simulations, we evaluate the performance of the proposed protocol. The results show that PMCMTP ensures an efficient and fair channels allocation between cells permitting, on the one hand, an enhancement of quality-of-service inside each PAN and, on the other hand, a maximization of channel utility.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131444449","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 : 2009-11-01DOI: 10.1109/COMNET.2009.5373572
Jamila Ben Slimane, Ye-Qiong Songi, A. Koubâa
Resource allocation is a critical issue for Wireless Sensor Networks (WSNs) especially for Ultra-Wide Band (UWB) based networks. In this paper, we present frequency allocation scheme for an efficient spectrum management that is able to statically assign control channels and dynamically reuse data channels for Personal Area Networks (PANs) inside a Large-Scale WSN based on UWB technology. The frequency allocation problem is decomposed into two sub-problems: static control channel assignment and dynamic data channel allocation. The goal is two-folded: first, we aim to avoid congestion of control channel, second, to maximize simultaneous communications without suffering from interference in order to enhance throughput, decrease delay and minimize energy consumption.
{"title":"Control and data channels allocation for Large-Scale UWB-based WSNs","authors":"Jamila Ben Slimane, Ye-Qiong Songi, A. Koubâa","doi":"10.1109/COMNET.2009.5373572","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373572","url":null,"abstract":"Resource allocation is a critical issue for Wireless Sensor Networks (WSNs) especially for Ultra-Wide Band (UWB) based networks. In this paper, we present frequency allocation scheme for an efficient spectrum management that is able to statically assign control channels and dynamically reuse data channels for Personal Area Networks (PANs) inside a Large-Scale WSN based on UWB technology. The frequency allocation problem is decomposed into two sub-problems: static control channel assignment and dynamic data channel allocation. The goal is two-folded: first, we aim to avoid congestion of control channel, second, to maximize simultaneous communications without suffering from interference in order to enhance throughput, decrease delay and minimize energy consumption.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115491962","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 : 2009-11-01DOI: 10.1109/COMNET.2009.5373566
I. Aissa, M. Frikha, S. Tabbane
Cognitive radio and UWB technologies are new radio designs philosophies in order to optimize the spectrum utilization by exploiting the unused and the under-used spectrum in dynamically changing environments. Although the contrasting philosophies of cognitive radio and UWB technology gains can be made by merging these two technologies. In this paper we propose a cognitive radio based on two MAC protocols which work in a cooperative manner. The first is a MAC UWB protocol for control information transmission, while the second is a MAC protocol for narrow or large band traffic transmission (which depend on the primary user physical implementation). We prove then by analyzing the No real time and the real time Markov chains the efficiency of the CS-OFDMA with pre-reservation access protocol to decrease the Forced termination probability and to increase the throughput of cognitive nodes.
{"title":"Proposition and analysis of multi channel cognitive MAC protocols with parallel transmission of traffic and UWB control information","authors":"I. Aissa, M. Frikha, S. Tabbane","doi":"10.1109/COMNET.2009.5373566","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373566","url":null,"abstract":"Cognitive radio and UWB technologies are new radio designs philosophies in order to optimize the spectrum utilization by exploiting the unused and the under-used spectrum in dynamically changing environments. Although the contrasting philosophies of cognitive radio and UWB technology gains can be made by merging these two technologies. In this paper we propose a cognitive radio based on two MAC protocols which work in a cooperative manner. The first is a MAC UWB protocol for control information transmission, while the second is a MAC protocol for narrow or large band traffic transmission (which depend on the primary user physical implementation). We prove then by analyzing the No real time and the real time Markov chains the efficiency of the CS-OFDMA with pre-reservation access protocol to decrease the Forced termination probability and to increase the throughput of cognitive nodes.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125073701","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 : 2009-11-01DOI: 10.1109/COMNET.2009.5373549
B. Błaszczyszyn, M. Karray
The objective of the present paper is to build a model which permits to capture and analyze the principal impacts of fading and multiuser diversity gain on the dynamic performance of an OFDMA cellular network. To this end, assuming Markovian arrivals and departures of customers that transmit some given data-volumes, as well as some temporal channel variability (fading), we study the mean throughput (and delay) that the network offers to users in the long-term evolution of the system. Explicit formulas are obtained in the case of allocation policies, which may or may-not take advantage of the fading, called respectively opportunistic and non-opportunistic. The main practical results of the present work are the following. Firstly we evaluate for the non-opportunistic allocation the degradation due to fading compared to AWGN (that is, a decrease of at least 13% of the throughput). Secondly, we evaluate the gain induced by the opportunistic allocation. In particular, when the traffic demand per cell exceeds some value (about 2 Mbps in our example), the gain induced by opportunism compensates the degradation induced by fading compared to AWGN.
{"title":"Fading effect on the dynamic performance evaluation of OFDMA cellular networks","authors":"B. Błaszczyszyn, M. Karray","doi":"10.1109/COMNET.2009.5373549","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373549","url":null,"abstract":"The objective of the present paper is to build a model which permits to capture and analyze the principal impacts of fading and multiuser diversity gain on the dynamic performance of an OFDMA cellular network. To this end, assuming Markovian arrivals and departures of customers that transmit some given data-volumes, as well as some temporal channel variability (fading), we study the mean throughput (and delay) that the network offers to users in the long-term evolution of the system. Explicit formulas are obtained in the case of allocation policies, which may or may-not take advantage of the fading, called respectively opportunistic and non-opportunistic. The main practical results of the present work are the following. Firstly we evaluate for the non-opportunistic allocation the degradation due to fading compared to AWGN (that is, a decrease of at least 13% of the throughput). Secondly, we evaluate the gain induced by the opportunistic allocation. In particular, when the traffic demand per cell exceeds some value (about 2 Mbps in our example), the gain induced by opportunism compensates the degradation induced by fading compared to AWGN.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114687158","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 : 2009-11-01DOI: 10.1109/COMNET.2009.5373570
Nihed Bahria El Asghar, M. Frikha, S. Tabbane
IP over WDM is a promising architecture for the Next Generation Internet (NGI) backbones. Traffic Engineering (TE) for next generation multimedia services is a new challenge for multilayer co-operation within these communication networks. In MPLS/GMPLS based IP over WDM networks, the TE process is accomplished by the establishment of an adequate logical topology, above the underlying optical topology. However, under dynamic traffic pattern, optimal logical topology design or minimization of transitions when reconfiguring it, cannot always lead to efficient traffic handling. Logical topology stability and reconfiguration require resource availability in the network. We are addressing here a Mixed Integer Linear Programming (MILP) formulation for the resource saving logical topology design (RSLTD) for reconfigurable network under dynamic traffic pattern. A case study is detailed wishing to show the effectiveness of our proposal.
IP over WDM是下一代互联网(NGI)骨干网的一种很有前途的架构。下一代多媒体业务的流量工程(TE)对这些通信网络的多层协作提出了新的挑战。在基于WDM网络上的IP的MPLS/GMPLS中，TE过程是通过在底层光拓扑之上建立适当的逻辑拓扑来完成的。然而，在动态流量模式下，优化逻辑拓扑设计或在对其进行重新配置时将转换最小化，并不一定能实现高效的流量处理。逻辑拓扑的稳定性和重构要求网络资源的可用性。本文讨论了动态流量模式下可重构网络的资源节约型逻辑拓扑设计的混合整数线性规划(MILP)公式。为了证明我们的建议的有效性，详细的案例研究。
{"title":"Resource saving logical topology design for reconfigurable Next Generation Internet backbones","authors":"Nihed Bahria El Asghar, M. Frikha, S. Tabbane","doi":"10.1109/COMNET.2009.5373570","DOIUrl":"https://doi.org/10.1109/COMNET.2009.5373570","url":null,"abstract":"IP over WDM is a promising architecture for the Next Generation Internet (NGI) backbones. Traffic Engineering (TE) for next generation multimedia services is a new challenge for multilayer co-operation within these communication networks. In MPLS/GMPLS based IP over WDM networks, the TE process is accomplished by the establishment of an adequate logical topology, above the underlying optical topology. However, under dynamic traffic pattern, optimal logical topology design or minimization of transitions when reconfiguring it, cannot always lead to efficient traffic handling. Logical topology stability and reconfiguration require resource availability in the network. We are addressing here a Mixed Integer Linear Programming (MILP) formulation for the resource saving logical topology design (RSLTD) for reconfigurable network under dynamic traffic pattern. A case study is detailed wishing to show the effectiveness of our proposal.","PeriodicalId":185933,"journal":{"name":"2009 First International Conference on Communications and Networking","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126831471","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
扫码关注我们
求助内容：
应助结果提醒方式：