Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700359
T. Szymanski, Bell Canada Chair
The theory of a future Internet network which achieves essentially-perfect QoS guarantees for all QoS-enabled traffic flows for all loads ≤ 100% of capacity has recently been established. A scheduling algorithm with a bounded normalized service lead/lag (NSLL) is used to schedule traffic flows within the routers. An 'Application-Specific Token-Buffer Traffic Shaper' is used at the traffic sources, to achieve a bounded NSLL on incoming bursty traffic flows. An 'Application-Specific Playback Queue' is used to perfectly regenerate the original busty traffic flows at every destination. Under these conditions, it has been established that every QoS-enabled flow: (i) is delivered with essentially-perfect end-to-end QoS guarantees, and (ii) buffers O(K) cells/packets per router, where K is the bound on the NSLL. In this paper, we reduce the router buffering requirements significantly, so that each router buffers ≤ one cell/packet per QoS-enabled traffic flow, a reduction of up to 1K-10K over existing technologies. The proposed technology can be incorporated into new routers with negligible hardware cost, and is compatible with existing IntServ, DiffServ, MPLS and RSVP-TE protocols.
{"title":"Memory requirements for future Internet routers with essentially-perfect QoS guarantees","authors":"T. Szymanski, Bell Canada Chair","doi":"10.1109/GLOCOMW.2010.5700359","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700359","url":null,"abstract":"The theory of a future Internet network which achieves essentially-perfect QoS guarantees for all QoS-enabled traffic flows for all loads ≤ 100% of capacity has recently been established. A scheduling algorithm with a bounded normalized service lead/lag (NSLL) is used to schedule traffic flows within the routers. An 'Application-Specific Token-Buffer Traffic Shaper' is used at the traffic sources, to achieve a bounded NSLL on incoming bursty traffic flows. An 'Application-Specific Playback Queue' is used to perfectly regenerate the original busty traffic flows at every destination. Under these conditions, it has been established that every QoS-enabled flow: (i) is delivered with essentially-perfect end-to-end QoS guarantees, and (ii) buffers O(K) cells/packets per router, where K is the bound on the NSLL. In this paper, we reduce the router buffering requirements significantly, so that each router buffers ≤ one cell/packet per QoS-enabled traffic flow, a reduction of up to 1K-10K over existing technologies. The proposed technology can be incorporated into new routers with negligible hardware cost, and is compatible with existing IntServ, DiffServ, MPLS and RSVP-TE protocols.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126742339","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-12-01DOI: 10.1109/GLOCOMW.2010.5700098
A. Mirvakili, V. Joyner
Recent breakthroughs in solid-state lighting technology has opened the door to a myriad of applications using light-emitting diodes for both illumination and optical wireless networking. Low-power CMOS technology enables realization of mixed-mode, system-on-chip driver circuits integrating multiple functions on a single substrate to control LED device performance, luminance, and data modulation for “intelligent” visible light networking. This paper presents a novel LED driver circuit architecture incorporating digitally-controlled analog circuit blocks to deliver concurrent illumination control and serial data transmission. To achieve this goal, a bi-level pulse-width modulation (PWM) driving scheme is applied to enable data transmission during the “OFF” period of the LED drive current. With 3-bit PWM dimming resolution, the driver circuit enables linear luminous intensity control from 5% to 100%. Pseudo-random binary sequences (PRBS) are generated to compare circuit performance for various data modulation formats. The LED driver circuit is simulated in a 0.5µm CMOS process and exhibits a worst-case power consumption of 100mW with 33mA peak PWM current.
{"title":"A digitally-controlled, bi-level CMOS LED driver circuit combining PWM dimming and data transmission for visible light networks","authors":"A. Mirvakili, V. Joyner","doi":"10.1109/GLOCOMW.2010.5700098","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700098","url":null,"abstract":"Recent breakthroughs in solid-state lighting technology has opened the door to a myriad of applications using light-emitting diodes for both illumination and optical wireless networking. Low-power CMOS technology enables realization of mixed-mode, system-on-chip driver circuits integrating multiple functions on a single substrate to control LED device performance, luminance, and data modulation for “intelligent” visible light networking. This paper presents a novel LED driver circuit architecture incorporating digitally-controlled analog circuit blocks to deliver concurrent illumination control and serial data transmission. To achieve this goal, a bi-level pulse-width modulation (PWM) driving scheme is applied to enable data transmission during the “OFF” period of the LED drive current. With 3-bit PWM dimming resolution, the driver circuit enables linear luminous intensity control from 5% to 100%. Pseudo-random binary sequences (PRBS) are generated to compare circuit performance for various data modulation formats. The LED driver circuit is simulated in a 0.5µm CMOS process and exhibits a worst-case power consumption of 100mW with 33mA peak PWM current.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126764392","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-12-01DOI: 10.1109/GLOCOMW.2010.5700134
A. A. Gohari, V. Rodoplu
We develop a space-centric routing protocol to enable the delivery of mobile VoIP over high-mobility multi-hop wireless networks. The novel aspect of this protocol is the attribution of network and MAC layer congestion to space, which provides delay guarantees over much longer durations than can be achieved by node-centric routing protocols. The presented protocol constructs a spatial map of network congestion and utilizes this map to reactively find routes over space (cells) rather than individual nodes. The amount of congestion in each cell is tracked proactively by measurements of experienced local delay and is quickly disseminated among the nodes. Through QualNet simulations, we demonstrate substantial improvements in comparison with AODV and LAR over a realistic terrain with obstacles, for a wide range of node densities and velocities.
{"title":"DMQR: A spatial routing protocol to enable VoIP over high-mobility wireless multihop networks","authors":"A. A. Gohari, V. Rodoplu","doi":"10.1109/GLOCOMW.2010.5700134","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700134","url":null,"abstract":"We develop a space-centric routing protocol to enable the delivery of mobile VoIP over high-mobility multi-hop wireless networks. The novel aspect of this protocol is the attribution of network and MAC layer congestion to space, which provides delay guarantees over much longer durations than can be achieved by node-centric routing protocols. The presented protocol constructs a spatial map of network congestion and utilizes this map to reactively find routes over space (cells) rather than individual nodes. The amount of congestion in each cell is tracked proactively by measurements of experienced local delay and is quickly disseminated among the nodes. Through QualNet simulations, we demonstrate substantial improvements in comparison with AODV and LAR over a realistic terrain with obstacles, for a wide range of node densities and velocities.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115515249","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-12-01DOI: 10.1109/GLOCOMW.2010.5700399
James Pope, R. Simon
Protocols such as 6LoWPAN will soon directly connect the Internet to the rapidly growing number of deployed Low Power and Lossy Networks (L2Ns). The outcome will enable many novel applications, including new types of Cyber-Physical Systems, the “Internet-of-Thing”, the Smart Grid, etc. Due to resource constraints the performance of a L2N routing protocol is quite sensitive to changes in protocol parameters such as route maintenance and packet retransmission timers. However, the lack of network management tools makes it quite difficult to efficiently set these parameters or even to effectively compare different protocols across multiple metrics of reliability, energy consumption, throughput and delay. Our paper addresses this issue. We discuss the most important parameters that must be managed within an Internet-friendly L2N. We propose a novel management heuristic called ROLL-POWER, designed to simplify the monitoring of L2N performance, independent of the routing protocol type. Through extensive simulation we evaluate our claims about the importance of correct parameter setting and the efficiency of the ROLL-POWER metric. Our results show that this simple metric can be used by a network manager both to tune protocol parameters for L2Ns and as a simple and direct method of comparing different protocols.
{"title":"Managing Internet protocol routing for Low Power Lossy Networks","authors":"James Pope, R. Simon","doi":"10.1109/GLOCOMW.2010.5700399","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700399","url":null,"abstract":"Protocols such as 6LoWPAN will soon directly connect the Internet to the rapidly growing number of deployed Low Power and Lossy Networks (L2Ns). The outcome will enable many novel applications, including new types of Cyber-Physical Systems, the “Internet-of-Thing”, the Smart Grid, etc. Due to resource constraints the performance of a L2N routing protocol is quite sensitive to changes in protocol parameters such as route maintenance and packet retransmission timers. However, the lack of network management tools makes it quite difficult to efficiently set these parameters or even to effectively compare different protocols across multiple metrics of reliability, energy consumption, throughput and delay. Our paper addresses this issue. We discuss the most important parameters that must be managed within an Internet-friendly L2N. We propose a novel management heuristic called ROLL-POWER, designed to simplify the monitoring of L2N performance, independent of the routing protocol type. Through extensive simulation we evaluate our claims about the importance of correct parameter setting and the efficiency of the ROLL-POWER metric. Our results show that this simple metric can be used by a network manager both to tune protocol parameters for L2Ns and as a simple and direct method of comparing different protocols.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122362185","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-12-01DOI: 10.1109/GLOCOMW.2010.5700293
G. Sakellari, E. Gelenbe
Admission control based on multiple criteria has always been a desirable feature for computer networks. In the past, we presented such a system, but it was based on a centralised decision mechanism, which by itself constitutes a significant limitation. Here, we describe a decentralised version of the initial admission control algorithm, while still keeping the multiple-criteria aspect, with each user being able to specify their Quality of Service (QoS) metrics at the level of the individual. Our scheme decides whether a new call should be allowed to enter the network based on measurements of the QoS metrics on each link of the network before and after the transmission of probe packets. The decision is based on a novel algebra of QoS metrics, inspired by Warshall's algorithm that searches whether there is a feasible path to accommodate the new flow without affecting the existing users. The decision is made at each source node individually, based on either only personal information or also on information exchange among the nodes that are involved. The performance of the algorithm is evaluated in terms of QoS throughout the lifetime of all connections. The experiments presented in this paper were conducted in an actual laboratory test-bed of realistic topology and under highly congested circumstances. The results are particularly encouraging.
{"title":"A distributed admission control mechanism for multi-criteria QoS","authors":"G. Sakellari, E. Gelenbe","doi":"10.1109/GLOCOMW.2010.5700293","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700293","url":null,"abstract":"Admission control based on multiple criteria has always been a desirable feature for computer networks. In the past, we presented such a system, but it was based on a centralised decision mechanism, which by itself constitutes a significant limitation. Here, we describe a decentralised version of the initial admission control algorithm, while still keeping the multiple-criteria aspect, with each user being able to specify their Quality of Service (QoS) metrics at the level of the individual. Our scheme decides whether a new call should be allowed to enter the network based on measurements of the QoS metrics on each link of the network before and after the transmission of probe packets. The decision is based on a novel algebra of QoS metrics, inspired by Warshall's algorithm that searches whether there is a feasible path to accommodate the new flow without affecting the existing users. The decision is made at each source node individually, based on either only personal information or also on information exchange among the nodes that are involved. The performance of the algorithm is evaluated in terms of QoS throughout the lifetime of all connections. The experiments presented in this paper were conducted in an actual laboratory test-bed of realistic topology and under highly congested circumstances. The results are particularly encouraging.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122948146","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-12-01DOI: 10.1109/GLOCOMW.2010.5700304
Shuping Liu, A. Panangadan, A. Talukder, C. Raghavendra
Embedded sensors of a Body Sensor Network need to efficiently utilize their energy resources to operate for an extended amount of time. A Markov Decision Process (MDP) framework has been used to obtain a globally optimal policy that coordinated the sampling of multiple sensors to achieve high efficiency in such sensor networks. However, storing the coordinated sampling policy table requires a large amount of memory which may not be available at the embedded sensors. Computing a compact representation of the MDP global policy will be useful for such sensor nodes. In this paper we show that a decision tree-based learning of a compact representation is feasible with little loss in performance. The global optimal policy is computed offline using the MDP framework and this is then used as training data in a decision tree learner. Our simulation results show that both unpruned and high confidence-pruned decision trees provide an error rate of less than 1% while significantly reducing the memory requirements. Ensembles of lower-confidence trees are capable of perfect representation with only small increase in classifier size compared to individual pruned trees.
{"title":"Compact representation of coordinated sampling policies for Body Sensor Networks","authors":"Shuping Liu, A. Panangadan, A. Talukder, C. Raghavendra","doi":"10.1109/GLOCOMW.2010.5700304","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700304","url":null,"abstract":"Embedded sensors of a Body Sensor Network need to efficiently utilize their energy resources to operate for an extended amount of time. A Markov Decision Process (MDP) framework has been used to obtain a globally optimal policy that coordinated the sampling of multiple sensors to achieve high efficiency in such sensor networks. However, storing the coordinated sampling policy table requires a large amount of memory which may not be available at the embedded sensors. Computing a compact representation of the MDP global policy will be useful for such sensor nodes. In this paper we show that a decision tree-based learning of a compact representation is feasible with little loss in performance. The global optimal policy is computed offline using the MDP framework and this is then used as training data in a decision tree learner. Our simulation results show that both unpruned and high confidence-pruned decision trees provide an error rate of less than 1% while significantly reducing the memory requirements. Ensembles of lower-confidence trees are capable of perfect representation with only small increase in classifier size compared to individual pruned trees.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129856530","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-12-01DOI: 10.1109/GLOCOMW.2010.5700139
F. Penna, R. Garello, M. Spirito
In this paper we address the problem of distributed Bayesian hypothesis testing in wireless networks where correlations among nodes are modeled as exponential Markov Random Fields (MRF). Applying distributed Belief Propagation (BP), we first derive message and belief update rules for the above model expressed under a likelihood ratio formulation. Then we analyze the properties of BP when the MRF correlation values tend to infinity, and we show that in this limit BP behaves as a consensus scheme. As a result, both problems of heterogeneous hypothesis testing (i.e., MRF estimation) and homogeneous hypothesis testing (i.e., consensus building) can be seen under a unified framework.
{"title":"Likelihood-ratio propagation and consensus in wireless networks with Markov Random Field models","authors":"F. Penna, R. Garello, M. Spirito","doi":"10.1109/GLOCOMW.2010.5700139","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700139","url":null,"abstract":"In this paper we address the problem of distributed Bayesian hypothesis testing in wireless networks where correlations among nodes are modeled as exponential Markov Random Fields (MRF). Applying distributed Belief Propagation (BP), we first derive message and belief update rules for the above model expressed under a likelihood ratio formulation. Then we analyze the properties of BP when the MRF correlation values tend to infinity, and we show that in this limit BP behaves as a consensus scheme. As a result, both problems of heterogeneous hypothesis testing (i.e., MRF estimation) and homogeneous hypothesis testing (i.e., consensus building) can be seen under a unified framework.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129317799","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-12-01DOI: 10.1109/GLOCOMW.2010.5700442
Jinlin Fu, Chunping Hou, W. Xiang, Lei Yan, Yonghong Hou
We propose a new generalised spatial modulation (GSM) technique, which can be considered as a generalisation of the recently proposed spatial modulation (SM) technique. SM can be seen as a special case of GSM with only one active transmit antenna. In contrast to SM, GSM uses the indices of multiple transmit antennas to map information bits, and is thus able to achieve substantially increased spectral efficiency. Furthermore, selecting multiple active transmit antennas enables GSM to harvest significant transmit diversity gains in comparison to SM, because all the active antennas transmit the same information. On the other hand, inter-channel interference (ICI) is completely avoided by transmitting the same symbols through these active antennas. We present theoretical analysis using order statistics for the symbol error rate (SER) performance of GSM. The analytical results are in close agreement with our simulation results. The bit error rate performance of GSM and SM is simulated and compared, which demonstrates the superiority of GSM. Moreover, GSM systems with configurations of different transmit and receive antennas are studied. Our results suggest that using a less number of transmit antennas with a higher modulation order will lead to better BER performance.
{"title":"Generalised spatial modulation with multiple active transmit antennas","authors":"Jinlin Fu, Chunping Hou, W. Xiang, Lei Yan, Yonghong Hou","doi":"10.1109/GLOCOMW.2010.5700442","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700442","url":null,"abstract":"We propose a new generalised spatial modulation (GSM) technique, which can be considered as a generalisation of the recently proposed spatial modulation (SM) technique. SM can be seen as a special case of GSM with only one active transmit antenna. In contrast to SM, GSM uses the indices of multiple transmit antennas to map information bits, and is thus able to achieve substantially increased spectral efficiency. Furthermore, selecting multiple active transmit antennas enables GSM to harvest significant transmit diversity gains in comparison to SM, because all the active antennas transmit the same information. On the other hand, inter-channel interference (ICI) is completely avoided by transmitting the same symbols through these active antennas. We present theoretical analysis using order statistics for the symbol error rate (SER) performance of GSM. The analytical results are in close agreement with our simulation results. The bit error rate performance of GSM and SM is simulated and compared, which demonstrates the superiority of GSM. Moreover, GSM systems with configurations of different transmit and receive antennas are studied. Our results suggest that using a less number of transmit antennas with a higher modulation order will lead to better BER performance.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130394409","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-12-01DOI: 10.1109/GLOCOMW.2010.5700351
P. Tseng, W. Chung
Network failures often cause service interruptions as well as packet losses. To mitigate the impact of failures, many IP fast local recovery schemes have been proposed to reroute traffic in the event of failure in past literatures. However, the rerouted traffic may cause congestion or overload on pre-computed backup routes if the link capacity on those backup routes is not considered in recovery schemes. In this paper, we propose a Simulated Annealing based Load Balanced (SALB) fast IP local protection scheme to construct backup routing tables for protecting link failures. In the proposed SALB scheme, we jointly consider protection switching time, network survivability, and traffic load distribution. The proposed SALB scheme is capable of mitigating other kinds of failures, such as node failures or SRLG failures. In the proposed scheme, upon a failure, only the nodes adjacent to a failure are activated to divert affected traffic to backup paths. This local reaction process guarantees fast protection switching and reduces failure recovery time. Besides, we formulate this problem as a mixed integer programming problem, in which the working traffic load on the most congested link is to be minimized while protecting link failures. Numerical results delineate that the proposed scheme achieves high survivability and load balancing at the expense of slightly increasing the average path hop count and the entries of backup routing table.
{"title":"Simulated Annealing based weight assignment scheme for Load Balanced fast IP local failure recovery","authors":"P. Tseng, W. Chung","doi":"10.1109/GLOCOMW.2010.5700351","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700351","url":null,"abstract":"Network failures often cause service interruptions as well as packet losses. To mitigate the impact of failures, many IP fast local recovery schemes have been proposed to reroute traffic in the event of failure in past literatures. However, the rerouted traffic may cause congestion or overload on pre-computed backup routes if the link capacity on those backup routes is not considered in recovery schemes. In this paper, we propose a Simulated Annealing based Load Balanced (SALB) fast IP local protection scheme to construct backup routing tables for protecting link failures. In the proposed SALB scheme, we jointly consider protection switching time, network survivability, and traffic load distribution. The proposed SALB scheme is capable of mitigating other kinds of failures, such as node failures or SRLG failures. In the proposed scheme, upon a failure, only the nodes adjacent to a failure are activated to divert affected traffic to backup paths. This local reaction process guarantees fast protection switching and reduces failure recovery time. Besides, we formulate this problem as a mixed integer programming problem, in which the working traffic load on the most congested link is to be minimized while protecting link failures. Numerical results delineate that the proposed scheme achieves high survivability and load balancing at the expense of slightly increasing the average path hop count and the entries of backup routing table.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127006820","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-12-01DOI: 10.1109/GLOCOMW.2010.5700453
M. Kurosaki, R. Imashioya, M. Matsuo, B. Sai, Y. Kuroki, H. Ochi
In this paper, we propose a 4K digital cinema transmission over 1.2Gbps wireless LAN system. The proposed system employs the next generation wireless LAN system based on IEEE802.11ac specification. It reaches more than 33 meter propagation distance by using 80MHz of bandwidth on the 5GHz band. In this system, video data is compressed by JPEG 2000 with error resilience tools. These tools improve error performance against wireless channel, and enable very high throughput communication. Computer simulations are used to evaluate the bit error performance's influences to the video quality. Finally, we present RTL design results of the proposed wireless LAN system.
{"title":"4K digital cinema home theater over high throughput wireless transmission system","authors":"M. Kurosaki, R. Imashioya, M. Matsuo, B. Sai, Y. Kuroki, H. Ochi","doi":"10.1109/GLOCOMW.2010.5700453","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700453","url":null,"abstract":"In this paper, we propose a 4K digital cinema transmission over 1.2Gbps wireless LAN system. The proposed system employs the next generation wireless LAN system based on IEEE802.11ac specification. It reaches more than 33 meter propagation distance by using 80MHz of bandwidth on the 5GHz band. In this system, video data is compressed by JPEG 2000 with error resilience tools. These tools improve error performance against wireless channel, and enable very high throughput communication. Computer simulations are used to evaluate the bit error performance's influences to the video quality. Finally, we present RTL design results of the proposed wireless LAN system.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"48 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114060476","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
扫码关注我们
求助内容：
应助结果提醒方式：