Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382596
S. Herborn, A. Huber, R. Boreli, A. Seneviratne
We develop a scheme for host identity delegation based on the Host Identity Protocol (HIP). We show how this scheme can be applied to enable the movement of communication sessions between devices e.g. in a Personal Area Network (PAN), or to securely and seamlessly insert any number of service proxies in between session endpoints e.g. to adapt data to suit different devices in a PAN. Identities are securely delegated by relaying HIP signalling messages to the device that owns the private key. This avoids security issues caused by dissemination of private keys. This also ensures that delegated endpoint identities are instantly and permanently revocable by the original device which remains in full control of the private key used to authorize use of the identity. We show that the delegation process introduces minimal additional signalling, and present results of evaluation of a prototype which show the scheme results in no detriment to the performance of HIP.
{"title":"Secure Host Identity Delegation for Mobility","authors":"S. Herborn, A. Huber, R. Boreli, A. Seneviratne","doi":"10.1109/COMSWA.2007.382596","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382596","url":null,"abstract":"We develop a scheme for host identity delegation based on the Host Identity Protocol (HIP). We show how this scheme can be applied to enable the movement of communication sessions between devices e.g. in a Personal Area Network (PAN), or to securely and seamlessly insert any number of service proxies in between session endpoints e.g. to adapt data to suit different devices in a PAN. Identities are securely delegated by relaying HIP signalling messages to the device that owns the private key. This avoids security issues caused by dissemination of private keys. This also ensures that delegated endpoint identities are instantly and permanently revocable by the original device which remains in full control of the private key used to authorize use of the identity. We show that the delegation process introduces minimal additional signalling, and present results of evaluation of a prototype which show the scheme results in no detriment to the performance of HIP.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131145479","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-07-09DOI: 10.1109/COMSWA.2007.382470
I. Rao, N. Imran, Salman Khan, E. Huh, TaeChoong Chung
Integrating grid computing with sensor networks, named as sensor grid, promises immense storage; unmatched computational power and availability of virtually any shareable resource through grid to resource constrained sensor nodes. On the other hand it poses complicated and new challenges such processing SOAP enabled XML messages, compliance with grid security standards. In this research work we first identify service requirements for the sensor grid to efficiently process data using grid technology and then list the challenging issues to meet these requirements. We also propose an end-to-end adaptive and reconfigurable resource manager for wireless sensors (ARROWS) using grid technology to enable resource constrained sensor nodes to connect to the grid.
{"title":"Adaptive and Reconfigurable ResOurce Management for Wireless Sensors using Grid Technology","authors":"I. Rao, N. Imran, Salman Khan, E. Huh, TaeChoong Chung","doi":"10.1109/COMSWA.2007.382470","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382470","url":null,"abstract":"Integrating grid computing with sensor networks, named as sensor grid, promises immense storage; unmatched computational power and availability of virtually any shareable resource through grid to resource constrained sensor nodes. On the other hand it poses complicated and new challenges such processing SOAP enabled XML messages, compliance with grid security standards. In this research work we first identify service requirements for the sensor grid to efficiently process data using grid technology and then list the challenging issues to meet these requirements. We also propose an end-to-end adaptive and reconfigurable resource manager for wireless sensors (ARROWS) using grid technology to enable resource constrained sensor nodes to connect to the grid.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121957000","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-07-09DOI: 10.1109/COMSWA.2007.382592
Sarang Aravamuthan, Viswanatha Rao Thumparthy
The Elliptic Curve Digital Signature Algorithm admits a natural parallelization wherein the point multiplication step can be split in two parts and executed in parallel. Further parallelism is achieved by executing a portion of the multiprecision arithmetic operations in parallel with point multiplication. This results in a saving in timing as well as gate count when the two paths are implemented in hardware and software. This article attempts to exploit this parallelism in a typical system context in which a microprocessor is always present though a hardware accelerator is being designed for performance. We discuss some implementation aspects of this design with reference to power analysis attacks. We show how the Montgomery point multiplication and the binary extended gcd algorithms can be adapted to prevent simple power analysis attacks. We implemented our design using a hardware/software parallel architecture. We present the results when the software component is coded on an 8051 architecture and an ARM7TDMI processor. Our enhancements find applications in security environments such as servers, smart cards etc.
{"title":"A Parallelization of ECDSA Resistant to Simple Power Analysis Attacks","authors":"Sarang Aravamuthan, Viswanatha Rao Thumparthy","doi":"10.1109/COMSWA.2007.382592","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382592","url":null,"abstract":"The Elliptic Curve Digital Signature Algorithm admits a natural parallelization wherein the point multiplication step can be split in two parts and executed in parallel. Further parallelism is achieved by executing a portion of the multiprecision arithmetic operations in parallel with point multiplication. This results in a saving in timing as well as gate count when the two paths are implemented in hardware and software. This article attempts to exploit this parallelism in a typical system context in which a microprocessor is always present though a hardware accelerator is being designed for performance. We discuss some implementation aspects of this design with reference to power analysis attacks. We show how the Montgomery point multiplication and the binary extended gcd algorithms can be adapted to prevent simple power analysis attacks. We implemented our design using a hardware/software parallel architecture. We present the results when the software component is coded on an 8051 architecture and an ARM7TDMI processor. Our enhancements find applications in security environments such as servers, smart cards etc.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116863289","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-07-09DOI: 10.1109/COMSWA.2007.382628
M. V. S. Deekshitulu, Sukumar Nandi, A. Chowdhury
Wireless adhoc networks consist of nodes interconnected by wireless multi-hop communication paths. Such networks exhibit simulated mobility, where the topological changes are caused by nodes coming up or going down. These networks also exhibit complex overlapping of flow paths. This in turn leads to severe contention in between flows as well as between the sub-flows of the same flow. In this paper, we analyze the unfairness of IEEE 802.11, in case it is extended for multi-hop networks. Thereafter we demonstrate how a simple, distributed algorithm can be put in place to approximate an ideal scheduler like round-robin and provide fair access to all the flows. Our simulation results clearly show that such an approach outscores the existing standard on fairness grounds. Additionally we also gain in terms of throughput by reducing the number of collisions.
{"title":"Improving MAC Layer Fairness in Multi-Hop 802.11 Networks","authors":"M. V. S. Deekshitulu, Sukumar Nandi, A. Chowdhury","doi":"10.1109/COMSWA.2007.382628","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382628","url":null,"abstract":"Wireless adhoc networks consist of nodes interconnected by wireless multi-hop communication paths. Such networks exhibit simulated mobility, where the topological changes are caused by nodes coming up or going down. These networks also exhibit complex overlapping of flow paths. This in turn leads to severe contention in between flows as well as between the sub-flows of the same flow. In this paper, we analyze the unfairness of IEEE 802.11, in case it is extended for multi-hop networks. Thereafter we demonstrate how a simple, distributed algorithm can be put in place to approximate an ideal scheduler like round-robin and provide fair access to all the flows. Our simulation results clearly show that such an approach outscores the existing standard on fairness grounds. Additionally we also gain in terms of throughput by reducing the number of collisions.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124863294","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-07-09DOI: 10.1109/COMSWA.2007.382499
D. Shrestha, Young-Bae Ko
This paper deals with the topology formation schemes in the IEEE 802.11 based wireless mesh network. The recent standardization effort for specifying a wireless distribution system based on wireless mesh networking, namely the IEEE 802.11 s Task Group, has proposed the "Simple Channel Unification Protocol" that coalesce all nodes into to a single channel. We show that protocols as such without exposition of the topological information may take more time to converge and have higher message overhead. We propose an enhancement of the existing protocol to reduce message and time required to generate a single unified graph in WLAN-based mesh networks. We performed simulations using the network simulator, ns-2 and compared with the existing solution. The preliminary results show that our scheme performs better in terms of the message overhead as well as the convergence time.
{"title":"Enhanced Topolgoy Formation Protocol for IEEE 802.11 WLAN based Mesh Networks","authors":"D. Shrestha, Young-Bae Ko","doi":"10.1109/COMSWA.2007.382499","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382499","url":null,"abstract":"This paper deals with the topology formation schemes in the IEEE 802.11 based wireless mesh network. The recent standardization effort for specifying a wireless distribution system based on wireless mesh networking, namely the IEEE 802.11 s Task Group, has proposed the \"Simple Channel Unification Protocol\" that coalesce all nodes into to a single channel. We show that protocols as such without exposition of the topological information may take more time to converge and have higher message overhead. We propose an enhancement of the existing protocol to reduce message and time required to generate a single unified graph in WLAN-based mesh networks. We performed simulations using the network simulator, ns-2 and compared with the existing solution. The preliminary results show that our scheme performs better in terms of the message overhead as well as the convergence time.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128704528","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-07-09DOI: 10.1109/COMSWA.2007.382431
Manish Kushwaha, Isaac Amundson, X. Koutsoukos, S. Neema, J. Sztipanovits
Wireless sensor networks consist of small, inexpensive devices which interact with the environment, communicate with each other, and perform distributed computations in order to monitor spatio-temporal phenomena. These devices are ideally suited for a variety of applications including object tracking, environmental monitoring, and homeland security. At present, sensor network technologies do not provide off-the-shelf solutions to users who lack low-level network programming experience. Because of limited resources, ad hoc deployments, and volatile wireless communication links, the development of distributed applications require the combination of both application and system-level logic. Programming frameworks and middleware for traditional distributed computing are not suitable for many of these problems due to the resource constraints and interactions with the physical world. To address these challenges we have developed OASiS, a programming framework that provides abstractions for object-centric, ambient-aware, service-oriented sensor network applications. OASiS uses a well-defined model of computation based on globally asynchronous locally synchronous dataflow, and is complemented by a user-friendly modeling environment. Applications are realized as graphs of modular services and executed in response to the detection of physical phenomena. We have also implemented a suite of middleware services that support OASiS to provide a layer of abstraction shielding the low-level system complexities. A tracking application is used to illustrate the features of OASiS. Our results demonstrate the feasibility and the benefits of a service-oriented programming framework for composing and deploying applications in resource-constrained sensor networks.
{"title":"OASiS: A Programming Framework for Service-Oriented Sensor Networks","authors":"Manish Kushwaha, Isaac Amundson, X. Koutsoukos, S. Neema, J. Sztipanovits","doi":"10.1109/COMSWA.2007.382431","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382431","url":null,"abstract":"Wireless sensor networks consist of small, inexpensive devices which interact with the environment, communicate with each other, and perform distributed computations in order to monitor spatio-temporal phenomena. These devices are ideally suited for a variety of applications including object tracking, environmental monitoring, and homeland security. At present, sensor network technologies do not provide off-the-shelf solutions to users who lack low-level network programming experience. Because of limited resources, ad hoc deployments, and volatile wireless communication links, the development of distributed applications require the combination of both application and system-level logic. Programming frameworks and middleware for traditional distributed computing are not suitable for many of these problems due to the resource constraints and interactions with the physical world. To address these challenges we have developed OASiS, a programming framework that provides abstractions for object-centric, ambient-aware, service-oriented sensor network applications. OASiS uses a well-defined model of computation based on globally asynchronous locally synchronous dataflow, and is complemented by a user-friendly modeling environment. Applications are realized as graphs of modular services and executed in response to the detection of physical phenomena. We have also implemented a suite of middleware services that support OASiS to provide a layer of abstraction shielding the low-level system complexities. A tracking application is used to illustrate the features of OASiS. Our results demonstrate the feasibility and the benefits of a service-oriented programming framework for composing and deploying applications in resource-constrained sensor networks.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128606692","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-07-09DOI: 10.1109/COMSWA.2007.382611
S. Zargar, M. Moghaddam
In this paper we introduced the synthetically generated traffic assignment problem and we proposed conqueror traffic based ranking metrics heuristic method for solving this problem. We modified previous ranking metrics heuristic method and we tried to assign the synthetically generated traffic to a topology based on traffic type. In our work, transmission control protocol (TCP) and user datagram protocol (UDP), as two major traffic types of today's Internet, are considered to generate special traffic matrices for them. By generating special traffic matrices for each type of traffic, traffic matrices may better describe the network conditions and consider the traffic type constraints. We made a comparison between our proposed algorithm and the two previous algorithms, called Load Minimization Solution (LMS) and ranking metrics heuristic (RMH), using simulation and results are presented. Simulation results indicate that our proposed heuristic method performs better in all cases which conqueror traffic (TCP & UDP) exists and correctly identifies more flow rates than the two other algorithms. Moreover, results show that, it is better to use LMS in the case of no conqueror traffic exists. The total absolute error rates between the amount of originally assigned flow rates and the rates that the RMH, LMS, and our conqueror traffic based RMH are assigned is another comparison we made which, proves that our heuristic method assigns the rates much closer to the original rates.
{"title":"A Conqueror Traffic Based Ranking Metrics Heuristic for Assigning Synthetically Generated Traffic Matrices to a Topology","authors":"S. Zargar, M. Moghaddam","doi":"10.1109/COMSWA.2007.382611","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382611","url":null,"abstract":"In this paper we introduced the synthetically generated traffic assignment problem and we proposed conqueror traffic based ranking metrics heuristic method for solving this problem. We modified previous ranking metrics heuristic method and we tried to assign the synthetically generated traffic to a topology based on traffic type. In our work, transmission control protocol (TCP) and user datagram protocol (UDP), as two major traffic types of today's Internet, are considered to generate special traffic matrices for them. By generating special traffic matrices for each type of traffic, traffic matrices may better describe the network conditions and consider the traffic type constraints. We made a comparison between our proposed algorithm and the two previous algorithms, called Load Minimization Solution (LMS) and ranking metrics heuristic (RMH), using simulation and results are presented. Simulation results indicate that our proposed heuristic method performs better in all cases which conqueror traffic (TCP & UDP) exists and correctly identifies more flow rates than the two other algorithms. Moreover, results show that, it is better to use LMS in the case of no conqueror traffic exists. The total absolute error rates between the amount of originally assigned flow rates and the rates that the RMH, LMS, and our conqueror traffic based RMH are assigned is another comparison we made which, proves that our heuristic method assigns the rates much closer to the original rates.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127447943","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-07-09DOI: 10.1109/COMSWA.2007.382600
A. Chowdhury, S. Tripathy, Sukumar Nandi
Wireless sensor networks (WSNs) are best suited for perceiving a phenomenon, which in turn forms the basis for controlling an actuator in a corrective plane. However, before the corrective action can be invoked, it is necessary to validate that the data was not injected with a malicious intent. To this end we propose CADA (cellular automata based data authentication mechanism), a lightweight protocol to authenticate data from valid nodes. Unlike its predecessors, it is designed to assume scarcity of multiple resources viz power, processing, storage, bandwidth and radio range.CADA takes advantage of the concurrent operations in cellular automata components and is therefore not only fast but also easily realizable in hardware.
{"title":"Securing Wireless Sensor Networks Against Spurious Injections","authors":"A. Chowdhury, S. Tripathy, Sukumar Nandi","doi":"10.1109/COMSWA.2007.382600","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382600","url":null,"abstract":"Wireless sensor networks (WSNs) are best suited for perceiving a phenomenon, which in turn forms the basis for controlling an actuator in a corrective plane. However, before the corrective action can be invoked, it is necessary to validate that the data was not injected with a malicious intent. To this end we propose CADA (cellular automata based data authentication mechanism), a lightweight protocol to authenticate data from valid nodes. Unlike its predecessors, it is designed to assume scarcity of multiple resources viz power, processing, storage, bandwidth and radio range.CADA takes advantage of the concurrent operations in cellular automata components and is therefore not only fast but also easily realizable in hardware.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130546342","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-07-09DOI: 10.1109/COMSWA.2007.382440
Srikanth Palla, R. Dantu
Based on the social interactions of an email user, incoming email traffic can be divided into different categories such as, telemarketing, Opt-in family members and friends. Due to a lack of knowledge in the different categories, most of the existing spam filters are prone to high false positives and false negatives. Moreover, a majority of the spammers obfuscate their email content inorder to circumvent the content-based spam filters. However, they do not have access to all the fields in the email header. Our classification method is based on the path traversed by email (instead of content analysis) since we believe that spammers cannot forge all the fields in the email header. We based our classification on three kinds of analyses on the header: i) EndToEnd path analysis, which tries to establish the legitimacy of the path taken by an email and classifies them as either spam or non-spam; ii) Relay analysis, which verifies the trustworthiness of the relays participating in the relaying of emails; iii) Emails wantedness analysis, which measure the recipients wantedness of the senders emails. We use the IMAP message status flags such as, message has been read, deleted, answered, flagged, and draft as an implicit feed back from the user in Emails wantedness analysis. Finally we classify the incoming emails as i) socially close (such as, legitimate emails from family, and friends), ii) socially distinct emails from strangers, iii) spam emails (for example, emails from telemarketers, and spammers) and iv) opt-in emails. Based on the relation between spamminess of the path taken by spam emails and the unwantedness values of the spammers, we classify spammers as i) prospective spammers, ii) suspects, iii) recent spammers and iv) serial spammers. Overall, our method resulted in far less false positives compared to current filters like SpamAssassin. We achieved a precision of 98.65% which is better than the precisions achieved by SPF and DNSBL blacklists.
{"title":"Unwanted SMTP Paths and Relays","authors":"Srikanth Palla, R. Dantu","doi":"10.1109/COMSWA.2007.382440","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382440","url":null,"abstract":"Based on the social interactions of an email user, incoming email traffic can be divided into different categories such as, telemarketing, Opt-in family members and friends. Due to a lack of knowledge in the different categories, most of the existing spam filters are prone to high false positives and false negatives. Moreover, a majority of the spammers obfuscate their email content inorder to circumvent the content-based spam filters. However, they do not have access to all the fields in the email header. Our classification method is based on the path traversed by email (instead of content analysis) since we believe that spammers cannot forge all the fields in the email header. We based our classification on three kinds of analyses on the header: i) EndToEnd path analysis, which tries to establish the legitimacy of the path taken by an email and classifies them as either spam or non-spam; ii) Relay analysis, which verifies the trustworthiness of the relays participating in the relaying of emails; iii) Emails wantedness analysis, which measure the recipients wantedness of the senders emails. We use the IMAP message status flags such as, message has been read, deleted, answered, flagged, and draft as an implicit feed back from the user in Emails wantedness analysis. Finally we classify the incoming emails as i) socially close (such as, legitimate emails from family, and friends), ii) socially distinct emails from strangers, iii) spam emails (for example, emails from telemarketers, and spammers) and iv) opt-in emails. Based on the relation between spamminess of the path taken by spam emails and the unwantedness values of the spammers, we classify spammers as i) prospective spammers, ii) suspects, iii) recent spammers and iv) serial spammers. Overall, our method resulted in far less false positives compared to current filters like SpamAssassin. We achieved a precision of 98.65% which is better than the precisions achieved by SPF and DNSBL blacklists.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126330483","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-07-09DOI: 10.1109/COMSWA.2007.382438
Tarun Banka, Panho Lee, A. Jayasumana, J. Kurose
Many real-time distributed collaborative applications are emerging that require exchange of critical sensor data among geographically distant end users under resource-constrained network conditions. The QoS requirements, e.g., required bandwidth, latency, acceptable data quality, and reliability are interdependent, and critical to the operation of these applications. This paper presents an AWON (application-aware overlay networks) architecture for deploying application-aware services in an overlay network to best meet the application requirements over the available overlay networking infrastructure. An application programming interface (API) is presented to facilitate development of applications within the AWON architectural framework. The API supports the configuration of overlay nodes for in-network, application-aware processing. Application-defined plug-in modules are used to deploy application-specific functionality at each overlay node. The API also enables communication between application and the overlay routing protocol for the desired QoS support. The effectiveness of the AWON architecture and the API is demonstrated for a real-time weather radar data dissemination application using planetlab. Experimental results show that AWON-based application-aware services significantly improve the quality of the content delivered to the end users in bandwidth-constrained conditions.
{"title":"An Architecture and a Programming Interface for Application-Aware Data Dissemination Using Overlay Networks","authors":"Tarun Banka, Panho Lee, A. Jayasumana, J. Kurose","doi":"10.1109/COMSWA.2007.382438","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382438","url":null,"abstract":"Many real-time distributed collaborative applications are emerging that require exchange of critical sensor data among geographically distant end users under resource-constrained network conditions. The QoS requirements, e.g., required bandwidth, latency, acceptable data quality, and reliability are interdependent, and critical to the operation of these applications. This paper presents an AWON (application-aware overlay networks) architecture for deploying application-aware services in an overlay network to best meet the application requirements over the available overlay networking infrastructure. An application programming interface (API) is presented to facilitate development of applications within the AWON architectural framework. The API supports the configuration of overlay nodes for in-network, application-aware processing. Application-defined plug-in modules are used to deploy application-specific functionality at each overlay node. The API also enables communication between application and the overlay routing protocol for the desired QoS support. The effectiveness of the AWON architecture and the API is demonstrated for a real-time weather radar data dissemination application using planetlab. Experimental results show that AWON-based application-aware services significantly improve the quality of the content delivered to the end users in bandwidth-constrained conditions.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114183923","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
扫码关注我们
求助内容：
应助结果提醒方式：