Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382616
Neung-Hyung Lee, S. Bahk
As wireless networks evolve to orthogonal frequency division multiple access (OFDMA) systems, inter-cell interference control becomes a critical issue in radio resource management. The allocation of the same channels in neighbor cells cause inter-cell interference, so the channel allocation needs to be taken carefully to lower the inter-cell interference. For channel allocation, we consider two types of approach: centralized and distributed. In centralized approach, there exists a central server for channel allocation. This approach gives optimal allocation results, but requires a lot of information exchanges and calculations. In this paper, under the assumption of static users, we tackle a channel allocation problem by using the centralized approach and propose heuristic algorithms that require low complexity. Our proposed algorithms show good performance in terms of throughput and power consumption compared to the other centralized schemes. Our algorithms of power allocation with fixed increase (PAFI) and rate allocation with fixed increase (RAFI) show 2 to 3% lower throughput compared to the optimal scheme while they reduce the power consumption by up to 40%. Our schemes show approximately 10% more throughput and 70% less power consumption compared to the scheme of frequency reuse factor 1 that is fully distributed. In distributed approach, each cell independently tries to allocate channels to lower the interference level without using a centralized server. We sketch a way of dynamic channel allocation considering the interference range for our distributed approach.
{"title":"Channel allocation considering the interference range in multi-cell OFDMA downlink systems","authors":"Neung-Hyung Lee, S. Bahk","doi":"10.1109/COMSWA.2007.382616","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382616","url":null,"abstract":"As wireless networks evolve to orthogonal frequency division multiple access (OFDMA) systems, inter-cell interference control becomes a critical issue in radio resource management. The allocation of the same channels in neighbor cells cause inter-cell interference, so the channel allocation needs to be taken carefully to lower the inter-cell interference. For channel allocation, we consider two types of approach: centralized and distributed. In centralized approach, there exists a central server for channel allocation. This approach gives optimal allocation results, but requires a lot of information exchanges and calculations. In this paper, under the assumption of static users, we tackle a channel allocation problem by using the centralized approach and propose heuristic algorithms that require low complexity. Our proposed algorithms show good performance in terms of throughput and power consumption compared to the other centralized schemes. Our algorithms of power allocation with fixed increase (PAFI) and rate allocation with fixed increase (RAFI) show 2 to 3% lower throughput compared to the optimal scheme while they reduce the power consumption by up to 40%. Our schemes show approximately 10% more throughput and 70% less power consumption compared to the scheme of frequency reuse factor 1 that is fully distributed. In distributed approach, each cell independently tries to allocate channels to lower the interference level without using a centralized server. We sketch a way of dynamic channel allocation considering the interference range for our distributed approach.","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":"122709176","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.382603
Ju-Hyung Son, Jun-Sik Lee, S. Seo
A large-scale sensor network often requires a network wide group key for confidentiality of control messages and data reports. The group key should be updated when a certain sensor node is compromised by adversaries in a hostile environment. However, key update messages will consume much energy during hop-by-hop delivery to each sensor nodes. In this paper, we propose a new group key management scheme which minimizes communication overhead of rekeying messages. To achieve this goal, we first give detailed analysis of communication overhead of the existing logical key tree scheme. Then we present the topological key hierarchy scheme which explicitly considers sensor network topology during key tree generation. We show that our scheme can drastically reduce communication overheads of the tree based group key management in wireless sensor networks.
{"title":"Energy Efficient Group Key Management Scheme for Wireless Sensor Networks","authors":"Ju-Hyung Son, Jun-Sik Lee, S. Seo","doi":"10.1109/COMSWA.2007.382603","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382603","url":null,"abstract":"A large-scale sensor network often requires a network wide group key for confidentiality of control messages and data reports. The group key should be updated when a certain sensor node is compromised by adversaries in a hostile environment. However, key update messages will consume much energy during hop-by-hop delivery to each sensor nodes. In this paper, we propose a new group key management scheme which minimizes communication overhead of rekeying messages. To achieve this goal, we first give detailed analysis of communication overhead of the existing logical key tree scheme. Then we present the topological key hierarchy scheme which explicitly considers sensor network topology during key tree generation. We show that our scheme can drastically reduce communication overheads of the tree based group key management in wireless sensor networks.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"29 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":"129014453","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.382463
Abhijit Bagri, Mohit Mundhra, Abhinav Pathak, B. Raman
802.11 usage has exploded and broken all barriers for which it was originally proposed. This has resulted in research for its non-legacy usages. Such usages require study of packets with low level details such as signal strength, rate and frame control parameters. We provide a novel architecture called WiFiDump which can provide such low level details from network driver to a user space process. We also provide an implementation and evaluation of the proposed architecture for 802.11b networks on systems running prism2 chipset based cards. Further, the entire package has been incorporated on Linux with the popular packet capturing and filtering library libpcap and the standard tool -tcpdump.
{"title":"WiFiDump - A Novel Architecture for Wireless Network Debugging","authors":"Abhijit Bagri, Mohit Mundhra, Abhinav Pathak, B. Raman","doi":"10.1109/COMSWA.2007.382463","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382463","url":null,"abstract":"802.11 usage has exploded and broken all barriers for which it was originally proposed. This has resulted in research for its non-legacy usages. Such usages require study of packets with low level details such as signal strength, rate and frame control parameters. We provide a novel architecture called WiFiDump which can provide such low level details from network driver to a user space process. We also provide an implementation and evaluation of the proposed architecture for 802.11b networks on systems running prism2 chipset based cards. Further, the entire package has been incorporated on Linux with the popular packet capturing and filtering library libpcap and the standard tool -tcpdump.","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":"129146363","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.382419
Luigi Telesca
The growing diffusion of outsourcing and insourcing practices in companies life motivated by enterprise efficiency, costs reduction policies and the increasing market dynamicity have motivated the need of distributed service oriented information systems. The Business Ecosystems (BEs) concept defined by James Moore to describe the evolving interaction of business world elements, is taking advantage of the Web 2.0 and B2B networking systems paradigms. These technologies have enabled enterprises to efficiently cooperate in the digital world towards the creation of Digital Ecosystems (DEs). An essential element of DEs is represented by the negotiation of alliances, which enable companies to join competences as well as services and products into a complex offering. This paper describes the Open Negotiation Environment (ONE) project who's aim is to empower the DEs vision with a distributed multi-party multi-issue negotiation platform. ONE will provide sophisticated negotiations processes and supporting tools, enriched by learning and optimisation capabilities. With this approach, ONE will permit an DE to dynamically package and compose complex services through negotiating alliances of loose networks of suppliers, distributors, and outsourcers; makers of related products or services; providers of relevant technology; and other organizations, that could evolve over time.
{"title":"Towards Open Decentralized Self-Learning Negotiation Environment for Business Ecosystems","authors":"Luigi Telesca","doi":"10.1109/COMSWA.2007.382419","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382419","url":null,"abstract":"The growing diffusion of outsourcing and insourcing practices in companies life motivated by enterprise efficiency, costs reduction policies and the increasing market dynamicity have motivated the need of distributed service oriented information systems. The Business Ecosystems (BEs) concept defined by James Moore to describe the evolving interaction of business world elements, is taking advantage of the Web 2.0 and B2B networking systems paradigms. These technologies have enabled enterprises to efficiently cooperate in the digital world towards the creation of Digital Ecosystems (DEs). An essential element of DEs is represented by the negotiation of alliances, which enable companies to join competences as well as services and products into a complex offering. This paper describes the Open Negotiation Environment (ONE) project who's aim is to empower the DEs vision with a distributed multi-party multi-issue negotiation platform. ONE will provide sophisticated negotiations processes and supporting tools, enriched by learning and optimisation capabilities. With this approach, ONE will permit an DE to dynamically package and compose complex services through negotiating alliances of loose networks of suppliers, distributors, and outsourcers; makers of related products or services; providers of relevant technology; and other organizations, that could evolve over time.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"64 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":"130278267","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.382626
A. Subramanian, Samir R Das
We address deafness and directional hidden terminal problem that occur when MAC protocols are designed for directional antenna based wireless multi-hop networks. Deafness occurs when the transmitter fails to communicate to its intended receiver, because the receiver's antenna is oriented in a different direction. The directional hidden terminal problem occurs when the transmitter fails to hear a prior RTS/CTS exchange between another pair of nodes and cause collision by initiating a transmission to the receiver of the ongoing communication. Though directional antennas offer better spatial reuse, these problems can have a serious impact on network performance. In this paper, we study various scenarios in which these problems can occur and design a MAC protocol that solves them comprehensively using only a single channel and single radio interface. Current solutions in literature either do not address these issues comprehensively or use more than one radio/channel to solve them. We evaluate our protocol using detailed simulation studies. Simulation results indicate that our protocol can effectively address deafness and directional hidden terminal problem and increase network performance.
{"title":"Addressing Deafness and Hidden Terninal Problem in Directional Antenna based Wireless Multi-Hop Networks","authors":"A. Subramanian, Samir R Das","doi":"10.1109/COMSWA.2007.382626","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382626","url":null,"abstract":"We address deafness and directional hidden terminal problem that occur when MAC protocols are designed for directional antenna based wireless multi-hop networks. Deafness occurs when the transmitter fails to communicate to its intended receiver, because the receiver's antenna is oriented in a different direction. The directional hidden terminal problem occurs when the transmitter fails to hear a prior RTS/CTS exchange between another pair of nodes and cause collision by initiating a transmission to the receiver of the ongoing communication. Though directional antennas offer better spatial reuse, these problems can have a serious impact on network performance. In this paper, we study various scenarios in which these problems can occur and design a MAC protocol that solves them comprehensively using only a single channel and single radio interface. Current solutions in literature either do not address these issues comprehensively or use more than one radio/channel to solve them. We evaluate our protocol using detailed simulation studies. Simulation results indicate that our protocol can effectively address deafness and directional hidden terminal problem and increase network performance.","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":"127742370","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.382429
S. Saha, M. Matsumoto
Although wireless sensor network was a trend of past few years, lots of researchers have been working for its development. As a consequence, they have developed new research works. But within these works, very few works are for disaster managements in hybrid networks of sensor networks and cellular networks. However, among these few works, no works consider that some base stations of cellular networks might be collapsed or unreachable during or after disaster. From experience we can say, in 1995 during earthquake in Kobe Japan, base stations were unreachable from disaster areas. Same things happened during Nigatta earthquake in 1999. Considering these deficiencies, in this paper we propose an updated framework for data collection from sensor networks and a protocol for wireless sensor network for disaster management; this protocol is abbreviated as WSNDM. Our data collection framework is an updated framework of [8]. Here we consider some base stations might be unreachable due to disaster. For data dissemination from sensor networks, we have used ARS(adhoc relay station)s. In [8], based on ARSs placement in border areas of cells, cells are divided in to three types. In our performance section, we evaluate the performance of proposed protocol WSNDM with respect to these three types of cell, it also, we compare our protocol with LEACH, a popular hierarchical protocol, where our protocol outperforms the LEACH protocol.
{"title":"A Framework for Data Collection and Wireless Sensor Network Protocol for Disaster Management","authors":"S. Saha, M. Matsumoto","doi":"10.1109/COMSWA.2007.382429","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382429","url":null,"abstract":"Although wireless sensor network was a trend of past few years, lots of researchers have been working for its development. As a consequence, they have developed new research works. But within these works, very few works are for disaster managements in hybrid networks of sensor networks and cellular networks. However, among these few works, no works consider that some base stations of cellular networks might be collapsed or unreachable during or after disaster. From experience we can say, in 1995 during earthquake in Kobe Japan, base stations were unreachable from disaster areas. Same things happened during Nigatta earthquake in 1999. Considering these deficiencies, in this paper we propose an updated framework for data collection from sensor networks and a protocol for wireless sensor network for disaster management; this protocol is abbreviated as WSNDM. Our data collection framework is an updated framework of [8]. Here we consider some base stations might be unreachable due to disaster. For data dissemination from sensor networks, we have used ARS(adhoc relay station)s. In [8], based on ARSs placement in border areas of cells, cells are divided in to three types. In our performance section, we evaluate the performance of proposed protocol WSNDM with respect to these three types of cell, it also, we compare our protocol with LEACH, a popular hierarchical protocol, where our protocol outperforms the LEACH protocol.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"40 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":"123749329","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.382453
M. Manikandan, S. Ravikumar, V. Abhaikumar, S. Thiruvengadam
This paper proposes a novel method of using chaotic binary sequence in pulse amplitude modulation based ultrawideband (UWB) system to suppress interference and hence to improve the Bit Error Rate (BER) performance in the presence of narrowband interference (NBI). It is one of the very important considerations in the UWB systems as the spectrum of UWB overlays with the existing narrowband wireless systems. In the proposed method, the chaotic binary sequence is used across the frames within one symbol duration. The performance of the proposed scheme is analyzed using the channel models proposed by IEEE 802.15.3a working group for short range, high data rate wireless communications. The simulation results show that the proposed system has better BER performance compared to the existing systems, in the presence of NBI. In addition to the suppression of NBI, the proposed scheme has an added level of security due to the chaotic spreading.
{"title":"A Novel Pulse Based Ultrawide Band System Using Chaotic Spreading Sequences","authors":"M. Manikandan, S. Ravikumar, V. Abhaikumar, S. Thiruvengadam","doi":"10.1109/COMSWA.2007.382453","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382453","url":null,"abstract":"This paper proposes a novel method of using chaotic binary sequence in pulse amplitude modulation based ultrawideband (UWB) system to suppress interference and hence to improve the Bit Error Rate (BER) performance in the presence of narrowband interference (NBI). It is one of the very important considerations in the UWB systems as the spectrum of UWB overlays with the existing narrowband wireless systems. In the proposed method, the chaotic binary sequence is used across the frames within one symbol duration. The performance of the proposed scheme is analyzed using the channel models proposed by IEEE 802.15.3a working group for short range, high data rate wireless communications. The simulation results show that the proposed system has better BER performance compared to the existing systems, in the presence of NBI. In addition to the suppression of NBI, the proposed scheme has an added level of security due to the chaotic spreading.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"29 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":"126780375","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 present an agent-based P2P system, called Visitant, to integrate mobile agent technology with P2P computing. The use of structured P2P systems as the base layer allows agents to efficiently locate resources and communicate with each other. It also allows us to incorporate a security control mechanism to prevent malicious hosts from colluding with each other to paralyze the system. To demonstrate Visitant, we built an application to simulate Fujiwhara effect-the tendency of two nearby tropical cyclones to rotate around each other.
{"title":"A Simulation of Fujiwhara Effect on a Structured Agent-Based Peer-to-Peer System","authors":"Yuh-Jzer Joung, Meng-kai Lin, Yichi Lin, Chia-Wei Chang, Huang-Hsu Chen","doi":"10.1109/COMSWA.2007.382554","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382554","url":null,"abstract":"We present an agent-based P2P system, called Visitant, to integrate mobile agent technology with P2P computing. The use of structured P2P systems as the base layer allows agents to efficiently locate resources and communicate with each other. It also allows us to incorporate a security control mechanism to prevent malicious hosts from colluding with each other to paralyze the system. To demonstrate Visitant, we built an application to simulate Fujiwhara effect-the tendency of two nearby tropical cyclones to rotate around each other.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"63 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":"127160742","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.382439
L. F. Auler, R. d'Amore
The importance of Time synchronization for distributed applications is growing. The most currently used synchronization protocol is NTP [1]. NTP and GPS satisfy the majority of the world's time synchronization needs, although, GPS have limitations [2]. GPS cannot function inside buildings, or in places where there are physical obstructions and high amounts of electromagnetic noise. In addition, GPS is a costly solution. This work proposes a new approach to synchronize time among machines interconnected by computer networks, which minimizes the disturbance introduced by the network with no extra hardware cost. The methodology employs high-resolution clocks and stochastic methods to minimize the error introduced in time measurement carried out across the network. It also uses an adaptive approach to continuously tune the synchronization mechanism to the network traffic characteristics. An increase of time synchronization accuracy of two orders of magnitude, in comparison with traditional estimation methods was obtained as a result.
{"title":"Adaptive Kalman Filter for Time Synchronization over Packet-Switched Networks: An Heuristic Approach","authors":"L. F. Auler, R. d'Amore","doi":"10.1109/COMSWA.2007.382439","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382439","url":null,"abstract":"The importance of Time synchronization for distributed applications is growing. The most currently used synchronization protocol is NTP [1]. NTP and GPS satisfy the majority of the world's time synchronization needs, although, GPS have limitations [2]. GPS cannot function inside buildings, or in places where there are physical obstructions and high amounts of electromagnetic noise. In addition, GPS is a costly solution. This work proposes a new approach to synchronize time among machines interconnected by computer networks, which minimizes the disturbance introduced by the network with no extra hardware cost. The methodology employs high-resolution clocks and stochastic methods to minimize the error introduced in time measurement carried out across the network. It also uses an adaptive approach to continuously tune the synchronization mechanism to the network traffic characteristics. An increase of time synchronization accuracy of two orders of magnitude, in comparison with traditional estimation methods was obtained as a result.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"2 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":"132895132","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.382557
G. K. Mostéfaoui, N. Narendra, Z. Maamar, Philippe Thiran
Like any computing application, Web services are subject to failure and unavailability due to multiple reasons like Web service faulty-code and unreliable communication-infrastructure. A manual correction of Web services failure is error-prone and time-consuming. An effective Web services environment should be able to monitor its state, diagnosis faults, and automatically recover from failures. This process is known as self-healing. In this paper, we address self-healing issues of Web services using Aspect-Oriented Programming (AOP). AOP supports separation of self-healing concerns from Web services code and promotes maintenance and reusability.
{"title":"On Modeling and Developing Self-Healing Web Services Using Aspects","authors":"G. K. Mostéfaoui, N. Narendra, Z. Maamar, Philippe Thiran","doi":"10.1109/COMSWA.2007.382557","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382557","url":null,"abstract":"Like any computing application, Web services are subject to failure and unavailability due to multiple reasons like Web service faulty-code and unreliable communication-infrastructure. A manual correction of Web services failure is error-prone and time-consuming. An effective Web services environment should be able to monitor its state, diagnosis faults, and automatically recover from failures. This process is known as self-healing. In this paper, we address self-healing issues of Web services using Aspect-Oriented Programming (AOP). AOP supports separation of self-healing concerns from Web services code and promotes maintenance and reusability.","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":"129783682","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
扫码关注我们
求助内容：
应助结果提醒方式：