Multiple virtual networks are constructed by using network virtualization technology on a substrate network with network resources. By using virtual service resources, a particular service can be provided with users over each virtual network. Moreover, network virtualization for mobile users has been expected in the future network service. In mobile virtual networks, mobile user moves from a node to other nodes and connects to other access points frequently. Therefore, the traffic on each link and each node in the virtual network changes. Because the quality of the service depends on the amount of traffic on links and nodes, the quality of services changes according to the user’s movement. This paper proposes replacement algorithm of virtual service resources with dynamic resource allocation based on traffic change for mobile applications in virtual networks. In our proposed method, the amount of resources for each node and that for each link are changed based on the traffic change. Moreover, the virtual service resource moves to the adjacent node from a node, and this replacement is repeated until the quality of service satisfies the requested quality. With our proposed method, it is expected that the quality of service can be maintained for mobile users even if the amount of traffic changes. We evaluate the performance of our proposed method with simulation. In numerical examples, it is shown that our proposed method is effective when a larger number users move and the amount of traffic changes.
{"title":"Replacement Algorithm of Virtual Service Resources with Dynamic Resource Allocation Based on Traffic Change in Virtual Networks","authors":"Sakie Horiuchi, T. Tachibana","doi":"10.12691/jcn-5-1-2","DOIUrl":"https://doi.org/10.12691/jcn-5-1-2","url":null,"abstract":"Multiple virtual networks are constructed by using network virtualization technology on a substrate network with network resources. By using virtual service resources, a particular service can be provided with users over each virtual network. Moreover, network virtualization for mobile users has been expected in the future network service. In mobile virtual networks, mobile user moves from a node to other nodes and connects to other access points frequently. Therefore, the traffic on each link and each node in the virtual network changes. Because the quality of the service depends on the amount of traffic on links and nodes, the quality of services changes according to the user’s movement. This paper proposes replacement algorithm of virtual service resources with dynamic resource allocation based on traffic change for mobile applications in virtual networks. In our proposed method, the amount of resources for each node and that for each link are changed based on the traffic change. Moreover, the virtual service resource moves to the adjacent node from a node, and this replacement is repeated until the quality of service satisfies the requested quality. With our proposed method, it is expected that the quality of service can be maintained for mobile users even if the amount of traffic changes. We evaluate the performance of our proposed method with simulation. In numerical examples, it is shown that our proposed method is effective when a larger number users move and the amount of traffic changes.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2018-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77672586","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}
Bakare K. Ayeni, Junaidu B. Sahalu, Kolawole R. Adeyanju
With improvement in computing and technological advancements, web-based applications are now ubiquitous on the Internet. However, these web applications are becoming prone to vulnerabilities which have led to theft of confidential information, data loss, and denial of data access in the course of information transmission. Cross-site scripting (XSS) is a form of web security attack which involves the injection of malicious codes into web applications from untrusted sources. Interestingly, recent research studies on the web application security centre focus on attack prevention and mechanisms for secure coding; recent methods for those attacks do not only generate high false positives but also have little considerations for the users who oftentimes are the victims of malicious attacks. Motivated by this problem, this paper describes an “intelligent” tool for detecting cross-site scripting flaws in web applications. This paper describes the method implemented based on fuzzy logic to detect classic XSS weaknesses and to provide some results on experimentations. Our detection framework recorded 15% improvement in accuracy and 0.01% reduction in the false-positive rate which is considerably lower than that found in the existing work by Koli et al. Our approach also serves as a decision-making tool for the users.
{"title":"Detecting Cross-Site Scripting in Web Applications Using Fuzzy Inference System","authors":"Bakare K. Ayeni, Junaidu B. Sahalu, Kolawole R. Adeyanju","doi":"10.1155/2018/8159548","DOIUrl":"https://doi.org/10.1155/2018/8159548","url":null,"abstract":"With improvement in computing and technological advancements, web-based applications are now ubiquitous on the Internet. However, these web applications are becoming prone to vulnerabilities which have led to theft of confidential information, data loss, and denial of data access in the course of information transmission. Cross-site scripting (XSS) is a form of web security attack which involves the injection of malicious codes into web applications from untrusted sources. Interestingly, recent research studies on the web application security centre focus on attack prevention and mechanisms for secure coding; recent methods for those attacks do not only generate high false positives but also have little considerations for the users who oftentimes are the victims of malicious attacks. Motivated by this problem, this paper describes an “intelligent” tool for detecting cross-site scripting flaws in web applications. This paper describes the method implemented based on fuzzy logic to detect classic XSS weaknesses and to provide some results on experimentations. Our detection framework recorded 15% improvement in accuracy and 0.01% reduction in the false-positive rate which is considerably lower than that found in the existing work by Koli et al. Our approach also serves as a decision-making tool for the users.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1155/2018/8159548","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64737545","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}
Today’s Mobile Ad hoc Networks (MANETs) became a popular issue for scientists, and diverse studies have been made to increase the performance of ad hoc networks. In MANET nodes compromise to forward packets for each other communicate beyond their transmission range. The mobile nodes communicate with each other without any infrastructure. As wireless ad-hoc networks lack an infrastructure, they are exposed to a lot of attacks [1]. One of these attacks called Wormhole Attack that two adversary node collaborate together to transmit the packets in out of band channel. In this paper, performance of Ad hoc on-Demand Distance Vector (AODV) Protocol and Dynamic Source Routing (DSR) protocol are evaluated in presence of wormhole attack and without wormhole attack with Constant Bit Rate (CBR) traffic under dissimilar scalable network mobility. Also we evaluate effect and compare it with standard protocol in term of Packet Delivery Ratio, throughput and End to End Delay via simulation, using Network Simulation2 (NS2) for our research.
{"title":"Performance evaluation of routing protocol on AODV and DSR under wormhole attack","authors":"M. G. Sanaei, I. Isnin, M. Bakhtiari","doi":"10.47277/ijcncs/1(1)1","DOIUrl":"https://doi.org/10.47277/ijcncs/1(1)1","url":null,"abstract":"Today’s Mobile Ad hoc Networks (MANETs) became a popular issue for scientists, and diverse studies have been made to increase the performance of ad hoc networks. In MANET nodes compromise to forward packets for each other communicate beyond their transmission range. The mobile nodes communicate with each other without any infrastructure. As wireless ad-hoc networks lack an infrastructure, they are exposed to a lot of attacks [1]. One of these attacks called Wormhole Attack that two adversary node collaborate together to transmit the packets in out of band channel. In this paper, performance of Ad hoc on-Demand Distance Vector (AODV) Protocol and Dynamic Source Routing (DSR) protocol are evaluated in presence of wormhole attack and without wormhole attack with Constant Bit Rate (CBR) traffic under dissimilar scalable network mobility. Also we evaluate effect and compare it with standard protocol in term of Packet Delivery Ratio, throughput and End to End Delay via simulation, using Network Simulation2 (NS2) for our research.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70809534","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}
This work introduces characteristics of twisted pair cables which play an important role in transferring data. In this paper, category 5 enhanced as a type of unshielded twisted pair cables was selected to verify all tests on it according to ISO/IEC 11801 as one of international standard specifications. Random samples were selected from cables market. All tests were done on these samples to make sure of using validity and complying with the international standard. After testing the selected samples, it is found that 4% are not satisfying the international standard specification while as 96% are satisfying the international standard specification.
{"title":"Performance testing of twisted pair cables","authors":"Ahmed F. Mahmoud, M. Abd-Allah","doi":"10.1155/2008/586427","DOIUrl":"https://doi.org/10.1155/2008/586427","url":null,"abstract":"This work introduces characteristics of twisted pair cables which play an important role in transferring data. In this paper, category 5 enhanced as a type of unshielded twisted pair cables was selected to verify all tests on it according to ISO/IEC 11801 as one of international standard specifications. Random samples were selected from cables market. All tests were done on these samples to make sure of using validity and complying with the international standard. After testing the selected samples, it is found that 4% are not satisfying the international standard specification while as 96% are satisfying the international standard specification.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1155/2008/586427","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64175214","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 consider a wireless ad hoc network with random access channel. We present a model that takes into account topology, routing, random access in MAC layer, and forwarding probability. In this paper, we focus on drawing benefit from the interaction of the MAC (governed by IEEE 802.11 or slotted Aloha) and routing by defining a new cross-layer scheme for routing based on the limit number of retransmission. By adjusting dynamically and judiciously this parameter in a saturated network, we have realized that both stability of forwarding queues and average throughput are significantly improved in linear networks with symmetric traffic: a gain of 100% can be reached. While in asymmetric topology network with asymmetric traffic, we achieve a better average delay (resp., throughput) for each connection without changing the average throughput (resp., delay). In addition, we show the efficiency of our new scheme in case of multimedia applications with delay constraint. A detailed performance study is presented using analytical and simulation evaluation.
{"title":"Dynamic retransmission limit scheme in MAC layer for routing in multihop ad hoc networks","authors":"Ralph El-Khoury, R. El-Azouzi","doi":"10.1155/2008/414073","DOIUrl":"https://doi.org/10.1155/2008/414073","url":null,"abstract":"We consider a wireless ad hoc network with random access channel. We present a model that takes into account topology, routing, random access in MAC layer, and forwarding probability. In this paper, we focus on drawing benefit from the interaction of the MAC (governed by IEEE 802.11 or slotted Aloha) and routing by defining a new cross-layer scheme for routing based on the limit number of retransmission. By adjusting dynamically and judiciously this parameter in a saturated network, we have realized that both stability of forwarding queues and average throughput are significantly improved in linear networks with symmetric traffic: a gain of 100% can be reached. While in asymmetric topology network with asymmetric traffic, we achieve a better average delay (resp., throughput) for each connection without changing the average throughput (resp., delay). In addition, we show the efficiency of our new scheme in case of multimedia applications with delay constraint. A detailed performance study is presented using analytical and simulation evaluation.","PeriodicalId":45621,"journal":{"name":"Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1155/2008/414073","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64170383","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
扫码关注我们
求助内容：
应助结果提醒方式：