Traffic grooming is the technique which combines low-bandwidth traffics into higher-bandwidth channels in order to satisfy certain constraints as to maximize the traffic throughput, minimize the connection-blocking probability, or optimize the wavelength bandwidth exploitation. A case considered in this paper is optimization of the multiplexing of customer services into bursts at the edge nodes of an optical network. This is formulated as an integer linear program and dealt with basing on the Hopfield network. The methods based on neural networks, normally require a considerable delay which is hard to practice for optical data transport. This paper also proposes solutions to reduce this delay.
{"title":"Optimization of services-into-burst multiplexing based on Hopfield network","authors":"Viet Minh Nhat Vo, A. Obaid, P. Poirier","doi":"10.1109/ICW.2005.65","DOIUrl":"https://doi.org/10.1109/ICW.2005.65","url":null,"abstract":"Traffic grooming is the technique which combines low-bandwidth traffics into higher-bandwidth channels in order to satisfy certain constraints as to maximize the traffic throughput, minimize the connection-blocking probability, or optimize the wavelength bandwidth exploitation. A case considered in this paper is optimization of the multiplexing of customer services into bursts at the edge nodes of an optical network. This is formulated as an integer linear program and dealt with basing on the Hopfield network. The methods based on neural networks, normally require a considerable delay which is hard to practice for optical data transport. This paper also proposes solutions to reduce this delay.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130325280","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}
Ad hoc and wireless sensor networks have recently emerged as successful technologies in a number of application domains. The need to build security services into them remains however a considerable challenge as the hardware used often shows serious processing and energy limitations. This work evaluates the impact of a number of security mechanism on sensor nodes and the network as a whole. Hence a number of actual measurements were undertaken in a real sensor platform in order to accurately establish energy consumption for various encryption algorithms; as well the baseline scenario obtained when none of these is used. Measurements have shown that integrity code length added to application messages using some cryptography algorithms and MAC (message authentication code) is acceptable for a sensor node with 128 kB of ROM memory and 4 kB of RAM (MICA2). We also were able to check that power consumption of the encryption process does not in itself cause representative impact, since it is in the micro-joules range.
{"title":"Evaluation of security mechanisms in wireless sensor networks","authors":"Germano Guimarães, E. Souto, D. Sadok, J. Kelner","doi":"10.1109/ICW.2005.47","DOIUrl":"https://doi.org/10.1109/ICW.2005.47","url":null,"abstract":"Ad hoc and wireless sensor networks have recently emerged as successful technologies in a number of application domains. The need to build security services into them remains however a considerable challenge as the hardware used often shows serious processing and energy limitations. This work evaluates the impact of a number of security mechanism on sensor nodes and the network as a whole. Hence a number of actual measurements were undertaken in a real sensor platform in order to accurately establish energy consumption for various encryption algorithms; as well the baseline scenario obtained when none of these is used. Measurements have shown that integrity code length added to application messages using some cryptography algorithms and MAC (message authentication code) is acceptable for a sensor node with 128 kB of ROM memory and 4 kB of RAM (MICA2). We also were able to check that power consumption of the encryption process does not in itself cause representative impact, since it is in the micro-joules range.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127482549","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}
The paper proposes a multi-path routing algorithm to guarantee the bandwidth QoS requirements of point to multipoint (P2MP) virtual private LAN services (VPLS). The probability to find a single feasible path which satisfies a VPLS bandwidth requirement is low for connection requests with large bandwidth constraint requirements or when the network is congested Thus, the proposed algorithm divides the required constraint into sub-constraints and finds the minimum number of optimum P2MP paths that meet the sub-constraint requirement. Most of the work in the area of multi-path routing is focused on partitioning the traffic among multiple point to point (P2P) paths. The traffic is partitioned to reduce the network congestion or to adaptively balance the load among multiple paths based on the network status. The novelty of the proposed algorithm is that the algorithm finds the minimum number of paths that satisfy certain bandwidth QoS constraint. Additionally, the multi-path route is calculated to avoid the critical links of other ingress routers and balances the load by choosing paths with maximum residual bandwidth. The proposed algorithm performance is validated using extensive simulation. The results show that the algorithm is capable of increasing the number of admitted requests and improve the network resource utilization by avoiding critical links and choosing paths with maximum residual bandwidth.
{"title":"Multi-path traffic engineering distributed VPLS routing algorithm","authors":"N. Abuali, H. Mouftah, S. Gazor","doi":"10.1109/ICW.2005.58","DOIUrl":"https://doi.org/10.1109/ICW.2005.58","url":null,"abstract":"The paper proposes a multi-path routing algorithm to guarantee the bandwidth QoS requirements of point to multipoint (P2MP) virtual private LAN services (VPLS). The probability to find a single feasible path which satisfies a VPLS bandwidth requirement is low for connection requests with large bandwidth constraint requirements or when the network is congested Thus, the proposed algorithm divides the required constraint into sub-constraints and finds the minimum number of optimum P2MP paths that meet the sub-constraint requirement. Most of the work in the area of multi-path routing is focused on partitioning the traffic among multiple point to point (P2P) paths. The traffic is partitioned to reduce the network congestion or to adaptively balance the load among multiple paths based on the network status. The novelty of the proposed algorithm is that the algorithm finds the minimum number of paths that satisfy certain bandwidth QoS constraint. Additionally, the multi-path route is calculated to avoid the critical links of other ingress routers and balances the load by choosing paths with maximum residual bandwidth. The proposed algorithm performance is validated using extensive simulation. The results show that the algorithm is capable of increasing the number of admitted requests and improve the network resource utilization by avoiding critical links and choosing paths with maximum residual bandwidth.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"56 35","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120933391","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}
Wireless sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing protocols have been specifically designed for WSNs where energy awareness is an essential design issue. Routing protocols in WSNs might differ depending on the application and network architecture. In this article, a fault-tolerant and energy efficient routing protocol for wireless sensor networks is proposed. This protocol is called directed flooding, and is a descendant of the flooding routing protocol, which consumes less energy, while maintaining high levels of fault-tolerance. This is done by sending data in a specific aperture instead of broadcasting, which is used in the traditional flooding algorithm. A simulation of this protocol was performed. The results of simulation are presented and analyzed.
{"title":"Directed flooding: a fault-tolerant routing protocol for wireless sensor networks","authors":"R. Farivar, M. Fazeli, S. Miremadi","doi":"10.1109/ICW.2005.41","DOIUrl":"https://doi.org/10.1109/ICW.2005.41","url":null,"abstract":"Wireless sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing protocols have been specifically designed for WSNs where energy awareness is an essential design issue. Routing protocols in WSNs might differ depending on the application and network architecture. In this article, a fault-tolerant and energy efficient routing protocol for wireless sensor networks is proposed. This protocol is called directed flooding, and is a descendant of the flooding routing protocol, which consumes less energy, while maintaining high levels of fault-tolerance. This is done by sending data in a specific aperture instead of broadcasting, which is used in the traditional flooding algorithm. A simulation of this protocol was performed. The results of simulation are presented and analyzed.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121290860","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}
Real-time multimedia is typically associated with various quality of service (QoS) requirements. Several QoS routing schemes have been proposed to determine a path which has sufficient bandwidth to achieve the desired QoS requirements. Some of these schemes flood nodes with advertisements to obtain information about congestion on the links. Consequently, protocol overhead is of concern in such cases. Other schemes use source routing to determine the shortest routing path, but security is a major concern for allowing source routing in the Internet. To efficiently support QoS over IP networks, traffic engineering (TE) has introduced multiprotocol label switching (MPLS). QoS routing is an essential component of MPLS to maximize network resources. In this paper, we propose an approach that sets up a label switched path (LSP) based on the lowest time delay from the ingress to the egress router using only the ingress, rather than requiring all the nodes in the network to exchange information. Our simulation results show that with our proposed approach, we obtain an improvement in the number of packets delivered and better use of network resources. Furthermore, modification of the MPLS domain is not required.
实时多媒体通常与各种服务质量(QoS)需求相关联。已经提出了几种QoS路由方案，以确定具有足够带宽的路径来实现期望的QoS要求。其中一些方案向节点发送大量广告，以获取链路上的拥塞信息。因此，在这种情况下，协议开销是值得关注的。其他方案使用源路由来确定最短的路由路径，但是在Internet中允许源路由时，安全性是一个主要问题。为了有效地支持IP网络的QoS, TE (traffic engineering)引入了MPLS (multiprotocol label switching)技术。QoS路由是MPLS实现网络资源最大化的重要组成部分。本文提出了一种基于最小时延的标签交换路径(label switched path, LSP)的方法，该方法不需要网络中的所有节点交换信息，而只使用入口路由器。仿真结果表明，采用本文提出的方法，可以提高数据包的传输数量，更好地利用网络资源。不需要修改MPLS域。
{"title":"QoS path selection exploiting minimum link delays in MPLS-based networks","authors":"S. Fowler, S. Zeadally, Farhan Siddiqui","doi":"10.1109/ICW.2005.70","DOIUrl":"https://doi.org/10.1109/ICW.2005.70","url":null,"abstract":"Real-time multimedia is typically associated with various quality of service (QoS) requirements. Several QoS routing schemes have been proposed to determine a path which has sufficient bandwidth to achieve the desired QoS requirements. Some of these schemes flood nodes with advertisements to obtain information about congestion on the links. Consequently, protocol overhead is of concern in such cases. Other schemes use source routing to determine the shortest routing path, but security is a major concern for allowing source routing in the Internet. To efficiently support QoS over IP networks, traffic engineering (TE) has introduced multiprotocol label switching (MPLS). QoS routing is an essential component of MPLS to maximize network resources. In this paper, we propose an approach that sets up a label switched path (LSP) based on the lowest time delay from the ingress to the egress router using only the ingress, rather than requiring all the nodes in the network to exchange information. Our simulation results show that with our proposed approach, we obtain an improvement in the number of packets delivered and better use of network resources. Furthermore, modification of the MPLS domain is not required.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127038060","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}
Most sensor network applications require quality of service guarantees on a network-wide basis, suggesting the need for global network cost optimization. The dynamic and nonuniform local states of individual nodes in sensor networks complicate global cost optimization. Here, we present an approach for optimizing global cost in sensor networks through greedy local decisions at each node, and we explore the benefits of this approach in reducing the idle listening at individual nodes in order to reduce the global network energy cost. We consider two representations for the local sensor node state: (1) number of descendants in the routing tree: and (2) number of descendants and duty cycle. For both state representations, we show through experiments on a testbed of 14 mica2 sensor nodes running ALPL that enabling nodes to set their listening mode according to their local state reduces global energy cost by 35% and provides more balanced energy consumption over the case of BMAC.
{"title":"State-driven energy optimization in wireless sensor networks","authors":"R. Jurdak, P. Baldi, C. Lopes","doi":"10.1109/ICW.2005.76","DOIUrl":"https://doi.org/10.1109/ICW.2005.76","url":null,"abstract":"Most sensor network applications require quality of service guarantees on a network-wide basis, suggesting the need for global network cost optimization. The dynamic and nonuniform local states of individual nodes in sensor networks complicate global cost optimization. Here, we present an approach for optimizing global cost in sensor networks through greedy local decisions at each node, and we explore the benefits of this approach in reducing the idle listening at individual nodes in order to reduce the global network energy cost. We consider two representations for the local sensor node state: (1) number of descendants in the routing tree: and (2) number of descendants and duty cycle. For both state representations, we show through experiments on a testbed of 14 mica2 sensor nodes running ALPL that enabling nodes to set their listening mode according to their local state reduces global energy cost by 35% and provides more balanced energy consumption over the case of BMAC.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116327251","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}
In conventional RWA algorithms the shorter lightpaths fragment the available wavelengths resulting in a higher blocking probability for longer hopcount lightpaths. In this paper we study a novel routing algorithm, which uses traffic classification to classify different hop count connection requests to provide fairness among short and long hop count traffic requests. Also our routing algorithm uses the link criticality information which is related to the number of available wavelengths on a link to provide load balancing over all the links in a network.
{"title":"A novel fairness based criticality avoidance routing algorithm for wavelength routed optical networks","authors":"S. Pramod, S. Siddiqui, H. Mouftah","doi":"10.1109/ICW.2005.14","DOIUrl":"https://doi.org/10.1109/ICW.2005.14","url":null,"abstract":"In conventional RWA algorithms the shorter lightpaths fragment the available wavelengths resulting in a higher blocking probability for longer hopcount lightpaths. In this paper we study a novel routing algorithm, which uses traffic classification to classify different hop count connection requests to provide fairness among short and long hop count traffic requests. Also our routing algorithm uses the link criticality information which is related to the number of available wavelengths on a link to provide load balancing over all the links in a network.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116156167","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}
In inter-connected optical networks, users submit lightpath requests at the time they wish to establish the lightpath. The service provider consults the information gathered by the inter-domain routing protocols for available resources. For each request, the network must decide immediately whether to accept or reject the request. In this model, there is always the uncertainty of whether the user will be able to establish the desired lightpath at the desired time or not. Furthermore, in the context of a number of applications, e.g., Grid applications, users need to setup lightpaths in advance to perform their activities that are planned in advance. In this paper, we propose a scheme that allows the setup of inter-domain lightpaths in advance; it extends the Optical Routing Border Gateway Protocol (ORBGP) to get information about inter-domain paths and availability of wavelengths over a certain period of time in the future. One of the key innovations of the scheme is that it provides the user with alternatives, carefully selected, when his/her request cannot be accommodated because of resources shortage.
{"title":"Optical routing border gateway protocol-based advance lightpath setup","authors":"A. Hafid, A. Maach, M. Khair, J. Drissi","doi":"10.1109/ICW.2005.63","DOIUrl":"https://doi.org/10.1109/ICW.2005.63","url":null,"abstract":"In inter-connected optical networks, users submit lightpath requests at the time they wish to establish the lightpath. The service provider consults the information gathered by the inter-domain routing protocols for available resources. For each request, the network must decide immediately whether to accept or reject the request. In this model, there is always the uncertainty of whether the user will be able to establish the desired lightpath at the desired time or not. Furthermore, in the context of a number of applications, e.g., Grid applications, users need to setup lightpaths in advance to perform their activities that are planned in advance. In this paper, we propose a scheme that allows the setup of inter-domain lightpaths in advance; it extends the Optical Routing Border Gateway Protocol (ORBGP) to get information about inter-domain paths and availability of wavelengths over a certain period of time in the future. One of the key innovations of the scheme is that it provides the user with alternatives, carefully selected, when his/her request cannot be accommodated because of resources shortage.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130780938","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}
To improve the anomaly intrusion detection system using system calls, this study focuses on neuro-fuzzy learning using the Soundex algorithm which is designed to change feature selection and variable length data into a fixed length learning pattern. That is, by changing variable length sequential system call data into a fixed length behavior pattern using the Soundex algorithm, this study conducted backpropagation neural networks with fuzzy membership function. The neuro-fuzzy and N-gram techniques are applied for anomaly intrusion detection of system calls using sendmail data of UNM to demonstrate its performance.
{"title":"Host anomaly detection performance analysis based on system call of neuro-fuzzy using Soundex algorithm and N-gram technique","authors":"Byung-Rae Cha","doi":"10.1109/ICW.2005.49","DOIUrl":"https://doi.org/10.1109/ICW.2005.49","url":null,"abstract":"To improve the anomaly intrusion detection system using system calls, this study focuses on neuro-fuzzy learning using the Soundex algorithm which is designed to change feature selection and variable length data into a fixed length learning pattern. That is, by changing variable length sequential system call data into a fixed length behavior pattern using the Soundex algorithm, this study conducted backpropagation neural networks with fuzzy membership function. The neuro-fuzzy and N-gram techniques are applied for anomaly intrusion detection of system calls using sendmail data of UNM to demonstrate its performance.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129047510","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}
The random access channel (RACH) in OFDMA systems is an uplink contention-based transport channel that is mainly used for subscriber stations to make a resource request to base stations. In this paper we focus on analyzing the performance of RACH in OFDMA systems such that the successful transmission probability, correctly detectable probability and throughput of RACH are analyzed. We also choose an access mechanism with binary exponential backoff delay procedure similar to that in IEEE 802.11. Based on the mechanism, we derive the delay and the blocking probability of RACH in OFDMA systems.
{"title":"Performance analysis of random access channel in OFDMA systems","authors":"Insoo Koo, Seokjoo Shin, Kiseon Kim","doi":"10.1109/ICW.2005.66","DOIUrl":"https://doi.org/10.1109/ICW.2005.66","url":null,"abstract":"The random access channel (RACH) in OFDMA systems is an uplink contention-based transport channel that is mainly used for subscriber stations to make a resource request to base stations. In this paper we focus on analyzing the performance of RACH in OFDMA systems such that the successful transmission probability, correctly detectable probability and throughput of RACH are analyzed. We also choose an access mechanism with binary exponential backoff delay procedure similar to that in IEEE 802.11. Based on the mechanism, we derive the delay and the blocking probability of RACH in OFDMA systems.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125044265","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
扫码关注我们
求助内容：
应助结果提醒方式：