Recently, many explicit multicast schemes have been proposed to serve a very large number of low to fairly moderate size multicast groups in a scalable manner. In this paper, we discuss the design trade-offs of these protocols both through simulation experiments and real-trees analysis. Our metrics for comparison are the header size and processing overheads. We also introduce a modification to ERM (explicit route multicast), called Bcast (branch cast), which removes some inefficiencies of ERM and reduces its size overhead. In Bcast, sender host generates the tree description code(s) and inserts it into header of multicast data packets. The code contains the IP addresses of all receivers and branching points of the tree. Bcast has a proactive bypassing mechanism which helps it to adjust the code size in response to inconvenient distribution of the receivers.
{"title":"On the efficiency of explicit multicast routing protocols","authors":"M. Mohammadi, N. Yazdani, S. Samadian-Barzoki","doi":"10.1109/ISCC.2005.112","DOIUrl":"https://doi.org/10.1109/ISCC.2005.112","url":null,"abstract":"Recently, many explicit multicast schemes have been proposed to serve a very large number of low to fairly moderate size multicast groups in a scalable manner. In this paper, we discuss the design trade-offs of these protocols both through simulation experiments and real-trees analysis. Our metrics for comparison are the header size and processing overheads. We also introduce a modification to ERM (explicit route multicast), called Bcast (branch cast), which removes some inefficiencies of ERM and reduces its size overhead. In Bcast, sender host generates the tree description code(s) and inserts it into header of multicast data packets. The code contains the IP addresses of all receivers and branching points of the tree. Bcast has a proactive bypassing mechanism which helps it to adjust the code size in response to inconvenient distribution of the receivers.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131614217","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}
Expedited forwarding (EF) is the differentiated services class of service that provides high quality transmission with node bounded delay. Nevertheless, in order to obtain a bounded network delay it is necessary to compute a route that meets the required end-to-end delay. Therefore, we study the requirements (bandwidth, buffer and delay) for a new EF connection. As detailed in the paper, with these constraints the routing algorithm is a NP-complete problem. Therefore, we present an efficient routing scheme that has low polynomial computational cost. Finally, the evaluation of this routing shows that is as efficient as using the exact routing algorithm.
EF (Expedited forwarding)是一种具有节点有限延迟的高质量传输的差异化服务类别。然而，为了获得有界的网络延迟，有必要计算一条满足端到端延迟要求的路由。因此，我们研究了一个新的EF连接的需求(带宽、缓冲和延迟)。如文中所述，在这些约束条件下，路由算法是一个np完全问题。因此，我们提出了一种具有低多项式计算成本的高效路由方案。最后，对该路由算法的评估表明，该算法与使用精确路由算法一样有效。
{"title":"Efficient QoS routing for differentiated services EF flows","authors":"Enrique Hernández-Orallo, Joan Vila i Carbó","doi":"10.1109/ISCC.2005.60","DOIUrl":"https://doi.org/10.1109/ISCC.2005.60","url":null,"abstract":"Expedited forwarding (EF) is the differentiated services class of service that provides high quality transmission with node bounded delay. Nevertheless, in order to obtain a bounded network delay it is necessary to compute a route that meets the required end-to-end delay. Therefore, we study the requirements (bandwidth, buffer and delay) for a new EF connection. As detailed in the paper, with these constraints the routing algorithm is a NP-complete problem. Therefore, we present an efficient routing scheme that has low polynomial computational cost. Finally, the evaluation of this routing shows that is as efficient as using the exact routing algorithm.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128140461","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 aim of traffic engineering is to optimise network resource utilization. Although several works on minimizing network resource utilization have been published, few works have focused on LSR label space. This paper proposes an algorithm that uses MPLS label stack features in order to reduce the number of labels used in LSPs forwarding. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The algorithm described sets up the NHLFE tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the algorithm achieves a large reduction factor in the label space. The work presented here applies for both types of connections: P2MP and P2P.
{"title":"A label space reduction algorithm for P2MP LSPs using asymmetric tunnels","authors":"F. S. Donado, R. Fabregat, Y. Donoso, J. Marzo","doi":"10.1109/ISCC.2005.13","DOIUrl":"https://doi.org/10.1109/ISCC.2005.13","url":null,"abstract":"The aim of traffic engineering is to optimise network resource utilization. Although several works on minimizing network resource utilization have been published, few works have focused on LSR label space. This paper proposes an algorithm that uses MPLS label stack features in order to reduce the number of labels used in LSPs forwarding. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The algorithm described sets up the NHLFE tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the algorithm achieves a large reduction factor in the label space. The work presented here applies for both types of connections: P2MP and P2P.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124616911","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}
A new scheme for deploying multicasting in MPLS networks is proposed. Each possible tree in an MPLS network is assigned a number, which is then used to classify the corresponding multicast session into its FEC. We call this approach tree numbering (TN). It provides the capability to aggregate different multicast flows (sessions) having the same tree "shape". The assigned number is calculated distributedly by adding the partial weight values generated by the LSRs and the ingress LER of the corresponding tree. The key point in our approach is that the assigned numbers needed to distinguish the "shapes" of all the possible trees depend on the number of possible egress LERs could be reached by that ingress LERs and not on the number of the LSRs (core routers). In terms of the memory size, the proposed approach outperforms the approach that stores the IP addresses of the multicast tree or the one that store the concatenation of the sub codes generated by the ingress LER and the LSRs.
{"title":"Deploying multicast communication over MPLS networks using tree numbering","authors":"O. Banimelhem, J. Atwood, A. Agarwal","doi":"10.1109/ISCC.2005.47","DOIUrl":"https://doi.org/10.1109/ISCC.2005.47","url":null,"abstract":"A new scheme for deploying multicasting in MPLS networks is proposed. Each possible tree in an MPLS network is assigned a number, which is then used to classify the corresponding multicast session into its FEC. We call this approach tree numbering (TN). It provides the capability to aggregate different multicast flows (sessions) having the same tree \"shape\". The assigned number is calculated distributedly by adding the partial weight values generated by the LSRs and the ingress LER of the corresponding tree. The key point in our approach is that the assigned numbers needed to distinguish the \"shapes\" of all the possible trees depend on the number of possible egress LERs could be reached by that ingress LERs and not on the number of the LSRs (core routers). In terms of the memory size, the proposed approach outperforms the approach that stores the IP addresses of the multicast tree or the one that store the concatenation of the sub codes generated by the ingress LER and the LSRs.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125277411","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}
Power efficient topologies in an ad-hoc network can reduce battery usage and increase the lifetime of a network. Topology control algorithms including a local minimum spanning tree (LMST), distributed relative neighbourhood graph (DRNG) and K-Neigh graphs are computed by using the location or the distance information of the network nodes. Inaccurate distance or location information can lead to disconnected topology graphs. Furthermore, a distance based topology graph may not necessarily be connected due to wireless signal attenuation and propagation characteristics. In a realistic scenario, a small link distance may correspond to a large transmission power as the signal may need to transverse through obstacles. Hence it is imperative to include the environment characteristics when generating power efficient connected topology graphs. In this paper we identify the topology construction procedures that may lead to disconnected network topologies. We propose a new procedure that can work in conjunction with the neighbour discovery protocol to provide a better connected and power efficient network topology. Simulations indicate that the proposed algorithm provides a significant improvement in the connectivity of power base DRNG graphs.
{"title":"Power efficient connected topologies in ad-hoc networks","authors":"G. Srivastava, J. Chicharo, P. Boustead","doi":"10.1109/ISCC.2005.124","DOIUrl":"https://doi.org/10.1109/ISCC.2005.124","url":null,"abstract":"Power efficient topologies in an ad-hoc network can reduce battery usage and increase the lifetime of a network. Topology control algorithms including a local minimum spanning tree (LMST), distributed relative neighbourhood graph (DRNG) and K-Neigh graphs are computed by using the location or the distance information of the network nodes. Inaccurate distance or location information can lead to disconnected topology graphs. Furthermore, a distance based topology graph may not necessarily be connected due to wireless signal attenuation and propagation characteristics. In a realistic scenario, a small link distance may correspond to a large transmission power as the signal may need to transverse through obstacles. Hence it is imperative to include the environment characteristics when generating power efficient connected topology graphs. In this paper we identify the topology construction procedures that may lead to disconnected network topologies. We propose a new procedure that can work in conjunction with the neighbour discovery protocol to provide a better connected and power efficient network topology. Simulations indicate that the proposed algorithm provides a significant improvement in the connectivity of power base DRNG graphs.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121836196","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 supervisor learning neural networks 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 neural learning by using a backpropagation algorithm. The proposed method and N-gram technique are applied for anomaly intrusion detection of system call using sendmail data of UNM to demonstrate its performance.
{"title":"Anomaly intrusion detection for system call using the soundex algorithm and neural networks","authors":"Byung-Rae Cha, B. Vaidya, Seung-Jo Han","doi":"10.1109/ISCC.2005.33","DOIUrl":"https://doi.org/10.1109/ISCC.2005.33","url":null,"abstract":"To improve the anomaly intrusion detection system using system calls, this study focuses on supervisor learning neural networks 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 neural learning by using a backpropagation algorithm. The proposed method and N-gram technique are applied for anomaly intrusion detection of system call using sendmail data of UNM to demonstrate its performance.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116819129","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}
Sensor networks consist of autonomous nodes with limited battery and of base stations with theoretical infinite energy. Nodes can be sleep to extend the lifespan of the network without compromising neither area coverage nor network connectivity. This paper addresses the area coverage problem with equal sensing and communicating radii. The goal is to minimize the number of active sensors involved in coverage task, while computing a connected set able to report to monitoring stations. Our solution is fully localized, and each sensor is able to make decision on whether to sleep or to be active based on two messages sent by each sensor. The first message is a "hello" message to gather position of all neighboring nodes. Then each node computes its own relay area dominating set, by taking the furthest neighbor as the first node, and then adding neighbors farthest to the isobarycenter of already selected neighbors, until the area covered by neighbors is fully covered. The second message broadcasts this relay set to neighbors. Each node decides to be active if it has highest priority among its neighbors or is a relay node for its neighbor with the highest priority.
{"title":"Preserving area coverage in wireless sensor networks by using surface coverage relay dominating sets","authors":"J. Carle, A. Gallais, D. Simplot-Ryl","doi":"10.1109/ISCC.2005.126","DOIUrl":"https://doi.org/10.1109/ISCC.2005.126","url":null,"abstract":"Sensor networks consist of autonomous nodes with limited battery and of base stations with theoretical infinite energy. Nodes can be sleep to extend the lifespan of the network without compromising neither area coverage nor network connectivity. This paper addresses the area coverage problem with equal sensing and communicating radii. The goal is to minimize the number of active sensors involved in coverage task, while computing a connected set able to report to monitoring stations. Our solution is fully localized, and each sensor is able to make decision on whether to sleep or to be active based on two messages sent by each sensor. The first message is a \"hello\" message to gather position of all neighboring nodes. Then each node computes its own relay area dominating set, by taking the furthest neighbor as the first node, and then adding neighbors farthest to the isobarycenter of already selected neighbors, until the area covered by neighbors is fully covered. The second message broadcasts this relay set to neighbors. Each node decides to be active if it has highest priority among its neighbors or is a relay node for its neighbor with the highest priority.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115565464","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}
We report an innovative solely optical architecture to implement the centralized wavelength conversion module of the CWC (controlled wavelength conversion) protocol [Papadimitriou, G.I. et al., 1999]. The proposed module was designed to distribute the conversion wavelengths to the corresponding converters in an unbiased manner taking into consideration the information carried by the control wavelength. The design of the optically controlled module is based on the use of optical logic circuits. These optical circuits distribute the available wavelengths by eliminating the need of optical to electronic translation of the network's feedback information and thus reducing drastically processing time. Furthermore, due to the all-optical nature of the network hub the reliability of the system is improved.
我们报告了一种创新的单光学架构，用于实现CWC(可控波长转换)协议的集中波长转换模块[Papadimitriou, G.I. et al.， 1999]。考虑到控制波长所携带的信息，该模块以无偏的方式将转换波长分配给相应的转换器。光控模块的设计是基于光逻辑电路的使用。这些光学电路通过消除网络反馈信息的光学到电子转换的需要来分配可用的波长，从而大大减少了处理时间。此外，由于网络集线器的全光特性，提高了系统的可靠性。
{"title":"An optically controlled module for wavelength conversion circuits","authors":"G. Papadimitriou, A. Miliou, A. Pomportsis","doi":"10.1109/ISCC.2005.31","DOIUrl":"https://doi.org/10.1109/ISCC.2005.31","url":null,"abstract":"We report an innovative solely optical architecture to implement the centralized wavelength conversion module of the CWC (controlled wavelength conversion) protocol [Papadimitriou, G.I. et al., 1999]. The proposed module was designed to distribute the conversion wavelengths to the corresponding converters in an unbiased manner taking into consideration the information carried by the control wavelength. The design of the optically controlled module is based on the use of optical logic circuits. These optical circuits distribute the available wavelengths by eliminating the need of optical to electronic translation of the network's feedback information and thus reducing drastically processing time. Furthermore, due to the all-optical nature of the network hub the reliability of the system is improved.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124528652","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 this paper we propose two algorithms for estimating the task route reliability of mobile agent-based systems (MABS), which are based on the conditions of the underlying computer network. In addition, we propose a third algorithm for generating a random static planning strategy for mobile agents. The complexity of mobile agent network systems makes it hard to obtain the task route reliability of the MABS theoretically; instead we estimate it using Monte Carlo simulation. In this paper, we assume that the MABS consists of a number of independent mobile agents operating simultaneously. The results we have achieved demonstrate the robustness of the proposed algorithms.
{"title":"Estimating the task route reliability of mobile agent-based systems using Monte Carlo simulation","authors":"M. Daoud, Q. Mahmoud","doi":"10.1109/ISCC.2005.66","DOIUrl":"https://doi.org/10.1109/ISCC.2005.66","url":null,"abstract":"In this paper we propose two algorithms for estimating the task route reliability of mobile agent-based systems (MABS), which are based on the conditions of the underlying computer network. In addition, we propose a third algorithm for generating a random static planning strategy for mobile agents. The complexity of mobile agent network systems makes it hard to obtain the task route reliability of the MABS theoretically; instead we estimate it using Monte Carlo simulation. In this paper, we assume that the MABS consists of a number of independent mobile agents operating simultaneously. The results we have achieved demonstrate the robustness of the proposed algorithms.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121039094","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}
D. Macedo, L. H. A. Correia, A. Santos, A. Loureiro, J. Nogueira
Wireless sensor networks are ad hoc networks with severe resource constraints. These constraints preclude the use of traditional ad hoc protocols, and demand optimizations that incur in solutions specific to a class of applications. This article presents PROC, a protocol designed for continuous data dissemination networks, that interacts with the application to establish routes, allowing the application to reconfigure PROC on runtime. A performance evaluation in topologies varying from 50 to 200 nodes showed that PROC increases network lifetime around 7% to 12%, and has higher throughput than EAD and TinyOS Beaconing. Furthermore, PROC presents a softer performance degradation when the number of nodes in the network increases.
{"title":"A pro-active routing protocol for continuous data dissemination in wireless sensor networks","authors":"D. Macedo, L. H. A. Correia, A. Santos, A. Loureiro, J. Nogueira","doi":"10.1109/ISCC.2005.15","DOIUrl":"https://doi.org/10.1109/ISCC.2005.15","url":null,"abstract":"Wireless sensor networks are ad hoc networks with severe resource constraints. These constraints preclude the use of traditional ad hoc protocols, and demand optimizations that incur in solutions specific to a class of applications. This article presents PROC, a protocol designed for continuous data dissemination networks, that interacts with the application to establish routes, allowing the application to reconfigure PROC on runtime. A performance evaluation in topologies varying from 50 to 200 nodes showed that PROC increases network lifetime around 7% to 12%, and has higher throughput than EAD and TinyOS Beaconing. Furthermore, PROC presents a softer performance degradation when the number of nodes in the network increases.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117051478","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
扫码关注我们
求助内容：
应助结果提醒方式：