Application layer multicast (ALM) has been proposed as a promising alternative to the IP multicast due to the difficulties in deploying network layer multicast in an operational network at the Internet scale. However, most of existing application layer multicast approaches build their overlay networks based on simple measurement with the end-to-end delay without considering the physical network topology and IP multicast deploying in local scale on the Internet. Thus, they might suffer some inefficiency such as long join delay, large maintenance overhead, and little flexibility to extend. In this paper we propose a novel hybrid multicast approach named SHM, which combining ALM and IP multicast to achieve ubiquitous multicast delivery. Simulation results show that SHM is able to provide more efficient multicast with less maintenance overhead, higher flexibility and reliability.
{"title":"SHM: Scalable and Backbone Topology-Aware Hybrid Multicast","authors":"Shaofei Lu, Jianxin Wang, Guanzhong Yang, Chao Guo","doi":"10.1109/ICCCN.2007.4317899","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317899","url":null,"abstract":"Application layer multicast (ALM) has been proposed as a promising alternative to the IP multicast due to the difficulties in deploying network layer multicast in an operational network at the Internet scale. However, most of existing application layer multicast approaches build their overlay networks based on simple measurement with the end-to-end delay without considering the physical network topology and IP multicast deploying in local scale on the Internet. Thus, they might suffer some inefficiency such as long join delay, large maintenance overhead, and little flexibility to extend. In this paper we propose a novel hybrid multicast approach named SHM, which combining ALM and IP multicast to achieve ubiquitous multicast delivery. Simulation results show that SHM is able to provide more efficient multicast with less maintenance overhead, higher flexibility and reliability.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122367486","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317797
Kyunghwi Kim, Wonjun Lee
Localization is one of the critical issues on wireless sensor networks. Localization schemes are classified into range-based and range-free according to the method of whether to use range information. In this paper, we propose a novel range-based localization scheme which involves a movement strategy of mobile beacon, called mobile beacon-assisted localization (MBAL). Contrary to many research activities which have been carried out to design localization schemes using mobile beacons only based on random movement method, we consider totally a new scheme providing movement path selection with a low computational complexity. A new range check technique is also adopted into the MBAL as a useful solution to the position-ambiguity problem of bilateration in order to improve the performance of the proposed localization scheme. Simulation results verify that the MBAL impressively achieves energy efficiency because of its mobile beacon based approach using the proposed movement strategy and range check technique.
{"title":"MBAL: A Mobile Beacon-Assisted Localization Scheme for Wireless Sensor Networks","authors":"Kyunghwi Kim, Wonjun Lee","doi":"10.1109/ICCCN.2007.4317797","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317797","url":null,"abstract":"Localization is one of the critical issues on wireless sensor networks. Localization schemes are classified into range-based and range-free according to the method of whether to use range information. In this paper, we propose a novel range-based localization scheme which involves a movement strategy of mobile beacon, called mobile beacon-assisted localization (MBAL). Contrary to many research activities which have been carried out to design localization schemes using mobile beacons only based on random movement method, we consider totally a new scheme providing movement path selection with a low computational complexity. A new range check technique is also adopted into the MBAL as a useful solution to the position-ambiguity problem of bilateration in order to improve the performance of the proposed localization scheme. Simulation results verify that the MBAL impressively achieves energy efficiency because of its mobile beacon based approach using the proposed movement strategy and range check technique.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132628454","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317883
G. Marias, S. Dritsas, M. Theoharidou, John Mallios, D. Gritzalis
Although VoIP provides new ways of communication, at the same time it offers new possibilities for transmitting bulk unsolicited messages and calls, enabling spam over internet telephony (SPIT). The VoIP prevailing protocol is SIP, which it is vulnerable to threats that allow SPIT to be deployed. In this paper we assess the risk of identified threats and vulnerabilities of the SIP protocol. Then, we conduct an analytical survey of already proposed anti-SPIT techniques and we evaluate their effectiveness, in terms of how they deal with the threats and vulnerabilities. Finally, we complete our evaluation by presenting a theoretical evaluation framework, based on additional qualitative and quantitative criteria.
{"title":"SIP Vulnerabilities and Anti-SPIT Mechanisms Assessment","authors":"G. Marias, S. Dritsas, M. Theoharidou, John Mallios, D. Gritzalis","doi":"10.1109/ICCCN.2007.4317883","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317883","url":null,"abstract":"Although VoIP provides new ways of communication, at the same time it offers new possibilities for transmitting bulk unsolicited messages and calls, enabling spam over internet telephony (SPIT). The VoIP prevailing protocol is SIP, which it is vulnerable to threats that allow SPIT to be deployed. In this paper we assess the risk of identified threats and vulnerabilities of the SIP protocol. Then, we conduct an analytical survey of already proposed anti-SPIT techniques and we evaluate their effectiveness, in terms of how they deal with the threats and vulnerabilities. Finally, we complete our evaluation by presenting a theoretical evaluation framework, based on additional qualitative and quantitative criteria.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132520594","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317914
Tsern-Huei Lee
Because of its accuracy, signature matching is considered an important technique in anti-virus/worm applications. Among some famous pattern matching algorithms, the Aho-Corasick (AC) algorithm can match multiple patterns simultaneously and guarantee deterministic performance under all circumstances and thus is widely adopted in various systems, especially when worst-case performance such as wire speed requirement is a design factor. However, the AC algorithm was developed only for strings while virus/worm signatures could be specified by simple regular expressions. In this paper, we generalize the AC algorithm to systematically construct a finite state pattern matching machine which can indicate the ending position in a finite input string for the first occurrence of virus/worm signatures that are specified by strings or simple regular expressions. The regular expressions studied in this paper may contain the following operators: * (match any number of symbols), ? (match any symbol), and {min, max} (match minimum of min, maximum of max symbols), which are defined in ClamAV, a popular open source anti-virus/worm software module, for signature specification.
{"title":"Generalized Aho-Corasick Algorithm for Signature Based Anti-Virus Applications","authors":"Tsern-Huei Lee","doi":"10.1109/ICCCN.2007.4317914","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317914","url":null,"abstract":"Because of its accuracy, signature matching is considered an important technique in anti-virus/worm applications. Among some famous pattern matching algorithms, the Aho-Corasick (AC) algorithm can match multiple patterns simultaneously and guarantee deterministic performance under all circumstances and thus is widely adopted in various systems, especially when worst-case performance such as wire speed requirement is a design factor. However, the AC algorithm was developed only for strings while virus/worm signatures could be specified by simple regular expressions. In this paper, we generalize the AC algorithm to systematically construct a finite state pattern matching machine which can indicate the ending position in a finite input string for the first occurrence of virus/worm signatures that are specified by strings or simple regular expressions. The regular expressions studied in this paper may contain the following operators: * (match any number of symbols), ? (match any symbol), and {min, max} (match minimum of min, maximum of max symbols), which are defined in ClamAV, a popular open source anti-virus/worm software module, for signature specification.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131786387","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317847
Mei Wang, L. Dunn, Wei Mao, Tao Chen
The scalability of Internet addressing and routing has been a serious issue and becomes a more urgent problem today because of driving factors like IPv6. A radical impacting element of the scalability is address allocation, as it directly affects routing table structure, hence, IP lookup and routing efficiency. A key problem in IPv4 today is address fragmentation, i.e., one entity is represented by multiple non-contiguous IP address blocks in the routing table. Address fragmentation increases routing table size, therefore degrades scalability. Existing address allocation practices are a major contributor to address fragmentation. In this paper, we demonstrate that the performance of address allocation can be dramatically improved. We propose a new address allocation algorithm called GAP: Growth-based Address Partitioning. Through real data, we show that GAP can reduce fragmentation by 90% compared to the existing allocation schemes. This is significant for reducing routing table size, increasing scalability, and improving the performance of the Internet. We also introduce a software tool being developed for address allocation.
{"title":"Reduce IP Address Fragmentation through Allocation","authors":"Mei Wang, L. Dunn, Wei Mao, Tao Chen","doi":"10.1109/ICCCN.2007.4317847","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317847","url":null,"abstract":"The scalability of Internet addressing and routing has been a serious issue and becomes a more urgent problem today because of driving factors like IPv6. A radical impacting element of the scalability is address allocation, as it directly affects routing table structure, hence, IP lookup and routing efficiency. A key problem in IPv4 today is address fragmentation, i.e., one entity is represented by multiple non-contiguous IP address blocks in the routing table. Address fragmentation increases routing table size, therefore degrades scalability. Existing address allocation practices are a major contributor to address fragmentation. In this paper, we demonstrate that the performance of address allocation can be dramatically improved. We propose a new address allocation algorithm called GAP: Growth-based Address Partitioning. Through real data, we show that GAP can reduce fragmentation by 90% compared to the existing allocation schemes. This is significant for reducing routing table size, increasing scalability, and improving the performance of the Internet. We also introduce a software tool being developed for address allocation.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131849669","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317900
V. Pappas, V. Hilt, M. Hofmann
Overlay networks are widely used as a way to introduce novel Internet services and to improve the reliability and performance of today's Internet. Traditionally, overlay networks perform routing by mimicking the underlying IP routing protocols, which does not scale well with the system size. In this paper, we propose a fundamentally new approach to overlay routing that is based on network coordinates. Our evaluation shows that this approach is scalable to a large number of overlay nodes with a message complexity of O(N) while providing routing decisions that are close to optimal in terms of error resilience and path delay.
{"title":"Coordinate-Based Routing for Overlay Networks","authors":"V. Pappas, V. Hilt, M. Hofmann","doi":"10.1109/ICCCN.2007.4317900","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317900","url":null,"abstract":"Overlay networks are widely used as a way to introduce novel Internet services and to improve the reliability and performance of today's Internet. Traditionally, overlay networks perform routing by mimicking the underlying IP routing protocols, which does not scale well with the system size. In this paper, we propose a fundamentally new approach to overlay routing that is based on network coordinates. Our evaluation shows that this approach is scalable to a large number of overlay nodes with a message complexity of O(N) while providing routing decisions that are close to optimal in terms of error resilience and path delay.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132189299","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317891
Theodor Richardson, Chin-Tser Huang
Worms are a significant threat to network systems, both through resource consumption and malicious activity. This paper examines the spread of a class of hitlist-based worms that attempt to propagate by searching for address book files on the host system and using the host's mail program to spread to the addresses found. This threat becomes more severe when the worms are assumed to be polymorphic in nature - able to dynamically change their signature to elude capture. Because the method of propagation for these worms is predictable, it is possible to contain their spread through the use of honeytoken e-mail addresses in the client address book. Any e-mail received by the honeytoken address will be immediately recognized as malicious and can therefore be used to flag client machines as infected. This paper provides a complete description of a method to allow for better containment of this class of worms. The results of the proposed method are examined and compared to a previous method of capturing this type of worm.
{"title":"Containing Hitlist-Based Worms with Polymorphic Signatures","authors":"Theodor Richardson, Chin-Tser Huang","doi":"10.1109/ICCCN.2007.4317891","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317891","url":null,"abstract":"Worms are a significant threat to network systems, both through resource consumption and malicious activity. This paper examines the spread of a class of hitlist-based worms that attempt to propagate by searching for address book files on the host system and using the host's mail program to spread to the addresses found. This threat becomes more severe when the worms are assumed to be polymorphic in nature - able to dynamically change their signature to elude capture. Because the method of propagation for these worms is predictable, it is possible to contain their spread through the use of honeytoken e-mail addresses in the client address book. Any e-mail received by the honeytoken address will be immediately recognized as malicious and can therefore be used to flag client machines as infected. This paper provides a complete description of a method to allow for better containment of this class of worms. The results of the proposed method are examined and compared to a previous method of capturing this type of worm.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"115 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113945112","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317801
Kwan-Wu Chin
Deafness is a key problem. It erodes the performance gains provided by directional antennas, and introduces a new hidden terminal problem. To address deafness, and hence the hidden terminal problem, we propose SpotMAC. By exploiting narrow or pencil beams, SpotMAC achieves high spatial reuse, throughput and fairness. In addition, pencil beams simplify the collision avoidance process and constrain the hidden terminal problem to a linear topology which can be solved using an inverse RTS/CTS exchange. From extensive simulation studies, we confirm nodes using SpotMAC have several orders of magnitude higher throughput than those using the IEEE 802.11 MAC with omni-directional antenna.
{"title":"SpotMAC: A Pencil-Beam MAC for Wireless Mesh Networks","authors":"Kwan-Wu Chin","doi":"10.1109/ICCCN.2007.4317801","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317801","url":null,"abstract":"Deafness is a key problem. It erodes the performance gains provided by directional antennas, and introduces a new hidden terminal problem. To address deafness, and hence the hidden terminal problem, we propose SpotMAC. By exploiting narrow or pencil beams, SpotMAC achieves high spatial reuse, throughput and fairness. In addition, pencil beams simplify the collision avoidance process and constrain the hidden terminal problem to a linear topology which can be solved using an inverse RTS/CTS exchange. From extensive simulation studies, we confirm nodes using SpotMAC have several orders of magnitude higher throughput than those using the IEEE 802.11 MAC with omni-directional antenna.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128955774","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317822
O. Turkcu, S. Subramaniam
The blocking performance of limited-reconflgurable all-optical networks is investigated in this paper. Reconfigurability is achieved by reconflgurable optical add-drop multiplexers (ROADMs) and tunable transponders. An analytical model is developed adopting a share-per-node model for the sharing of transponders within a reconfigurable node. The set of wavelengths that can be added/dropped at a reconfigurable node depends on the constraints of ROADMs as well as the (possibly limited or narrowly) tunable transponders. The size of the wavelength set to which a transponder is tunable (tuning range), and the number of transponders are the key parameters that affect the blocking. A lightpath request can be established depending on the transponders' ability to tune to the available wavelengths along the route. We call this constraint as wavelength termination constraint. Both analytical and simulation results show that narrowly tunable transponders achieve a similar performance as widely tunable transponders. The effect of the number of transponders or the number of ports of a ROADM on blocking is also investigated.
{"title":"Blocking Analysis of Limited-Reconfigurable Optical Networks","authors":"O. Turkcu, S. Subramaniam","doi":"10.1109/ICCCN.2007.4317822","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317822","url":null,"abstract":"The blocking performance of limited-reconflgurable all-optical networks is investigated in this paper. Reconfigurability is achieved by reconflgurable optical add-drop multiplexers (ROADMs) and tunable transponders. An analytical model is developed adopting a share-per-node model for the sharing of transponders within a reconfigurable node. The set of wavelengths that can be added/dropped at a reconfigurable node depends on the constraints of ROADMs as well as the (possibly limited or narrowly) tunable transponders. The size of the wavelength set to which a transponder is tunable (tuning range), and the number of transponders are the key parameters that affect the blocking. A lightpath request can be established depending on the transponders' ability to tune to the available wavelengths along the route. We call this constraint as wavelength termination constraint. Both analytical and simulation results show that narrowly tunable transponders achieve a similar performance as widely tunable transponders. The effect of the number of transponders or the number of ports of a ROADM on blocking is also investigated.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128496726","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317779
R. Kahn
All types of information may be structured as digital objects. These may be subject to rights, require privacy or demand security. Some may be inaccessible without permission (eg. Behind firewalls) may move from place to place, or exist at multiple locations. Some may need to be accessible for very long period of time. An overall framework in which to address these issues will be presented and their revelence to network operations and management will be discussed.
{"title":"Managing Digital Objects on the Internet","authors":"R. Kahn","doi":"10.1109/ICCCN.2007.4317779","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317779","url":null,"abstract":"All types of information may be structured as digital objects. These may be subject to rights, require privacy or demand security. Some may be inaccessible without permission (eg. Behind firewalls) may move from place to place, or exist at multiple locations. Some may need to be accessible for very long period of time. An overall framework in which to address these issues will be presented and their revelence to network operations and management will be discussed.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115334506","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
扫码关注我们
求助内容：
应助结果提醒方式：