Pub Date : 2006-08-07DOI: 10.1109/WOCN.2006.1666607
R. Bera, J. Bera, S. Sil, S. Dogra, N. B. Sinha, D. Mondal
In an effort to develop a complete DSRC system for ITS application, the authors have studied a lot of experimental facts which they are exploiting for the design. The wireless technology has been chosen properly which is capable of tackling the severe interferences present in the open road. For road to car communication, a combined digital technology like spread spectrum along with diversity reception will help a lot in this regard. Accordingly, the choice is for FHSS based space diversity system which will utilize carrier frequency around 5.8 GHz ISM band with available bandwidth of 80 MHz and no license. For efficient design, the radio channel is characterized on which the design is based. To have the full DSRC system, a fixed wireless connectivity at Ku band is also explored for road side base station to master switching center connectivity
{"title":"Dedicated short range communications (DSRC) for intelligent transport system","authors":"R. Bera, J. Bera, S. Sil, S. Dogra, N. B. Sinha, D. Mondal","doi":"10.1109/WOCN.2006.1666607","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666607","url":null,"abstract":"In an effort to develop a complete DSRC system for ITS application, the authors have studied a lot of experimental facts which they are exploiting for the design. The wireless technology has been chosen properly which is capable of tackling the severe interferences present in the open road. For road to car communication, a combined digital technology like spread spectrum along with diversity reception will help a lot in this regard. Accordingly, the choice is for FHSS based space diversity system which will utilize carrier frequency around 5.8 GHz ISM band with available bandwidth of 80 MHz and no license. For efficient design, the radio channel is characterized on which the design is based. To have the full DSRC system, a fixed wireless connectivity at Ku band is also explored for road side base station to master switching center connectivity","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121159184","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-08-07DOI: 10.1109/WOCN.2006.1666668
R.R.C. Reddy, T. Srinivas, A. Nadarajan
Performances of spectrally efficient multi level modulation schemes in chaotic optical communication systems are demonstrated numerically. In this paper we report usage of multi level modulation schemes in the form of QDPASK (quadrature differential phase amplitude shift keying) and IHAP (independent hybrid amplitude/phase modulation). Return to zero (RZ) pulse profiled QDPASK signal is added to the chaotic waveform and successfully retrieved. IHAP modulation of chaos is carried out and successful recovery of data is shown along with comparison with RZ-QDPASK. Successful recovery of message encoded in both schemes is shown heralding in improvement of bit rate 3 times than the ordinary chaotic optical communication system with only amplitude encoding
{"title":"Comparative study between multi level modulations in chaotic optical communications","authors":"R.R.C. Reddy, T. Srinivas, A. Nadarajan","doi":"10.1109/WOCN.2006.1666668","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666668","url":null,"abstract":"Performances of spectrally efficient multi level modulation schemes in chaotic optical communication systems are demonstrated numerically. In this paper we report usage of multi level modulation schemes in the form of QDPASK (quadrature differential phase amplitude shift keying) and IHAP (independent hybrid amplitude/phase modulation). Return to zero (RZ) pulse profiled QDPASK signal is added to the chaotic waveform and successfully retrieved. IHAP modulation of chaos is carried out and successful recovery of data is shown along with comparison with RZ-QDPASK. Successful recovery of message encoded in both schemes is shown heralding in improvement of bit rate 3 times than the ordinary chaotic optical communication system with only amplitude encoding","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115502141","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-08-07DOI: 10.1109/WOCN.2006.1666605
N. Chand, R. Joshi, M. Misra
Caching is a promising technique in mobile computing environment for improving the data retrieval performance. Due to cache size limitations, cache replacement algorithms are used to find a suitable subset of items for eviction from the cache. Cached items in a client are related to each other and therefore replacement of a data item which is highly associated may lead to series of misses during client's subsequent requests. The existing policies for cache replacement in mobile environment do not consider relationship among data items along with caching parameters. This paper proposes a novel cache replacement policy, R-LPV that considers the caching parameters of a data item along with the relationship of this item with the cache set. The simulation experiments show that, the R-LPV policy substantially outperforms other policies
{"title":"Data profit based cache replacement in mobile environment","authors":"N. Chand, R. Joshi, M. Misra","doi":"10.1109/WOCN.2006.1666605","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666605","url":null,"abstract":"Caching is a promising technique in mobile computing environment for improving the data retrieval performance. Due to cache size limitations, cache replacement algorithms are used to find a suitable subset of items for eviction from the cache. Cached items in a client are related to each other and therefore replacement of a data item which is highly associated may lead to series of misses during client's subsequent requests. The existing policies for cache replacement in mobile environment do not consider relationship among data items along with caching parameters. This paper proposes a novel cache replacement policy, R-LPV that considers the caching parameters of a data item along with the relationship of this item with the cache set. The simulation experiments show that, the R-LPV policy substantially outperforms other policies","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132314975","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-08-07DOI: 10.1109/WOCN.2006.1666674
K. Nallaperumal, J. Varghese, S. Saudia, J. J. Ranjani, K. Velu, S. Kannan
A novel contour representation algorithm for binary images which is an extension of the conventional chain code is proposed in this paper. The algorithm exploits the features of the conventional chain code when advantageous, is precise and simple with lesser computational complexity than most of the other standard shape representation algorithms. It uses very low bit-rate compared to the conventional chain code and is more robust to noise. The corresponding reconstruction algorithm is completely reversible to give the lossless reconstruction of the contour. Experimental results on various binary images add to the improved efficiency claim of the proposed contour representation algorithm in terms of visual fidelity and bit-rate
{"title":"An efficient extension to chain codes for external image representation","authors":"K. Nallaperumal, J. Varghese, S. Saudia, J. J. Ranjani, K. Velu, S. Kannan","doi":"10.1109/WOCN.2006.1666674","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666674","url":null,"abstract":"A novel contour representation algorithm for binary images which is an extension of the conventional chain code is proposed in this paper. The algorithm exploits the features of the conventional chain code when advantageous, is precise and simple with lesser computational complexity than most of the other standard shape representation algorithms. It uses very low bit-rate compared to the conventional chain code and is more robust to noise. The corresponding reconstruction algorithm is completely reversible to give the lossless reconstruction of the contour. Experimental results on various binary images add to the improved efficiency claim of the proposed contour representation algorithm in terms of visual fidelity and bit-rate","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130860364","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-08-07DOI: 10.1109/WOCN.2006.1666580
Fan Chen, Sui Lijun, Chen Mei-ya, Y. Dacheng
A Markov based method for modulation and coding scheme (MCS) selection is proposed for pilot assistant adaptive modulation and coding scheme (AMC) with hybrid ARQ (HARQ) retransmissions. A first-order finite-state Markov model (FSMM) is introduced to represent the time correlation character of channel fading during (channel quality indicator) CQI feedback and HARQ retransmissions. According to different QoS targets, such as maximizing the air interface throughput or maintaining a target frame error rate (FER) for each user, the Markov based method can deduce different reference pilot thresholds for each MCS. Theoretical analysis and link level simulation results both show the efficiency of the Markov based method for pilot threshold calculation according to different QoS target and different HARQ retransmission times
{"title":"A Markov based method for modulation and coding scheme (MCS) with hybrid ARQ retransmission","authors":"Fan Chen, Sui Lijun, Chen Mei-ya, Y. Dacheng","doi":"10.1109/WOCN.2006.1666580","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666580","url":null,"abstract":"A Markov based method for modulation and coding scheme (MCS) selection is proposed for pilot assistant adaptive modulation and coding scheme (AMC) with hybrid ARQ (HARQ) retransmissions. A first-order finite-state Markov model (FSMM) is introduced to represent the time correlation character of channel fading during (channel quality indicator) CQI feedback and HARQ retransmissions. According to different QoS targets, such as maximizing the air interface throughput or maintaining a target frame error rate (FER) for each user, the Markov based method can deduce different reference pilot thresholds for each MCS. Theoretical analysis and link level simulation results both show the efficiency of the Markov based method for pilot threshold calculation according to different QoS target and different HARQ retransmission times","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128486373","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-08-07DOI: 10.1109/WOCN.2006.1666606
K. Rama Naidu, R. R. Raja Kumar, T. S. Lamba
A multipath transmission diversity scheme using predictive transmitter filter in the frequency division duplex-code division multiple access systems (FDD-CDMA) is introduced over a multipath fading channel. A transmitter filter is added in the transmitter, while a Rake combiner is used in the receiver. To design the transmitter filter at the base station for the current slot, we utilize the downlink channel impulse response (CIR) of the previous slots. It is assumed that the downlink CIR is transmitted from the mobile terminal to the base station. In addition, to compensate inherent feedback delays occurring during the transmission of channel information from mobile terminal to the base station, the channel prediction is utilized. Results show that the new scheme can significantly improve the output signal to noise ratio (SNR) compared with conventional Rake receiver
{"title":"A multipath transmission diversity scheme using prediction-based transmitter filter in FDD-CDMA systems","authors":"K. Rama Naidu, R. R. Raja Kumar, T. S. Lamba","doi":"10.1109/WOCN.2006.1666606","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666606","url":null,"abstract":"A multipath transmission diversity scheme using predictive transmitter filter in the frequency division duplex-code division multiple access systems (FDD-CDMA) is introduced over a multipath fading channel. A transmitter filter is added in the transmitter, while a Rake combiner is used in the receiver. To design the transmitter filter at the base station for the current slot, we utilize the downlink channel impulse response (CIR) of the previous slots. It is assumed that the downlink CIR is transmitted from the mobile terminal to the base station. In addition, to compensate inherent feedback delays occurring during the transmission of channel information from mobile terminal to the base station, the channel prediction is utilized. Results show that the new scheme can significantly improve the output signal to noise ratio (SNR) compared with conventional Rake receiver","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126586540","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-08-07DOI: 10.1109/WOCN.2006.1666587
K. Vinay, N. Sreenivasulu, D. Jayaram, D. Das
IEEE 802.16 standard supports real time and non-real time services at each node. However, it has flexibility to develop customized scheduling algorithms according to different priority-based traffic's quality of service (QoS) requirements. Hence, it is imperative to obtain optimum scheduling schemes for different kinds of traffic (i.e., services). Earliest due date (EDD) is one of the highly referred scheduling algorithms for real time communication. In this presentation, our study shows that the proposed hybrid algorithms (EDD along with weighted fair queue (WFQ)) in a node gives better performance for real time services instead of EDD only. Moreover, the results reveal that, scheduling schemes from base station (BS) to subscriber station (SS) like grant per SS (GPSS) impacts less delay than grant per connection (GPC)
IEEE 802.16标准支持每个节点的实时和非实时业务。但是，它可以灵活地根据不同优先级流量的QoS (quality of service)需求开发自定义调度算法。因此，针对不同类型的流量(即服务)获得最优调度方案势在必行。最早到期日调度算法(EDD)是一种被高度引用的实时通信调度算法。在本报告中，我们的研究表明，在节点中提出的混合算法(EDD和加权公平队列(WFQ))比仅EDD提供更好的实时服务性能。此外，结果表明，从基站(BS)到用户站(SS)的调度方案，如每SS授予(GPSS)对延迟的影响小于每连接授予(GPC)。
{"title":"Performance evaluation of end-to-end delay by hybrid scheduling algorithm for QoS in IEEE 802.16 network","authors":"K. Vinay, N. Sreenivasulu, D. Jayaram, D. Das","doi":"10.1109/WOCN.2006.1666587","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666587","url":null,"abstract":"IEEE 802.16 standard supports real time and non-real time services at each node. However, it has flexibility to develop customized scheduling algorithms according to different priority-based traffic's quality of service (QoS) requirements. Hence, it is imperative to obtain optimum scheduling schemes for different kinds of traffic (i.e., services). Earliest due date (EDD) is one of the highly referred scheduling algorithms for real time communication. In this presentation, our study shows that the proposed hybrid algorithms (EDD along with weighted fair queue (WFQ)) in a node gives better performance for real time services instead of EDD only. Moreover, the results reveal that, scheduling schemes from base station (BS) to subscriber station (SS) like grant per SS (GPSS) impacts less delay than grant per connection (GPC)","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124434037","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-08-07DOI: 10.1109/WOCN.2006.1666625
T. Basavaraju, S. Sarkar, C. Puttamadappa
The integration of Internet and ad hoc mobile network exhibit differences in their network architecture. Thus, the interconnection is achieved by using Internet gateways, which acts as bridges between MANET and Internet. When a node in ad hoc network wants to access Internet, it has to first find route to a gateway. Therefore an efficient gateway discovery approach or mechanism is required. In this paper, the MANET routing protocol ad hoc on demand vector (AODV) is extended to support hybrid network. The three approaches for discovering gateways such as reactive, proactive and hybrid are compared and studied in different scenarios. We show that proactive and reactive performs better in different simulation environment
互联网与自组织移动网络的融合在网络架构上存在差异。因此，互连是通过使用互联网网关来实现的，网关充当MANET和互联网之间的桥梁。当自组织网络中的节点想要访问Internet时，它必须首先找到到网关的路由。因此，需要一种有效的网关发现方法或机制。本文对MANET路由协议AODV (ad hoc on demand vector)进行了扩展，以支持混合网络。在不同的场景下，对被动、主动和混合三种网关发现方法进行了比较和研究。结果表明，在不同的仿真环境下，主动响应和被动响应具有更好的性能
{"title":"Scenario based performance analysis of different gateway discovery mechanisms in integrated ad hoc networks and Internet","authors":"T. Basavaraju, S. Sarkar, C. Puttamadappa","doi":"10.1109/WOCN.2006.1666625","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666625","url":null,"abstract":"The integration of Internet and ad hoc mobile network exhibit differences in their network architecture. Thus, the interconnection is achieved by using Internet gateways, which acts as bridges between MANET and Internet. When a node in ad hoc network wants to access Internet, it has to first find route to a gateway. Therefore an efficient gateway discovery approach or mechanism is required. In this paper, the MANET routing protocol ad hoc on demand vector (AODV) is extended to support hybrid network. The three approaches for discovering gateways such as reactive, proactive and hybrid are compared and studied in different scenarios. We show that proactive and reactive performs better in different simulation environment","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121508412","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-08-07DOI: 10.1109/WOCN.2006.1666561
S. Bassam, M.E.K. Khaandani
There are two approaches in designing MAC protocols: adaptive-power and adaptive-rate MACs. In adaptive-power MACs transmission power is changed upon nodes' distance in order to reduce energy consumption. In adaptive-rate MACs transmission rate is changed in order to improve throughput. Recent adaptive-power protocols suggest varying the transmission power such that the RTS/CTS handshake is done at the maximum and the data-ACK are transmitted at the minimum necessary transmission power level. It has also been suggested to periodically use maximum transmission power during data transmission (PCM MAC). In this paper we show that although adaptive-rate MACs are designed to increase throughput but they are also more power-efficient than adaptive-power MACs with maximum RTS-CTS power
{"title":"Comparing adaptive-power and adaptive-rate MACs for wireless ad-hoc networks","authors":"S. Bassam, M.E.K. Khaandani","doi":"10.1109/WOCN.2006.1666561","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666561","url":null,"abstract":"There are two approaches in designing MAC protocols: adaptive-power and adaptive-rate MACs. In adaptive-power MACs transmission power is changed upon nodes' distance in order to reduce energy consumption. In adaptive-rate MACs transmission rate is changed in order to improve throughput. Recent adaptive-power protocols suggest varying the transmission power such that the RTS/CTS handshake is done at the maximum and the data-ACK are transmitted at the minimum necessary transmission power level. It has also been suggested to periodically use maximum transmission power during data transmission (PCM MAC). In this paper we show that although adaptive-rate MACs are designed to increase throughput but they are also more power-efficient than adaptive-power MACs with maximum RTS-CTS power","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121903693","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-08-07DOI: 10.1109/WOCN.2006.1666656
J.S. Pedersen, N. Chilamkurti
Multicasting techniques can be applied to facilitate applications such as video conference-calls and multimedia distribution. Multicasting enhances network utilization by containing traffic to network segments that are part of the multicast tree only. This prevents network segments that are not part of the multicast tree to be flooded with unwanted traffic. In addition, multicasting prevents redundancy by copying packets destined for multiple downstream receivers at branching routers. Reservation protocol (RSVP) guarantees QoS for real-time applications and has the ability to achieve fairness across applications. An extension to RSVP called RSVP-traffic engineering (RSVP-TE) is proposed, which enables RSVP PATH and RESV messages to setup traffic engineered label switched paths (LSP). By adding multicast operations to RSVP-TE, point to multi-point LSPs can be created and this effectively enables multicasting within the MPLS domain. In this paper we present multicasting and QoS within a MPLS backbone (MQM) and an extension to the network simulator (NS-2), that shows the advantages of combining multicasting and RSVP-TE within an MPLS domain
{"title":"A new approach to multicasting and QoS within an MPLS backbone","authors":"J.S. Pedersen, N. Chilamkurti","doi":"10.1109/WOCN.2006.1666656","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666656","url":null,"abstract":"Multicasting techniques can be applied to facilitate applications such as video conference-calls and multimedia distribution. Multicasting enhances network utilization by containing traffic to network segments that are part of the multicast tree only. This prevents network segments that are not part of the multicast tree to be flooded with unwanted traffic. In addition, multicasting prevents redundancy by copying packets destined for multiple downstream receivers at branching routers. Reservation protocol (RSVP) guarantees QoS for real-time applications and has the ability to achieve fairness across applications. An extension to RSVP called RSVP-traffic engineering (RSVP-TE) is proposed, which enables RSVP PATH and RESV messages to setup traffic engineered label switched paths (LSP). By adding multicast operations to RSVP-TE, point to multi-point LSPs can be created and this effectively enables multicasting within the MPLS domain. In this paper we present multicasting and QoS within a MPLS backbone (MQM) and an extension to the network simulator (NS-2), that shows the advantages of combining multicasting and RSVP-TE within an MPLS domain","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116763487","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
扫码关注我们
求助内容：
应助结果提醒方式：