Pub Date : 2011-07-04DOI: 10.1109/HPSR.2011.5986018
J. Jelinskis, A. Skrastins, G. Lauks
The Multiprotocol Label Switching - Traffic Engineering Extension (MPLS-TE) was introduced by the Internet Engineering Task Force (IETF) to ensure traffic engineering over MPLS. However, an actual Connection Admission Control (CAC) implementation inside the resource reservation protocol - traffic engineering extension (RSVP-TE) in MPLS-TE networks does not provide the ability of effective decision making, since the applied threshold CAC lacks of the capability to consider QoS policies on MPLS-TE network nodes. This prevents an effective end-to-end QoS control in a fully dynamic, application driven Label Switched Path (LSP) setup scenario. Current paper presents the practical fuzzy-CAC driven MPLS-TE realization, which is based on the specific implementation of fuzzy-CAC algorithm over an RSVP-TE agent. Fuzzy-CAC implementation is applied to a testbed where a client application requests a real-time data transfer through the MPLS-TE network, which results in dynamic LSP setup and exclusion. The admission control is performed upon service request based on QoS class requirements and network resource availability. The differentiated traffic treatment on per-flow basis is realized through employment of IF-THEN rule based expert knowledge. Effective traffic management is achieved in a best and worst case scenarios and thus, it validates fuzzy-CAC as a candidate for RSVP-TE protocol enhancement for application driven QoS provisioning in MPLS-TE networks and Generalized Multiprotocol Label Switching (GMPLS) networks in the nearest future.
{"title":"Fuzzy-CAC driven MPLS-TE realization","authors":"J. Jelinskis, A. Skrastins, G. Lauks","doi":"10.1109/HPSR.2011.5986018","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986018","url":null,"abstract":"The Multiprotocol Label Switching - Traffic Engineering Extension (MPLS-TE) was introduced by the Internet Engineering Task Force (IETF) to ensure traffic engineering over MPLS. However, an actual Connection Admission Control (CAC) implementation inside the resource reservation protocol - traffic engineering extension (RSVP-TE) in MPLS-TE networks does not provide the ability of effective decision making, since the applied threshold CAC lacks of the capability to consider QoS policies on MPLS-TE network nodes. This prevents an effective end-to-end QoS control in a fully dynamic, application driven Label Switched Path (LSP) setup scenario. Current paper presents the practical fuzzy-CAC driven MPLS-TE realization, which is based on the specific implementation of fuzzy-CAC algorithm over an RSVP-TE agent. Fuzzy-CAC implementation is applied to a testbed where a client application requests a real-time data transfer through the MPLS-TE network, which results in dynamic LSP setup and exclusion. The admission control is performed upon service request based on QoS class requirements and network resource availability. The differentiated traffic treatment on per-flow basis is realized through employment of IF-THEN rule based expert knowledge. Effective traffic management is achieved in a best and worst case scenarios and thus, it validates fuzzy-CAC as a candidate for RSVP-TE protocol enhancement for application driven QoS provisioning in MPLS-TE networks and Generalized Multiprotocol Label Switching (GMPLS) networks in the nearest future.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130148309","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 : 2011-07-04DOI: 10.1109/HPSR.2011.5986001
R. Bolla, R. Bruschi, C. Lombardo, D. Suino
Advanced power management capabilities have been proposed to be included into next-generation green network devices in order to modulate their energy requirements according to the workload. The clear side effect of enabling these new capabilities consists in a performance level reduction of network devices. Starting from some existing benchmarking standards for evaluating energy-efficiency, namely ECR and ATIS-060015, this contribution is devoted to determining a set of parameters, and methodologies that can be applied to correctly and precisely evaluate the tradeoff between energy consumption and network performance. Some experimental results obtained with the proposed indexes and methodologies, as well as a green SW router prototype have been provided.
{"title":"Evaluating the energy-awareness of future Internet devices","authors":"R. Bolla, R. Bruschi, C. Lombardo, D. Suino","doi":"10.1109/HPSR.2011.5986001","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986001","url":null,"abstract":"Advanced power management capabilities have been proposed to be included into next-generation green network devices in order to modulate their energy requirements according to the workload. The clear side effect of enabling these new capabilities consists in a performance level reduction of network devices. Starting from some existing benchmarking standards for evaluating energy-efficiency, namely ECR and ATIS-060015, this contribution is devoted to determining a set of parameters, and methodologies that can be applied to correctly and precisely evaluate the tradeoff between energy consumption and network performance. Some experimental results obtained with the proposed indexes and methodologies, as well as a green SW router prototype have been provided.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115765483","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 : 2011-07-04DOI: 10.1109/HPSR.2011.5986031
Hao Yu, S. Ruepp, M. Berger
This paper proposes two out-of-sequence (OOS) preventative cell dispatching algorithms for the multicast input-queued space-memory-memory (IQ-SMM) Clos-network switch architecture, i.e. the multicast flow-based DSRR (MF-DSRR) and the multicast flow-based round-robin (MFRR). Treating each cell independently, the desynchronized static round-robin (DSRR) cell dispatching scheme can evenly distribute cells to the central switching modules, however, its frequent change of the input switching module connection pattern causes a serious OOS problem to the IQ-SMM architecture. Therefore large reassembly buffers are required at the output ports and high reassembly delay can degrade the multicast services. MF-DSRR can reduce the OOS problem and leverages the principle of DSRR to obtain a low complexity, however it fails to eliminate the in-packet OOS where cells of the same packet are disordered. Using more resources compared to MF-DSRR, MFRR is able to eliminate the in-packet OOS, resulting in a significant reduction of reassembly buffer size and delay.
{"title":"Out-of-sequence preventative cell dispatching for multicast input-queued space-memory-memory Clos-network","authors":"Hao Yu, S. Ruepp, M. Berger","doi":"10.1109/HPSR.2011.5986031","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986031","url":null,"abstract":"This paper proposes two out-of-sequence (OOS) preventative cell dispatching algorithms for the multicast input-queued space-memory-memory (IQ-SMM) Clos-network switch architecture, i.e. the multicast flow-based DSRR (MF-DSRR) and the multicast flow-based round-robin (MFRR). Treating each cell independently, the desynchronized static round-robin (DSRR) cell dispatching scheme can evenly distribute cells to the central switching modules, however, its frequent change of the input switching module connection pattern causes a serious OOS problem to the IQ-SMM architecture. Therefore large reassembly buffers are required at the output ports and high reassembly delay can degrade the multicast services. MF-DSRR can reduce the OOS problem and leverages the principle of DSRR to obtain a low complexity, however it fails to eliminate the in-packet OOS where cells of the same packet are disordered. Using more resources compared to MF-DSRR, MFRR is able to eliminate the in-packet OOS, resulting in a significant reduction of reassembly buffer size and delay.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125491009","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 : 2011-07-04DOI: 10.1109/HPSR.2011.5986011
D. Adami, S. Giordano, M. Pagano, L. G. Zuliani
Wavelength Routed Photonic (or all-optical) Networks (WRPNs) with an intelligent control plane will play a key role in providing the proper ground for future Internet applications. However, classic Routing and Wavelength Assignment (RWA) solutions are inadequate to be adopted by WRPNs. The main issues regard physical impairments and QoT, processing time and setup delay, lightpath (LP) survivability and minimization of resource allocation. In case of critical services provisioning, LPs must have tight QoT guarantees, even in case of network instability and failures. This work presents two new impairment-aware RWA (IA-RWA) algorithms, specifically tailored for the provisioning of critical services. These algorithms guarantee absolute bandwidth and Bit Error Rate (BER) for LPs, assuring survivability in case of single network failures. A high parallelizable, combined RWA engine minimizes resource utilization without increasing setup time. The performance of the proposed algorithms are evaluated with respect to a modified version of a previously proposed IA-RWA algorithm that takes into account QoT and survivability.
{"title":"Online lightpath provisioning and critical services: New IA-RWA algorithms to assure QoT and survivability","authors":"D. Adami, S. Giordano, M. Pagano, L. G. Zuliani","doi":"10.1109/HPSR.2011.5986011","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986011","url":null,"abstract":"Wavelength Routed Photonic (or all-optical) Networks (WRPNs) with an intelligent control plane will play a key role in providing the proper ground for future Internet applications. However, classic Routing and Wavelength Assignment (RWA) solutions are inadequate to be adopted by WRPNs. The main issues regard physical impairments and QoT, processing time and setup delay, lightpath (LP) survivability and minimization of resource allocation. In case of critical services provisioning, LPs must have tight QoT guarantees, even in case of network instability and failures. This work presents two new impairment-aware RWA (IA-RWA) algorithms, specifically tailored for the provisioning of critical services. These algorithms guarantee absolute bandwidth and Bit Error Rate (BER) for LPs, assuring survivability in case of single network failures. A high parallelizable, combined RWA engine minimizes resource utilization without increasing setup time. The performance of the proposed algorithms are evaluated with respect to a modified version of a previously proposed IA-RWA algorithm that takes into account QoT and survivability.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134066897","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 : 2011-07-04DOI: 10.1109/HPSR.2011.5985996
A. Bremler-Barr, Yotam Harchol, David Hay
Deep Packet Inspection (DPI) lies at the core of contemporary Network Intrusion Detection/Prevention Systems and Web Application Firewalls. DPI aims to identify various malware (including spam and viruses) by inspecting both the header and the payload of each packet and comparing it to a known set of patterns. DPI is often performed on the critical path of the packet processing, thus the overall performance of the security tools is dominated by the speed of DPI.
{"title":"Space-time tradeoffs in software-based deep Packet Inspection","authors":"A. Bremler-Barr, Yotam Harchol, David Hay","doi":"10.1109/HPSR.2011.5985996","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5985996","url":null,"abstract":"Deep Packet Inspection (DPI) lies at the core of contemporary Network Intrusion Detection/Prevention Systems and Web Application Firewalls. DPI aims to identify various malware (including spam and viruses) by inspecting both the header and the payload of each packet and comparing it to a known set of patterns. DPI is often performed on the critical path of the packet processing, thus the overall performance of the security tools is dominated by the speed of DPI.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125418445","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 : 2011-07-04DOI: 10.1109/HPSR.2011.5986036
N. Akar, C. Raffaelli, M. Savi
In this paper, a buffer-less shared-per-wavelength optical switch is equipped with multi-fiber interfaces and operated in asynchronous context. An analytical model to evaluate loss performance is proposed using an approximate Markov-chain based approach and the model is validated by simulations. The model is demonstrated to be quite accurate in spite of the difficulty in capturing correlation effects especially for small switch sizes. The model is also applied to calculate the number of optical components needed to design the optical switch according to packet loss requirements. The impact of the adoption of multiple fiber interfaces is outlined in terms of the remarkable saving in the number of wavelength converters employed, while increasing at the same time the number of optical gates needed by the space switching subsystem. The numerical results produced are a valuable basis to optimize overall switch cost.
{"title":"Analytical model of asynchronous shared-per-wavelength multi-fiber optical switch","authors":"N. Akar, C. Raffaelli, M. Savi","doi":"10.1109/HPSR.2011.5986036","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986036","url":null,"abstract":"In this paper, a buffer-less shared-per-wavelength optical switch is equipped with multi-fiber interfaces and operated in asynchronous context. An analytical model to evaluate loss performance is proposed using an approximate Markov-chain based approach and the model is validated by simulations. The model is demonstrated to be quite accurate in spite of the difficulty in capturing correlation effects especially for small switch sizes. The model is also applied to calculate the number of optical components needed to design the optical switch according to packet loss requirements. The impact of the adoption of multiple fiber interfaces is outlined in terms of the remarkable saving in the number of wavelength converters employed, while increasing at the same time the number of optical gates needed by the space switching subsystem. The numerical results produced are a valuable basis to optimize overall switch cost.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125220669","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 : 2011-07-04DOI: 10.1109/HPSR.2011.5986034
Diego Lucerna, G. Maier, A. Pattavina
We present a novel architecture for strictly non-blocking multistage photonic switches implemented using tunable wavelength converters and arrayed waveguide gratings. Clos networks, studied mostly in electronic domain, are required when the physical switching needs exceed the capacity of the largest feasible single crossbar switch. Unfortunately, straightforward extensions of these networks to the photonic domain show that the switch size has to be severely limited by the coherent crosstalk in each of the AWGs. We describe how recursive Clos networks free of coherent crosstalk can be built taking into account the current physical limitations of arrayed waveguide gratings.
{"title":"AWG-based architecture for optical interconnection in asynchronous systems","authors":"Diego Lucerna, G. Maier, A. Pattavina","doi":"10.1109/HPSR.2011.5986034","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986034","url":null,"abstract":"We present a novel architecture for strictly non-blocking multistage photonic switches implemented using tunable wavelength converters and arrayed waveguide gratings. Clos networks, studied mostly in electronic domain, are required when the physical switching needs exceed the capacity of the largest feasible single crossbar switch. Unfortunately, straightforward extensions of these networks to the photonic domain show that the switch size has to be severely limited by the coherent crosstalk in each of the AWGs. We describe how recursive Clos networks free of coherent crosstalk can be built taking into account the current physical limitations of arrayed waveguide gratings.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129483815","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 : 2011-07-04DOI: 10.1109/HPSR.2011.5986010
L. Tang, Wanjun Huang, M. Razo, Arularasi Sivasankaran, M. Tacca, A. Fumagalli
Multicast transmission offers a bandwidth efficient solution for delivering media content to multiple destinations over the Internet. However, in many existing networks, some (if not all) nodes do not support multicast, i.e., they cannot create multiple outgoing flows with one incoming data flow. In this paper, the authors propose an algorithm for multicast tree computation in networks with multicast incapable nodes. Paths that originate at the source and traversing all destinations are computed first; if such paths cannot be found, destinations are partitioned into subsets and traverse paths are computed over each subset, which is executed recursively until feasible trees can be built based on traverse paths found or no further partition is possible. Two procedures for traverse path computation are presented and their respective advantages are discussed, in terms of both complexity and solution optimality. The algorithm is also shown to be very effective in finding multicast trees even if only a few multicast capable nodes exist in the network.
{"title":"Multicast tree computation in networks with multicast incapable nodes","authors":"L. Tang, Wanjun Huang, M. Razo, Arularasi Sivasankaran, M. Tacca, A. Fumagalli","doi":"10.1109/HPSR.2011.5986010","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986010","url":null,"abstract":"Multicast transmission offers a bandwidth efficient solution for delivering media content to multiple destinations over the Internet. However, in many existing networks, some (if not all) nodes do not support multicast, i.e., they cannot create multiple outgoing flows with one incoming data flow. In this paper, the authors propose an algorithm for multicast tree computation in networks with multicast incapable nodes. Paths that originate at the source and traversing all destinations are computed first; if such paths cannot be found, destinations are partitioned into subsets and traverse paths are computed over each subset, which is executed recursively until feasible trees can be built based on traverse paths found or no further partition is possible. Two procedures for traverse path computation are presented and their respective advantages are discussed, in terms of both complexity and solution optimality. The algorithm is also shown to be very effective in finding multicast trees even if only a few multicast capable nodes exist in the network.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128610618","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 : 2011-07-04DOI: 10.1109/HPSR.2011.5986000
G. Ibáñez, B. Schuymer, Jad Naous, Diego Rivera, Elisa Rojas, J. A. Carral
This paper describes the implementation of ARP-Path (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges, in Linux/Soekris and OpenFlow/NetFPGA platforms. These ARP-based Ethernet Switches rely on the race between the replicas of a standard ARP Request packet flooded over all links, to discover the minimum latency path to the destination host, complemented in the opposite direction by the ARP Reply packet directed to the source host. Implementations show that the protocol is loop free, does not block links, is fully transparent to hosts and neither needs a spanning tree protocol to prevent loops nor a link state protocol to obtain low latency paths. Implementations in Linux and OpenFlow on NetFPGA show inherent robustness and fast reconfiguration. Previous simulations showed a superior performance (throughput and delay) than the Spanning Tree Protocol and similar to shortest path routing, with lower complexity.
{"title":"Implementation of ARP-path low latency bridges in Linux and OpenFlow/NetFPGA","authors":"G. Ibáñez, B. Schuymer, Jad Naous, Diego Rivera, Elisa Rojas, J. A. Carral","doi":"10.1109/HPSR.2011.5986000","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986000","url":null,"abstract":"This paper describes the implementation of ARP-Path (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges, in Linux/Soekris and OpenFlow/NetFPGA platforms. These ARP-based Ethernet Switches rely on the race between the replicas of a standard ARP Request packet flooded over all links, to discover the minimum latency path to the destination host, complemented in the opposite direction by the ARP Reply packet directed to the source host. Implementations show that the protocol is loop free, does not block links, is fully transparent to hosts and neither needs a spanning tree protocol to prevent loops nor a link state protocol to obtain low latency paths. Implementations in Linux and OpenFlow on NetFPGA show inherent robustness and fast reconfiguration. Previous simulations showed a superior performance (throughput and delay) than the Spanning Tree Protocol and similar to shortest path routing, with lower complexity.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132735410","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 : 2011-07-04DOI: 10.1109/HPSR.2011.5986027
Badreddine Guizani, B. Ayeb, A. Koukam
Scalability is one of critical challenges for link-state routing protocols in mobile wireless networks. In this context, this paper proposes a proactive link-state protocol based on hierarchical clustering named L-HCLSR. The proposed protocol makes use of clustering algorithm to partition the network and to create a L-levels hierarchical structure of clusters. It uses the structure of clusters to create a virtual backbone useful to broadcast control messages in the entire network. Clustering and virtual structure are used to reduce the routing overhead. Besides, fish eye technique is used to more reduce the routing overhead. We study through simulations the performances of our protocol L-HCLSR with number of level L=1 and L=2, and we compare it to SA-OLSR and F-OLSR protocols. Simulations show that our protocol provides comparable or better performances.
{"title":"Hierarchical cluster-based link state routing protocol for large self-organizing networks","authors":"Badreddine Guizani, B. Ayeb, A. Koukam","doi":"10.1109/HPSR.2011.5986027","DOIUrl":"https://doi.org/10.1109/HPSR.2011.5986027","url":null,"abstract":"Scalability is one of critical challenges for link-state routing protocols in mobile wireless networks. In this context, this paper proposes a proactive link-state protocol based on hierarchical clustering named L-HCLSR. The proposed protocol makes use of clustering algorithm to partition the network and to create a L-levels hierarchical structure of clusters. It uses the structure of clusters to create a virtual backbone useful to broadcast control messages in the entire network. Clustering and virtual structure are used to reduce the routing overhead. Besides, fish eye technique is used to more reduce the routing overhead. We study through simulations the performances of our protocol L-HCLSR with number of level L=1 and L=2, and we compare it to SA-OLSR and F-OLSR protocols. Simulations show that our protocol provides comparable or better performances.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131997815","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
扫码关注我们
求助内容：
应助结果提醒方式：