{"title":"Implementation of Backward Recovery Mechanism in Preemptive Utility Accrual Real Time Scheduling Algorithm","authors":"Idawaty Ahmad, Muhammad Fauzan Othman","doi":"10.1109/NETAPPS.2010.30","DOIUrl":"https://doi.org/10.1109/NETAPPS.2010.30","url":null,"abstract":"This paper proposed a robust algorithm named as Backward Recovery Preemptive Utility Accrual Scheduling (BRPUAS). The proposed algorithm solved the abortion problem in the existing TUF/UA scheduling paradigm known as ARPUAS that only considers the abortion recovery as their fault recovery solution. BRPUAS enables the re-execution of the affected tasks rather than abortion to reduce the number of aborted tasks. It ensures the correctness of the executed tasks in the best effort basis in such a way that the infeasible tasks are aborted and produced zero utility, while the feasible tasks are re-executed to produce positive utility and consequently maximizing the total accrued utility to the system. Simulation results revealed that the BRPUAS achieved higher accrued utility compared to the ARPUAS for the entire load range, making it more reliable and efficient for adaptive real time application domain.","PeriodicalId":265699,"journal":{"name":"2010 Second International Conference on Network Applications, Protocols and Services","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125382925","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}
{"title":"Ipv6 Address Space Allocation Schemes - Issues and Challenges, A Survey","authors":"M. Raja Kumar, S. Ramadass","doi":"10.1109/NETAPPS.2010.37","DOIUrl":"https://doi.org/10.1109/NETAPPS.2010.37","url":null,"abstract":"Research and discussion on the Internets addressing and routing scalability problems has been for more than a decade. IP aware growing population, and learned needs in terms of site multi-homing, traffic engineering, non-aggregatable address allocations and policy based routing have resulted in the continuous alarming growth of the routing tables in the Default Free Zone (DFZ). Constraints posed by the existing router technology, address allocation and architectural history have made identifying and deploying an effective solution difficult. These sources that influence the core routing table growth can lead to fragmentation or de-aggregation of address prefixes. Much of the growths of the routing tables in the DFZ are a result of de-aggregation of address prefixes. Aggressive topological aggregation is the solution to scale the routing system, that is, IP address allocations should follow topology. IP address allocation and management and the scalability of the routing system are interrelated and only certain IP address allocation and management policies yield scalable routing. The Regional Internet Registries (RIRs) individually use various allocation techniques within their respective regional pools of address space. Proper choice of address allocation algorithm would help in reducing fragmentation, thus reducing routing table size and hence increase Internet addressing and routing scalability. This paper analyzes the various address allocation algorithms used by the RIR’s and based on the lessons learnt proposes a hybrid address allocation scheme for IPv6 that would achieve appreciable address aggregation compared to the existing IPv6 address allocation algorithms, and effectively reduce routing table size in the DFZ. This would help in increasing the Internet addressing and routing scalability and thus enhance the performance of the Internet.","PeriodicalId":265699,"journal":{"name":"2010 Second International Conference on Network Applications, Protocols and Services","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132472077","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}
{"title":"Secure Multipath Routing Protocols in Wireless Sensor Networks: A Security Survey Analysis","authors":"Ali Modirkhazeni, N. Ithnin, O. Ibrahim","doi":"10.1109/NETAPPS.2010.48","DOIUrl":"https://doi.org/10.1109/NETAPPS.2010.48","url":null,"abstract":"Wireless Sensor Networks is usually consisting of huge number of limited sensor devices which are communicated over the wireless media. As sensor devices are limited, the networks exposed to various kinds of attacks and conventional defenses against these attacks are not suitable due to the resource constrained. Therefore, security in WSNs is a challenging task due to inheritance limitations of sensors. As a result, many secure routing protocols are introduced such as secure multipath routing protocols to reduce the attacks. In this paper we focus at security issues concerns in WSNs and present a matrix that analysed the security factor provided by the secure multipath routing protocols in wireless sensor networks.","PeriodicalId":265699,"journal":{"name":"2010 Second International Conference on Network Applications, Protocols and Services","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115667734","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}
{"title":"Divert Failure Route Protocol Based on AODV","authors":"Sayid Mohamed Abdule, S. Hassan","doi":"10.1109/NETAPPS.2010.19","DOIUrl":"https://doi.org/10.1109/NETAPPS.2010.19","url":null,"abstract":"This paper prototypes a new model for resolving link failure problem in Ad hoc network based on AODV protocol. Link failure is the major issue of the current Ad hoc network due to the nodes mobility, which can be avoided if the routing protocol responses quickly to the network topology change. In this research, we studied the Ad hoc on demand Distance Vector (AODV) routing protocol, especially link failure features with profound analysis. We have proposed a Divert Failure Route Protocol scheme (DFRP) as a solution to link failure. DFRP tries to avoid a link failure in advance. DFRP monitors the link to next hop and predict the link status through the signal strength. DFRP consists of two models; “DETECTION–MODEL and NEW-PATH CONSTRUCTOR-MODEL”. Main functions of these Models are to predict the signal strength, and to find a new route to divert the data to the new path, respectively. The main benefit of this new protocol is reducing the delay resulting from sending link failure information back to the sender.","PeriodicalId":265699,"journal":{"name":"2010 Second International Conference on Network Applications, Protocols and Services","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123899188","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}
{"title":"An Approach to Establish Trusted Application","authors":"M. Isa, J. Manan, R.M.R.R.A. Sufian, A. A. Talib","doi":"10.1109/NETAPPS.2010.35","DOIUrl":"https://doi.org/10.1109/NETAPPS.2010.35","url":null,"abstract":"Trusted Computing offer great opportunities to enhance security and privacy of the user. Trusted Platform Module (TPM) is the implementation of the trusted platform initiatives on a chip under Trusted Computing Group (TCG). The TPM chip that is similar to smart card but hardwired onto motherboard, hence making it tamper resistant from remote attack. To interface with the TPM chip, the TCG prescribe a standard interface to communicate with the TPM. However, there are some difficulties in interfacing an application to the TPM. Acquiring full knowledge of Trusted Computing is a critical success factor to successfully modify existing application including design, coding and testing the TPM based application. This paper presents a method that allows existing application running on a platform without a TPM to utilize the TPM functionalities.","PeriodicalId":265699,"journal":{"name":"2010 Second International Conference on Network Applications, Protocols and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129893953","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}
{"title":"Enhancing Qos Protection in MPLS Networks","authors":"Sabri M. Hanshi, W. Al-Khateeb","doi":"10.1109/NETAPPS.2010.24","DOIUrl":"https://doi.org/10.1109/NETAPPS.2010.24","url":null,"abstract":"MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. In fact, QoS is important for interactive voice and video application and for specific clients. However, link failure always incurs delay and packet losses of the traffic passing through the failed link. Therefore, network has to restore the traffic by switching the affected traffic to alternative path. In this paper, QoS objectives are concerned in this study to redirect the protected traffic with acceptable levels of quality before failure take place. The proposed scheme setup more than one alternative path in advance in order to introduce fast rerouting and the selecting criteria is based on the required bandwidth and end-to-end delay. In this work, we proposed the traffic splitter to split the protected traffic after failure, in case the available bandwidth in the alternative path is not enough to deliver the traffic. Finally, alternative path selection is updated based on current network resource availability. To verify the efficiency of the proposed algorithm, the MPLS network simulator MNS-2 has been used as the test platform.","PeriodicalId":265699,"journal":{"name":"2010 Second International Conference on Network Applications, Protocols and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130972914","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}
{"title":"New Efficient Tree-Building Algorithms for Creating HCM Decision Tree in a Grid Authorization System","authors":"M. Kaiiali, R. Wankar, C. R. Rao, A. Agarwal","doi":"10.1109/NETAPPS.2010.8","DOIUrl":"https://doi.org/10.1109/NETAPPS.2010.8","url":null,"abstract":"Many existing grid authorization systems adopt an inefficient structure of storing security policies for the available resources. That leads to huge repetitions in checking security rules. One of the efficient mechanisms that handles these repetitions is the Hierarchical Clustering Mechanism (HCM). HCM reduces the redundancy in checking security rules compared to the Brute Force Approach as well as the Primitive Clustering Mechanism (PCM). However, HCM is not totally free from redundancy. In this paper, new HCM tree-building algorithms are proposed which further reduce the redundancy and increase the efficiency to a reasonable extent.","PeriodicalId":265699,"journal":{"name":"2010 Second International Conference on Network Applications, Protocols and Services","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121263022","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}
{"title":"Network File Transfer Performance: Effect of IP Address, TCP Window Size and File Size","authors":"M. Sailan, R. Hassan","doi":"10.1109/NETAPPS.2010.28","DOIUrl":"https://doi.org/10.1109/NETAPPS.2010.28","url":null,"abstract":"The aim of this study is to quantify performance of network file transfer for research testbed. This study was carried out because Internet users nowadays has surfing tendency to stream video, download and upload video which need more Internet bandwidth. In addition, there is also a requirement for clarification between theoretical and actual performance of Internet Protocol version 6 (IPv6). This study is important for researchers and network administrators because output from this study is useful for them as an input for simulation and decision making process. Testbed used for this study consists of computers, network switch, server and routers. Multiple sizes of files were transferred by using multiple sizes of Transmission Control Protocol (TCP) Window and IP address version. Result from the test shows that there is a performance gap for file transfer between different IP address versions. More study in this research area will be done because there is a need for enhancement in IP based network performance.","PeriodicalId":265699,"journal":{"name":"2010 Second International Conference on Network Applications, Protocols and Services","volume":"43 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116547793","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}
{"title":"A Novel Router-based Approach for Measuring Packet-based Delay in High Speed IP Networks","authors":"S. R. K. Tabbakh, B. Ali, S. Khatun","doi":"10.1109/NETAPPS.2010.29","DOIUrl":"https://doi.org/10.1109/NETAPPS.2010.29","url":null,"abstract":"In this paper we propose a Packet-based measurement technique called Floating IP Active Measurement (FIPAM) that utilizes routing loop to measure Delay and Throughput in IP networks. Calculating these parameters in multi-provider and complex networks like Internet has became a challenge as most of current active measurement tools relying on ICMP and majority of today’s networks block ICMP traffics to prevent denial of service attacks. FIPAM uses IP protocol itself and allows flexible packet size, packet format and QoS parameters. Furthermore it offers more accuracy as it is not based on the time-stamps calculated in host computers that act as pairs. Here first we discuss advantages, the design and implementation of the technique. Then we define our measurement metric and explain how it can be used to calculate the mentioned parameters. To provide adequate support we have developed a test-bed to compare FIPAM with Ping. Our results show that our technique is a good replacement for Ping. We have also conducted a simulation scenario similar to the test-bed in OpNet Modeler and compared the results with the test-bed’s results. Finally we discuss the future direction of the research.","PeriodicalId":265699,"journal":{"name":"2010 Second International Conference on Network Applications, Protocols and Services","volume":"280 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122468271","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}
{"title":"Loss Detection and Recovery Techniques for TCP in Mobile Ad Hoc Network","authors":"Adib Habbal, S. Hassan","doi":"10.1109/NETAPPS.2010.16","DOIUrl":"https://doi.org/10.1109/NETAPPS.2010.16","url":null,"abstract":"Currently, Transmission Control Protocol (TCP) is the dominant protocol used in the Internet. It is the transport protocol that is responsible for the transmission of around 90% of the Internet traffic. TCP was originally designed for wired network where packet loss due to congestion dominates. Mobile Ad Hoc Network (MANET), one of the wireless networks, has special characteristics which cause several types of losses that are not related to congestion; leading to violate some design concepts of TCP because TCP handles any loss as a sign of congestion. In this paper, we provide an overview on MANET characteristics that cause packet loss. Afterwards, a survey on the recent solutions that propose loss detection and recovery techniques is conducted, placing special emphasis on proposals that preserve end-to-end semantic.","PeriodicalId":265699,"journal":{"name":"2010 Second International Conference on Network Applications, Protocols and Services","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131602377","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}