{"title":"Mining and Visualizing the Evolution of the Web Graph Structure","authors":"Masashi Toyoda","doi":"10.1109/WAINA.2008.328","DOIUrl":"https://doi.org/10.1109/WAINA.2008.328","url":null,"abstract":"","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125745883","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 describe the main capabilities for the third generation of the sensor nodes. The challenges for implementing such nodes is focused on providing the hardware design reconfiguration at minimum power consumption and developing the components library that can be used to develop sensor nodes at short period of time. The impact of using third generation nodes on network level evaluation and next-generation applications is also discussed in this work.
{"title":"Hardware Reconfiguration Capability for Third Generation Sensor Nodes: Design and Challenges","authors":"A. E. Kateeb, L. Azzawi","doi":"10.1109/WAINA.2008.176","DOIUrl":"https://doi.org/10.1109/WAINA.2008.176","url":null,"abstract":"In this paper, we describe the main capabilities for the third generation of the sensor nodes. The challenges for implementing such nodes is focused on providing the hardware design reconfiguration at minimum power consumption and developing the components library that can be used to develop sensor nodes at short period of time. The impact of using third generation nodes on network level evaluation and next-generation applications is also discussed in this work.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132542445","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}
Process management and workflow systems play an important role in the composition of services in business as well as automation environments. Processes are designed using tools and deployed on a process management engine which control their execution. Unfortunately, the extensive requirements of process management engines on the underlying hard- and software often exceeds the limits of the resources of embedded systems in terms of memory and processing power. This paper proposes an approach of compiling processes to executable programs with very small footprints which can also be run on embedded systems with limited resources. This approach uses the WS-BPEL 2.0 specification for designing the process, XSL transformation and the Apache Axis2 Java architecture for the code generation being flexible and adaptable to future extensions and enhancements of WS-BPEL.
{"title":"WS-BPEL Process Compiler for Resource-Constrained Embedded Systems","authors":"H. Bohn, A. Bobek, F. Golatowski","doi":"10.1109/WAINA.2008.252","DOIUrl":"https://doi.org/10.1109/WAINA.2008.252","url":null,"abstract":"Process management and workflow systems play an important role in the composition of services in business as well as automation environments. Processes are designed using tools and deployed on a process management engine which control their execution. Unfortunately, the extensive requirements of process management engines on the underlying hard- and software often exceeds the limits of the resources of embedded systems in terms of memory and processing power. This paper proposes an approach of compiling processes to executable programs with very small footprints which can also be run on embedded systems with limited resources. This approach uses the WS-BPEL 2.0 specification for designing the process, XSL transformation and the Apache Axis2 Java architecture for the code generation being flexible and adaptable to future extensions and enhancements of WS-BPEL.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131718425","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 work, we present a generic backoff-timer scheduling algorithm for the Smart-DCF scheme. In Smart-DCF, the master station schedules the backoff timer value for each client station, and the backoff timer information is sent to the client station via an acknowledgment frame. The proposed backoff-timer scheduling mechanism enables the Smart-DCF access point to provide differentiated services to different classes of wireless stations or traffic. The simulation results demonstrate that the proposed scheduling algorithm is effective. The results also show that the Smart-DCF scheme noticeably outperforms the existing DCF scheme. In addition, the throughput performance of Smart-DCF starts to reach the saturated level when each data burst is longer than 5 frames.
{"title":"On Backoff Timer Scheduling for Smart-DCF and Performance Evaluation","authors":"S. Siwamogsatham","doi":"10.1109/WAINA.2008.240","DOIUrl":"https://doi.org/10.1109/WAINA.2008.240","url":null,"abstract":"In this work, we present a generic backoff-timer scheduling algorithm for the Smart-DCF scheme. In Smart-DCF, the master station schedules the backoff timer value for each client station, and the backoff timer information is sent to the client station via an acknowledgment frame. The proposed backoff-timer scheduling mechanism enables the Smart-DCF access point to provide differentiated services to different classes of wireless stations or traffic. The simulation results demonstrate that the proposed scheduling algorithm is effective. The results also show that the Smart-DCF scheme noticeably outperforms the existing DCF scheme. In addition, the throughput performance of Smart-DCF starts to reach the saturated level when each data burst is longer than 5 frames.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125195620","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}
Recently, there are numerous techniques have been proposed to forecast and identify the software development effort; such prediction has a prominent impact on the success of software development projects. The most common methods for estimating software development efforts that have been proposed in literature are: line of code (LOC)-based constructive cost model (COCOMO), function point- based regression model (FP), neural network model (NN), and case-based reasoning (CBR). Recent research has tended to focus on the use of function points (FPs) in estimating the software development efforts, however, a precise estimation should not only consider the FPs, which represent the size of the software, but should also include various elements of the development environment for its estimation. Therefore, the main benefit of this study is to design and analyze both function points and development environments of recent software development cases. Therefore, this paper presents a new intelligence paradigm scheme based on functional network to forecast that emphasizes on numerous software development elements. Both implementation and learning process are based on the utilization of functional networks as a new modeling scheme and investigate its efficiency as a software development estimation model for predicting the software development efforts.
{"title":"New Computational Intelligence Paradigm for Estimating the Software Project Effort","authors":"E. A. El-Sebakhy","doi":"10.1109/WAINA.2008.257","DOIUrl":"https://doi.org/10.1109/WAINA.2008.257","url":null,"abstract":"Recently, there are numerous techniques have been proposed to forecast and identify the software development effort; such prediction has a prominent impact on the success of software development projects. The most common methods for estimating software development efforts that have been proposed in literature are: line of code (LOC)-based constructive cost model (COCOMO), function point- based regression model (FP), neural network model (NN), and case-based reasoning (CBR). Recent research has tended to focus on the use of function points (FPs) in estimating the software development efforts, however, a precise estimation should not only consider the FPs, which represent the size of the software, but should also include various elements of the development environment for its estimation. Therefore, the main benefit of this study is to design and analyze both function points and development environments of recent software development cases. Therefore, this paper presents a new intelligence paradigm scheme based on functional network to forecast that emphasizes on numerous software development elements. Both implementation and learning process are based on the utilization of functional networks as a new modeling scheme and investigate its efficiency as a software development estimation model for predicting the software development efforts.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132909411","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}
M. Mirza-Aghatabar, S. Koohi, S. Hessabi, Dara Rahmati
Network-on-chip (NoC) is a precious approach to handle huge number of transistors by virtue of technology scaling to lower than 50 nm. Virtual channels have been introduced in order to improve the performance according to a timing multiplexing concept in each physical channel. The incremental effect of virtual channels on power consumption has been shown in literatures. The issue of power saving has always been controversial to many designers. In this paper, we introduce a new technique which tries to adaptively mange the number of virtual channels in order to reduce the power consumption while not degrading the performance of the network without any reconfiguration. Our experimental results show the efficiency of our method in a torus topology under different traffic models and Duato routing algorithm with 49 % and 30 % power saving in the best and worst conditions, respectively.
{"title":"An Adaptive Approach to Manage the Number of Virtual Channels","authors":"M. Mirza-Aghatabar, S. Koohi, S. Hessabi, Dara Rahmati","doi":"10.1109/WAINA.2008.236","DOIUrl":"https://doi.org/10.1109/WAINA.2008.236","url":null,"abstract":"Network-on-chip (NoC) is a precious approach to handle huge number of transistors by virtue of technology scaling to lower than 50 nm. Virtual channels have been introduced in order to improve the performance according to a timing multiplexing concept in each physical channel. The incremental effect of virtual channels on power consumption has been shown in literatures. The issue of power saving has always been controversial to many designers. In this paper, we introduce a new technique which tries to adaptively mange the number of virtual channels in order to reduce the power consumption while not degrading the performance of the network without any reconfiguration. Our experimental results show the efficiency of our method in a torus topology under different traffic models and Duato routing algorithm with 49 % and 30 % power saving in the best and worst conditions, respectively.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132567127","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}
Due to the increasing amount of data handled by business applications and the need of an easy way to access data by multiple servers, storage area networks (SANs) have been proposed as a solution to be deployed in enterprises networks. Despite their advantages, a set of security issues are related to these next generation high speed network architectures and that may be a threat to the performance and the availability of such networks. In this paper, we propose an intrusion detection and tolerance system that ensures protection of the SANs against attacks. The proposed solution is based on: (a) the management of two areas (virtual area and protected area) at each storage node; (b) the cooperation of detection modules running on each SAN component; and (c) the use of distributed set of rules that are updated and managed in a secure manner. A case study is given to illustrate the proposed system capabilities in terms of intrusion detection and tolerance.
{"title":"Dynamic Detection and Tolerance of Attacks in Storage Area Networks","authors":"Y. Djemaiel, N. Boudriga","doi":"10.1109/WAINA.2008.34","DOIUrl":"https://doi.org/10.1109/WAINA.2008.34","url":null,"abstract":"Due to the increasing amount of data handled by business applications and the need of an easy way to access data by multiple servers, storage area networks (SANs) have been proposed as a solution to be deployed in enterprises networks. Despite their advantages, a set of security issues are related to these next generation high speed network architectures and that may be a threat to the performance and the availability of such networks. In this paper, we propose an intrusion detection and tolerance system that ensures protection of the SANs against attacks. The proposed solution is based on: (a) the management of two areas (virtual area and protected area) at each storage node; (b) the cooperation of detection modules running on each SAN component; and (c) the use of distributed set of rules that are updated and managed in a secure manner. A case study is given to illustrate the proposed system capabilities in terms of intrusion detection and tolerance.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132693913","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}
M. Wan, Han-Ching Wu, Ying-Wei Kuo, James Marshall, S. S. Huang
Network intruders commonly use stolen passwords or other means to log into legitimate users' computer accounts. To prevent this from happening, it is important that we are able to distinguish a user as a true user or a masquerader. Uniqueness of user command has been used in the past as signature of users. This project explores the high frequency commands to see if they work well as signatures. Experimental result was provided to show that they work as well as the Uniqueness method. Besides, the comparisons with other methods were also presented.
{"title":"Detecting Masqueraders Using High Frequency Commands as Signatures","authors":"M. Wan, Han-Ching Wu, Ying-Wei Kuo, James Marshall, S. S. Huang","doi":"10.1109/WAINA.2008.38","DOIUrl":"https://doi.org/10.1109/WAINA.2008.38","url":null,"abstract":"Network intruders commonly use stolen passwords or other means to log into legitimate users' computer accounts. To prevent this from happening, it is important that we are able to distinguish a user as a true user or a masquerader. Uniqueness of user command has been used in the past as signature of users. This project explores the high frequency commands to see if they work well as signatures. Experimental result was provided to show that they work as well as the Uniqueness method. Besides, the comparisons with other methods were also presented.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115506872","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}
Some advantages of meshing Wireless Personal Area Networks (WPAN) are to increase the network coverage without high transmission power, self- configuration and self-healing, increased route redundancy and fewer retransmissions. This paper discusses the capacity issues when meshing high data rate WPANs i.e. IEEE 802.15.3, IEEE 802.15.3a and IEEE 802.15.3c. The capacity bottlenecks are discussed which arise in multihop communication with a shared superframe. The paper provides detailed analysis on the superframe capacity using different transmitter data rates and highlights the importance of frame aggregation to achieve higher throughput and low overhead. The paper concludes by discussing possible approaches to improve the capacity of meshed WPANs.
{"title":"Capacity Issues in Meshed High Data Rate WPANs","authors":"S. Mahmud, Shahbaz Khan, Q. Ni, H. Al-Raweshidy","doi":"10.1109/WAINA.2008.253","DOIUrl":"https://doi.org/10.1109/WAINA.2008.253","url":null,"abstract":"Some advantages of meshing Wireless Personal Area Networks (WPAN) are to increase the network coverage without high transmission power, self- configuration and self-healing, increased route redundancy and fewer retransmissions. This paper discusses the capacity issues when meshing high data rate WPANs i.e. IEEE 802.15.3, IEEE 802.15.3a and IEEE 802.15.3c. The capacity bottlenecks are discussed which arise in multihop communication with a shared superframe. The paper provides detailed analysis on the superframe capacity using different transmitter data rates and highlights the importance of frame aggregation to achieve higher throughput and low overhead. The paper concludes by discussing possible approaches to improve the capacity of meshed WPANs.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115581741","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}
Opportunistic networking is emerging as a technique to exploit chance encounters among mobile nodes, and is distinct from previously studied behaviors found in sensor and ad hoc networking research. In this paper, we explore contributions in epidemic data dissemination and mobile ad hoc networks applicable to opportunistic networking, and propose an extension to prior work based on active cures. Our scheme, called SERAC, increases the rate at which cure messages are propagated in a fragmented network for the purpose of reducing the overhead of outstanding yet incompletely disseminated messages. Preliminary analyses demonstrate the feasibility of performance gains under the opportunistic networking model.
{"title":"A Proposed Scheme for Epidemic Routing with Active Curing for Opportunistic Networks","authors":"Jonah P. Tower, T. Little","doi":"10.1109/WAINA.2008.247","DOIUrl":"https://doi.org/10.1109/WAINA.2008.247","url":null,"abstract":"Opportunistic networking is emerging as a technique to exploit chance encounters among mobile nodes, and is distinct from previously studied behaviors found in sensor and ad hoc networking research. In this paper, we explore contributions in epidemic data dissemination and mobile ad hoc networks applicable to opportunistic networking, and propose an extension to prior work based on active cures. Our scheme, called SERAC, increases the rate at which cure messages are propagated in a fragmented network for the purpose of reducing the overhead of outstanding yet incompletely disseminated messages. Preliminary analyses demonstrate the feasibility of performance gains under the opportunistic networking model.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114574352","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
扫码关注我们
求助内容：
应助结果提醒方式：