B. Obeidat, A. Abdallah, N. Aqqad, Abdel Hakeem Oqlah M. Akhoershiedah, M. Maqableh
Understanding the various effects that exist among intellectual capital, knowledge sharing, and organizational performance is the main purpose of this study. Data were gathered from 356 employees working in manufacturing companies in Jordan. In order to test the hypotheses of this study, the approach suggested by [1] was undertaken. The results of the analysis revealed that intellectual capital had a positive effect on organizational performance and knowledge sharing. The results also showed that knowledge sharing had a positive effect on organizational performance. Finally, it was found that knowledge sharing had a positive mediating effect on the relationship between intellectual capital and organizational performance. The findings of this study thus provide many benefits for researchers and practitioners despite the presence of some limitations.
{"title":"The Effect of Intellectual Capital on Organizational Performance: The Mediating Role of Knowledge Sharing","authors":"B. Obeidat, A. Abdallah, N. Aqqad, Abdel Hakeem Oqlah M. Akhoershiedah, M. Maqableh","doi":"10.4236/CN.2017.91001","DOIUrl":"https://doi.org/10.4236/CN.2017.91001","url":null,"abstract":"Understanding the various effects that exist among intellectual capital, knowledge sharing, and organizational performance is the main purpose of this study. Data were gathered from 356 employees working in manufacturing companies in Jordan. In order to test the hypotheses of this study, the approach suggested by [1] was undertaken. The results of the analysis revealed that intellectual capital had a positive effect on organizational performance and knowledge sharing. The results also showed that knowledge sharing had a positive effect on organizational performance. Finally, it was found that knowledge sharing had a positive mediating effect on the relationship between intellectual capital and organizational performance. The findings of this study thus provide many benefits for researchers and practitioners despite the presence of some limitations.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"40 1","pages":"1-27"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74617028","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}
A. Abdallah, B. Obeidat, N. Aqqad, Marwa Na’el Khalil Al Janini, Samer Eid Dahiyat
The purpose of this research is to investigate the interrelationships among the three behavioural constructs of job involvement, job satisfaction and organizational commitment. Accordingly, a structural model is developed to delineate the interactions among these constructs and explore the mediating effect of job satisfaction on the relationship between job involvement and organizational commitment. A questionnaire-based survey was designed to test the aforementioned model based on a dataset of 315 employees working in twelve out of twenty six banks operating in the capital city of Jordan, Amman. The model and posited hypotheses were tested using structural equation modelling analysis. The results indicated that job involvement positively and significantly affects job satisfaction and organizational commitment. Additionally, job satisfaction proved to be positively related to organizational commitment. Furthermore, job satisfaction positively and significantly partially mediated the relationship between job involvement and organizational commitment.
{"title":"An Integrated Model of Job Involvement, Job Satisfaction and Organizational Commitment: A Structural Analysis in Jordan’s Banking Sector","authors":"A. Abdallah, B. Obeidat, N. Aqqad, Marwa Na’el Khalil Al Janini, Samer Eid Dahiyat","doi":"10.4236/CN.2017.91002","DOIUrl":"https://doi.org/10.4236/CN.2017.91002","url":null,"abstract":"The purpose of this research is to investigate the interrelationships among the three behavioural constructs of job involvement, job satisfaction and organizational commitment. Accordingly, a structural model is developed to delineate the interactions among these constructs and explore the mediating effect of job satisfaction on the relationship between job involvement and organizational commitment. A questionnaire-based survey was designed to test the aforementioned model based on a dataset of 315 employees working in twelve out of twenty six banks operating in the capital city of Jordan, Amman. The model and posited hypotheses were tested using structural equation modelling analysis. The results indicated that job involvement positively and significantly affects job satisfaction and organizational commitment. Additionally, job satisfaction proved to be positively related to organizational commitment. Furthermore, job satisfaction positively and significantly partially mediated the relationship between job involvement and organizational commitment.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"22 1","pages":"28-53"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73804159","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}
Mohamed El-Hihi, Hani H. Attar, A. Solyman, L. Stanković
Network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years by combining the received packet randomly before forwarding them, resulting in a complex Jordan Gaussian Elimination (JGE) decoding process. The effectiveness of random NC is through cooperation among nodes. In this paper, we propose a simple, low-complexity cooperative protocol that exploits NC in a deterministic manner resulting in improved diversity, data rate, and less complex JGE decoding process. The proposed system is applied over a lossy wireless network. The scenario under investigation is as follows: M users must send their information to a common destination D and to exchange the information between each others, over erasure channels; typically the channels between the users and the destination are worse than the channels between users. It is possible to significantly reduce the traffic among users and destination, achieving significant bandwidth savings, by combining packets from different users in simple, deterministic ways without resorting to extensive header information before being forwarded to the destination and the M users. The key problem we try to address is how to efficiently combine the packets at each user while exploiting user cooperation and the probability of successfully recovering information from all users at D with k 1 to 10ˉ4, because of the proposed combining algorithm that enables the nodes to generate additional unique linear equations to broadcast rather than repeating the same ones via ARQ. Moreover, the number of the transmitted packets in each cooperative stage dropped from M (M - 1) to just M packets, resulting to 2 M packets instead 2 (M2 - 1) when three stages of transmission system are used instead of one stage (two cooperative stages).
{"title":"Network coding cooperation performance analysis in wireless network over a lossy channel, M users and a destination scenario","authors":"Mohamed El-Hihi, Hani H. Attar, A. Solyman, L. Stanković","doi":"10.4236/CN.2016.84023","DOIUrl":"https://doi.org/10.4236/CN.2016.84023","url":null,"abstract":"Network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years by combining the received packet randomly before forwarding them, resulting in a complex Jordan Gaussian Elimination (JGE) decoding process. The effectiveness of random NC is through cooperation among nodes. In this paper, we propose a simple, low-complexity cooperative protocol that exploits NC in a deterministic manner resulting in improved diversity, data rate, and less complex JGE decoding process. The proposed system is applied over a lossy wireless network. The scenario under investigation is as follows: M users must send their information to a common destination D and to exchange the information between each others, over erasure channels; typically the channels between the users and the destination are worse than the channels between users. It is possible to significantly reduce the traffic among users and destination, achieving significant bandwidth savings, by combining packets from different users in simple, deterministic ways without resorting to extensive header information before being forwarded to the destination and the M users. The key problem we try to address is how to efficiently combine the packets at each user while exploiting user cooperation and the probability of successfully recovering information from all users at D with k 1 to 10ˉ4, because of the proposed combining algorithm that enables the nodes to generate additional unique linear equations to broadcast rather than repeating the same ones via ARQ. Moreover, the number of the transmitted packets in each cooperative stage dropped from M (M - 1) to just M packets, resulting to 2 M packets instead 2 (M2 - 1) when three stages of transmission system are used instead of one stage (two cooperative stages).","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"70 1","pages":"257-280"},"PeriodicalIF":0.0,"publicationDate":"2016-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88532260","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 : 2016-10-01Epub Date: 2017-02-23DOI: 10.1109/CNS.2016.7860464
Yanyan Li, Mengjun Xie, Jiang Bian
Many studies have been conducted to apply behavioral biometric authentication on/with mobile devices and they have shown promising results. However, the concern about the verification accuracy of behavioral biometrics is still common given the dynamic nature of behavioral biometrics. In this paper, we address the accuracy concern from a new perspective-behavior segments, that is, segments of a gesture instead of the whole gesture as the basic building block for behavioral biometric authentication. With this unique perspective, we propose a new behavioral biometric authentication method called SegAuth, which can be applied to various gesture or motion based authentication scenarios. SegAuth can achieve high accuracy by focusing on each user's distinctive gesture segments that frequently appear across his or her gestures. In SegAuth, a time series derived from a gesture/motion is first partitioned into segments and then transformed into a set of string tokens in which the tokens representing distinctive, repetitive segments are associated with higher genuine probabilities than those tokens that are common across users. An overall genuine score calculated from all the tokens derived from a gesture is used to determine the user's authenticity. We have assessed the effectiveness of SegAuth using 4 different datasets. Our experimental results demonstrate that SegAuth can achieve higher accuracy consistently than existing popular methods on the evaluation datasets.
{"title":"SegAuth: A Segment-based Approach to Behavioral Biometric Authentication.","authors":"Yanyan Li, Mengjun Xie, Jiang Bian","doi":"10.1109/CNS.2016.7860464","DOIUrl":"https://doi.org/10.1109/CNS.2016.7860464","url":null,"abstract":"<p><p>Many studies have been conducted to apply behavioral biometric authentication on/with mobile devices and they have shown promising results. However, the concern about the verification accuracy of behavioral biometrics is still common given the dynamic nature of behavioral biometrics. In this paper, we address the accuracy concern from a new perspective-behavior segments, that is, segments of a gesture instead of the whole gesture as the basic building block for behavioral biometric authentication. With this unique perspective, we propose a new behavioral biometric authentication method called SegAuth, which can be applied to various gesture or motion based authentication scenarios. SegAuth can achieve high accuracy by focusing on each user's distinctive gesture segments that frequently appear across his or her gestures. In SegAuth, a time series derived from a gesture/motion is first partitioned into segments and then transformed into a set of string tokens in which the tokens representing distinctive, repetitive segments are associated with higher genuine probabilities than those tokens that are common across users. An overall genuine score calculated from all the tokens derived from a gesture is used to determine the user's authenticity. We have assessed the effectiveness of SegAuth using 4 different datasets. Our experimental results demonstrate that SegAuth can achieve higher accuracy consistently than existing popular methods on the evaluation datasets.</p>","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"2016 ","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CNS.2016.7860464","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35053029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The aim of this research is to explore the role of Knowledge Management (KM) infrastructure (organizational culture, organizational structure and information technology) in enhancing job satisfaction at Aqaba five star hotels located in Jordan. A total of 216 questionnaires containing 33 items were used to collect information from the respondents. Multiple regression analysis was conducted to test the research hypotheses. Results of the current study revealed that there is a significant positive impact of KM infrastructure on job satisfaction and these results are in line with the results of the previous studies mentioned in the literature, and also revealed that the dimensions of KM infrastructure that has the highest effect on job satisfaction are organizational culture followed by information technology; whereas the variable of organizational structure has not significant impact on it. Results of T-test showed that there is no significant difference in the impact of KM infrastructure towards job satisfaction in favor of gender. In addition, results of ANOVA test found that there are significant differences in the impact of KM infrastructure on job satisfaction that can be attributed to age, educational level, and personal income.
{"title":"The Role of Knowledge Management Infrastructure in Enhancing Job Satisfaction at Aqaba Five Star Hotels in Jordan","authors":"R. Masa’deh","doi":"10.4236/CN.2016.84021","DOIUrl":"https://doi.org/10.4236/CN.2016.84021","url":null,"abstract":"The aim of this research is to explore the role of Knowledge Management (KM) infrastructure (organizational culture, organizational structure and information technology) in enhancing job satisfaction at Aqaba five star hotels located in Jordan. A total of 216 questionnaires containing 33 items were used to collect information from the respondents. Multiple regression analysis was conducted to test the research hypotheses. Results of the current study revealed that there is a significant positive impact of KM infrastructure on job satisfaction and these results are in line with the results of the previous studies mentioned in the literature, and also revealed that the dimensions of KM infrastructure that has the highest effect on job satisfaction are organizational culture followed by information technology; whereas the variable of organizational structure has not significant impact on it. Results of T-test showed that there is no significant difference in the impact of KM infrastructure towards job satisfaction in favor of gender. In addition, results of ANOVA test found that there are significant differences in the impact of KM infrastructure on job satisfaction that can be attributed to age, educational level, and personal income.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"10 1","pages":"219-240"},"PeriodicalIF":0.0,"publicationDate":"2016-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81925459","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}
The origin of Mobile ad hoc network (MANET) was started in 1970 as packet radio network (PRNET), later on different researches were made on it in different ages. MANET works under no fixed infrastructure in which every node works likes a router that stores and forwards packet to final destination. Due to its dynamic topology, MANET can be created anywhere, anytime. As there are limited resources in MANET so it faces many problems such as security, limited bandwidth, range and power constraints. Due to this, many new routing protocols are proposed. This article examines different techniques to manage congestion control, security issues, different layers attacks, routing protocols and challenges that are faced by MANET.
{"title":"A Novel Review on Security and Routing Protocols in MANET","authors":"Muhammad Kashif Nazir, R. Rehman, Atif Nazir","doi":"10.4236/CN.2016.84020","DOIUrl":"https://doi.org/10.4236/CN.2016.84020","url":null,"abstract":"The origin of Mobile ad hoc network (MANET) was started in 1970 as packet radio network (PRNET), later on different researches were made on it in different ages. MANET works under no fixed infrastructure in which every node works likes a router that stores and forwards packet to final destination. Due to its dynamic topology, MANET can be created anywhere, anytime. As there are limited resources in MANET so it faces many problems such as security, limited bandwidth, range and power constraints. Due to this, many new routing protocols are proposed. This article examines different techniques to manage congestion control, security issues, different layers attacks, routing protocols and challenges that are faced by MANET.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"68 7","pages":"205-218"},"PeriodicalIF":0.0,"publicationDate":"2016-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72424155","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}
Network Coding (NC) is a recent technique which is used to improve the transmission data rate and the power efficiency. These goals are obtained by combining data together before transmitting them, resulting to less transmitted data that carry the same amount of information. NC research work over the physical layer and the upper layers are popular and needed to be more investigated. In this paper, we propose a practical system of large-number of connected multi-source network coding (LMSNC), at the physical layer that exploits the broadcast nature of the wireless channel, using the practical and bandwidth-efficient schemes decode-and-forward (DF) and then compare it with Amplify and Forward (AF). The theoretical analysis and the simulation results show the effect of the noise when it cumulates in AF system and how DF is solving this severe default. Moreover, we consider the MSNC for Small-number of connected sources (SMSNC) and the two-way communication setup where two users exchange their information over an intermediate network node (ideally called Base Station), as two reference cases to compare with. With SMSNC, the number of necessary downlink transmissions from the intermediate node to the users is reduced, and thus the throughput is increased. Simulation results obtained using high-performance non-binary turbo codes, based on Partial Unit Memory (PUM) codes (4, 2, 1, 4) and (8, 4, 3, 8); confirm that combining PUM Turbo Code (PUMTC) and NC in the proposed MSNC setup gives almost the same BER performance as that for SMSNC at the small number of processing steps mainly when PUMTC (8, 4, 3, 8) is performed, which is required to retrieve the received coded messages. In the scenario of AF, combining packets results to cumulate the noise, which justifies the reason we decided to increase the number of transmitted coded messages in the network, i.e., the BER performance improves when sending extra coded messages. Finally, the possibility for a trade-off among BER, data rate and the number of transmitted coded messages is shown for LMSNC through graphics and simulation results.
{"title":"Physical Layer Deterministic Network Coding Using PUM Turbo Codes over AWGN Channel, N Nodes through a Base Station Scenario","authors":"Hani H. Attar","doi":"10.4236/CN.2016.84022","DOIUrl":"https://doi.org/10.4236/CN.2016.84022","url":null,"abstract":"Network Coding (NC) is a recent technique which is used to improve the transmission data rate and the power efficiency. These goals are obtained by combining data together before transmitting them, resulting to less transmitted data that carry the same amount of information. NC research work over the physical layer and the upper layers are popular and needed to be more investigated. In this paper, we propose a practical system of large-number of connected multi-source network coding (LMSNC), at the physical layer that exploits the broadcast nature of the wireless channel, using the practical and bandwidth-efficient schemes decode-and-forward (DF) and then compare it with Amplify and Forward (AF). The theoretical analysis and the simulation results show the effect of the noise when it cumulates in AF system and how DF is solving this severe default. Moreover, we consider the MSNC for Small-number of connected sources (SMSNC) and the two-way communication setup where two users exchange their information over an intermediate network node (ideally called Base Station), as two reference cases to compare with. With SMSNC, the number of necessary downlink transmissions from the intermediate node to the users is reduced, and thus the throughput is increased. Simulation results obtained using high-performance non-binary turbo codes, based on Partial Unit Memory (PUM) codes (4, 2, 1, 4) and (8, 4, 3, 8); confirm that combining PUM Turbo Code (PUMTC) and NC in the proposed MSNC setup gives almost the same BER performance as that for SMSNC at the small number of processing steps mainly when PUMTC (8, 4, 3, 8) is performed, which is required to retrieve the received coded messages. In the scenario of AF, combining packets results to cumulate the noise, which justifies the reason we decided to increase the number of transmitted coded messages in the network, i.e., the BER performance improves when sending extra coded messages. Finally, the possibility for a trade-off among BER, data rate and the number of transmitted coded messages is shown for LMSNC through graphics and simulation results.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"17 1","pages":"241-256"},"PeriodicalIF":0.0,"publicationDate":"2016-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81701226","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}
Osama Rababah, A. K. Hwaitat, S. Manaseer, H. Fakhouri, R. Halaseh
The rapid advancement in technology and the increased number of web applications with very short turnaround time caused an increased need for protection from vulnerabilities that grew due to decision makers overlooking the need to be protected from attackers or software developers lacking the skills and experience in writing secure code. Structured Query Language (SQL) Injection, cross-site scripting (XSS), Distributed Denial of service (DDos) and suspicious user behaviour are some of the common types of vulnerabilities in web applications by which the attacker can disclose the web application sensitive information such as credit card numbers and other confidential information. This paper proposes a framework for the detection and prevention of web threats (WTDPF) which is based on preventing the attacker from gaining access to confidential data by studying his behavior during the action of attack and taking preventive measures to reduce the risks of the attack and as well reduce the consequences of such malicious action. The framework consists of phases which begin with the input checking phase, signature based action component phase, alert and response phases. Additionally, the framework has a logging functionality to store and keep track of any action taking place and as well preserving information about the attacker IP address, date and time of the attack, type of the attack, and the mechanism the attacker used. Moreover, we provide experimental results for different kinds of attacks, and we illustrate the success of the proposed framework for dealing with and preventing malicious actions.
{"title":"Web Threats Detection and Prevention Framework","authors":"Osama Rababah, A. K. Hwaitat, S. Manaseer, H. Fakhouri, R. Halaseh","doi":"10.4236/cn.2016.83017","DOIUrl":"https://doi.org/10.4236/cn.2016.83017","url":null,"abstract":"The rapid advancement in technology and the increased number of web applications with very \u0000short turnaround time caused an increased need for protection from vulnerabilities that grew due \u0000to decision makers overlooking the need to be protected from attackers or software developers \u0000lacking the skills and experience in writing secure code. Structured Query Language (SQL) Injection, \u0000cross-site scripting (XSS), Distributed Denial of service (DDos) and suspicious user behaviour \u0000are some of the common types of vulnerabilities in web applications by which the attacker can \u0000disclose the web application sensitive information such as credit card numbers and other confidential \u0000information. This paper proposes a framework for the detection and prevention of web \u0000threats (WTDPF) which is based on preventing the attacker from gaining access to confidential \u0000data by studying his behavior during the action of attack and taking preventive measures to reduce \u0000the risks of the attack and as well reduce the consequences of such malicious action. The \u0000framework consists of phases which begin with the input checking phase, signature based action \u0000component phase, alert and response phases. Additionally, the framework has a logging functionality \u0000to store and keep track of any action taking place and as well preserving information about \u0000the attacker IP address, date and time of the attack, type of the attack, and the mechanism the attacker \u0000used. Moreover, we provide experimental results for different kinds of attacks, and we illustrate \u0000the success of the proposed framework for dealing with and preventing malicious actions.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"439 1","pages":"170-178"},"PeriodicalIF":0.0,"publicationDate":"2016-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82878377","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}
Traditionally, allocating of Ethernet Passive Optical Network (EPON) bandwidth schemes relied on a centralized architecture where their Optical Line Terminal (OLT) is the sole intelligent device with the capability for the arbitration of bandwidth based on time-division access for the upstream shared channel. However, any breakdown in the OLT bandwidth allocation will affect the allotment for Optical Network Units (ONUs). Few researches had dealt with a decentralized approach for the EPON and most of the solutions proposed involved additional cost by adding new complex devices to the original architecture. This paper proposes an intelligent decentralized mechanism in EPON that enhances the network performance using intelligent agents specification based on the IEEE 802.3 ah standards in the foundation for intelligent physical agent which is compatible with an Internet Protocol (IP)-based network. Specifically, this paper proposes a novel distributed scheme that supports differentiated services and ensures QoS for both Inter-and Intra- ONU allocation. The proposed mechanism introduces a unique direct communication between the ONUs supported by identical dynamic bandwidth allocation algorithms running simultaneously in each ONU. In addition to being fully distributed, the proposed scheme is asynchronous, scalable, and dynamic with flexibility and reliability in handling data, voice and video.
{"title":"Decentralized Traffic Control Using Agents in Ethernet Passive Optical Networks (EPON)","authors":"S. Sadon, H. M. Hizan, T. Kanesan, R. Mohamad","doi":"10.4236/CN.2016.83019","DOIUrl":"https://doi.org/10.4236/CN.2016.83019","url":null,"abstract":"Traditionally, allocating of Ethernet Passive Optical Network (EPON) bandwidth schemes relied on \u0000a centralized architecture where their Optical Line Terminal (OLT) is the sole intelligent device \u0000with the capability for the arbitration of bandwidth based on time-division access for the upstream \u0000shared channel. However, any breakdown in the OLT bandwidth allocation will affect the \u0000allotment for Optical Network Units (ONUs). Few researches had dealt with a decentralized approach \u0000for the EPON and most of the solutions proposed involved additional cost by adding new \u0000complex devices to the original architecture. This paper proposes an intelligent decentralized \u0000mechanism in EPON that enhances the network performance using intelligent agents specification \u0000based on the IEEE 802.3 ah standards in the foundation for intelligent physical agent which is \u0000compatible with an Internet Protocol (IP)-based network. Specifically, this paper proposes a novel \u0000distributed scheme that supports differentiated services and ensures QoS for both Inter-and Intra- \u0000ONU allocation. The proposed mechanism introduces a unique direct communication between the \u0000ONUs supported by identical dynamic bandwidth allocation algorithms running simultaneously in \u0000each ONU. In addition to being fully distributed, the proposed scheme is asynchronous, scalable, \u0000and dynamic with flexibility and reliability in handling data, voice and video.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"103 1","pages":"193-203"},"PeriodicalIF":0.0,"publicationDate":"2016-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87905356","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}
G. A. Sukkar, Ramzi R. Saifan, Sufian M Khwaldeh, M. Maqableh, I. Jafar
Networks have become an integral part of today’s world. The ease of deployment, low-cost and high data rates have contributed significantly to their popularity. There are many protocols that are tailored to ease the process of establishing these networks. Nevertheless, security-wise precautions were not taken in some of them. In this paper, we expose some of the vulnerability that exists in a commonly and widely used network protocol, the Address Resolution Protocol (ARP) protocol. Effectively, we will implement a user friendly and an easy-to-use tool that exploits the weaknesses of this protocol to deceive a victim’s machine and a router through creating a sort of Man-in-the-Middle (MITM) attack. In MITM, all of the data going out or to the victim machine will pass first through the attacker’s machine. This enables the attacker to inspect victim’s data packets, extract valuable data (like passwords) that belong to the victim and manipulate these data packets. We suggest and implement a defense mechanism and tool that counters this attack, warns the user, and exposes some information about the attacker to isolate him. GNU/Linux is chosen as an operating system to implement both the attack and the defense tools. The results show the success of the defense mechanism in detecting the ARP related attacks in a very simple and efficient way.
{"title":"Address Resolution Protocol (ARP): Spoofing Attack and Proposed Defense","authors":"G. A. Sukkar, Ramzi R. Saifan, Sufian M Khwaldeh, M. Maqableh, I. Jafar","doi":"10.4236/CN.2016.83012","DOIUrl":"https://doi.org/10.4236/CN.2016.83012","url":null,"abstract":"Networks have become an integral part of today’s world. The ease of deployment, low-cost and high data rates have contributed significantly to their popularity. There are many protocols that are tailored to ease the process of establishing these networks. Nevertheless, security-wise precautions were not taken in some of them. In this paper, we expose some of the vulnerability that exists in a commonly and widely used network protocol, the Address Resolution Protocol (ARP) protocol. Effectively, we will implement a user friendly and an easy-to-use tool that exploits the weaknesses of this protocol to deceive a victim’s machine and a router through creating a sort of Man-in-the-Middle (MITM) attack. In MITM, all of the data going out or to the victim machine will pass first through the attacker’s machine. This enables the attacker to inspect victim’s data packets, extract valuable data (like passwords) that belong to the victim and manipulate these data packets. We suggest and implement a defense mechanism and tool that counters this attack, warns the user, and exposes some information about the attacker to isolate him. GNU/Linux is chosen as an operating system to implement both the attack and the defense tools. The results show the success of the defense mechanism in detecting the ARP related attacks in a very simple and efficient way.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"3 1","pages":"118-130"},"PeriodicalIF":0.0,"publicationDate":"2016-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89925716","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
扫码关注我们
求助内容：
应助结果提醒方式：