Pub Date : 2020-02-15DOI: 10.1109/ICCSII.2012.6454511
Fatma M. Qatan, I. Damaj
Security in embedded systems has become a main requirement in modern electronic devices. The demand for low-cost and highly secure cryptographic algorithms is increasingly growing in fields such as mobile telecommunications, handheld devices, etc. In this paper, we analyze and evaluate the development of cheap and relatively fast hardware implementations of the KATAN family of block ciphers. KATAN is a family of six hardware oriented block ciphers. All KATAN ciphers share an 80-bit key and have 32, 48, or 64-bit blocks. We use VHDL under Altera Quartus in conjunction with ModelSim to implement and analyze our hardware designs. The developed designs are mapped onto high-performance Field Programmable Gate Arrays. We compare our findings with similar hardware implementations and C software versions of the algorithms. The performance analysis of the C implementations is done using Intel Vtune Amplifier running on Dell precision T7500 with its dual quad-core Xeon processor and 24 GB of RAM. The obtained results show better performance when compared with existing hardware and software implementations.
{"title":"High-speed KATAN ciphers on-a-chip","authors":"Fatma M. Qatan, I. Damaj","doi":"10.1109/ICCSII.2012.6454511","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454511","url":null,"abstract":"Security in embedded systems has become a main requirement in modern electronic devices. The demand for low-cost and highly secure cryptographic algorithms is increasingly growing in fields such as mobile telecommunications, handheld devices, etc. In this paper, we analyze and evaluate the development of cheap and relatively fast hardware implementations of the KATAN family of block ciphers. KATAN is a family of six hardware oriented block ciphers. All KATAN ciphers share an 80-bit key and have 32, 48, or 64-bit blocks. We use VHDL under Altera Quartus in conjunction with ModelSim to implement and analyze our hardware designs. The developed designs are mapped onto high-performance Field Programmable Gate Arrays. We compare our findings with similar hardware implementations and C software versions of the algorithms. The performance analysis of the C implementations is done using Intel Vtune Amplifier running on Dell precision T7500 with its dual quad-core Xeon processor and 24 GB of RAM. The obtained results show better performance when compared with existing hardware and software implementations.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130926534","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 : 2012-12-01DOI: 10.1109/ICCSII.2012.6454554
O. Al-Aqel, T. Ozkul, T. Landalosi
It is clear that the future is in deploying wireless technologies in Industrial environments. Nowadays, all different fields which depend on networking try to convert those networks into wireless ones in order to minimize cost and time. Obviously, Industry is one of those fields. This paper investigates the suitability and the ways of applying wireless solutions to the current network standards available in the industry. Fieldbus is one of those standards on which our investigation will be built. Different wireless technologies will be investigated in order to see which standard is suitable to be applied on the fieldbus industrial network; among such technologies are Wi-Fi IEEE 802.11, Zigbee IEEE 802.15 and Bluetooth. Those technologies are chosen because they are nearly suitable in applying them to Fieldbus Industrial Networking through analyzing there effects on the Industrial Environment. Wireless IEEE 802.11 will be our primary focus because it has the features and the capabilities to be nearly applied on the fieldbus standard in the industrial plants and it is the most used technology in the market as well as will as its familiarity. Wireless will be applied between different fieldbus segments of the network by maintaining the current fieldbus standard inside each one. Our approach will be tested using simulation tools; mainly the Matlab, in order to prove the suitability of applying wireless technology in the industrial network. Different key performance metrics will be addressed in order to see how the network performance will be improved after applying the wireless technology within it.
{"title":"Design and development of wireless foundation fieldbus industrial networks","authors":"O. Al-Aqel, T. Ozkul, T. Landalosi","doi":"10.1109/ICCSII.2012.6454554","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454554","url":null,"abstract":"It is clear that the future is in deploying wireless technologies in Industrial environments. Nowadays, all different fields which depend on networking try to convert those networks into wireless ones in order to minimize cost and time. Obviously, Industry is one of those fields. This paper investigates the suitability and the ways of applying wireless solutions to the current network standards available in the industry. Fieldbus is one of those standards on which our investigation will be built. Different wireless technologies will be investigated in order to see which standard is suitable to be applied on the fieldbus industrial network; among such technologies are Wi-Fi IEEE 802.11, Zigbee IEEE 802.15 and Bluetooth. Those technologies are chosen because they are nearly suitable in applying them to Fieldbus Industrial Networking through analyzing there effects on the Industrial Environment. Wireless IEEE 802.11 will be our primary focus because it has the features and the capabilities to be nearly applied on the fieldbus standard in the industrial plants and it is the most used technology in the market as well as will as its familiarity. Wireless will be applied between different fieldbus segments of the network by maintaining the current fieldbus standard inside each one. Our approach will be tested using simulation tools; mainly the Matlab, in order to prove the suitability of applying wireless technology in the industrial network. Different key performance metrics will be addressed in order to see how the network performance will be improved after applying the wireless technology within it.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127206805","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 : 2012-12-01DOI: 10.1109/ICCSII.2012.6454380
S. Fujii, Y. Taniguchi, G. Hasegawa, H. Nakano
In this paper, we propose a method for estimating the number of pedestrians walking in opposite directions, as in the case of a corridor. The proposed method utilizes a ceiling-mounted compound-eye sensor composed of two binary sensors with partially overlapping sensing regions. The output of the compound-eye sensor is sent to a monitoring server, where a number of Monte Carlo simulations are conducted. The simulation scenario with the smallest difference from the output history of the compound-eye sensor is selected as an estimate of the number of pedestrians. Simulations show that in crowded situations the relative error in the proposed method decreases by up to 45% compared to an existing method.
{"title":"Monte Carlo-based Bi-directional pedestrian counting with compound-eye sensor","authors":"S. Fujii, Y. Taniguchi, G. Hasegawa, H. Nakano","doi":"10.1109/ICCSII.2012.6454380","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454380","url":null,"abstract":"In this paper, we propose a method for estimating the number of pedestrians walking in opposite directions, as in the case of a corridor. The proposed method utilizes a ceiling-mounted compound-eye sensor composed of two binary sensors with partially overlapping sensing regions. The output of the compound-eye sensor is sent to a monitoring server, where a number of Monte Carlo simulations are conducted. The simulation scenario with the smallest difference from the output history of the compound-eye sensor is selected as an estimate of the number of pedestrians. Simulations show that in crowded situations the relative error in the proposed method decreases by up to 45% compared to an existing method.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128106124","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 : 2012-12-01DOI: 10.1109/ICCSII.2012.6454540
H. Nishijima, T. Yakoh
Minimum delay Ethernet switch was designed and implemented to construct Synchronous TDMA network. To minimize packet forwarding delay, a novel signal forwarding technique is introduced. The goal of this paper is realizing smaller delay than previous software based S-TDMA switch. The first point is discussion about some factors of delay and design to reduce them. In general, cut-through switch realizes shorter delay than store and forward switch. The proposed technique can realize shorter delay than cut-through switch in principle. To realize shorter delay, this paper proposed an implementation on FPGA boards. In addition, developing measurement equipment using FPGA and comparison between usual switch are also conducted. Experimental results of implemented hubs showed five times shorter delay and smaller jitter than usual software based implementation and other Ethernet switches. The maximum delay to transmit packet through each implemented switch in this paper was 400ns. This implement achieved low maximum delay of 1744ns and jitter of 40ns in 5-hops network. At the end of this paper, discussion about other delay factors and its affect to S-TDMA performance are also concluded.
{"title":"Minimum delay switch for Synchronous TDMA network","authors":"H. Nishijima, T. Yakoh","doi":"10.1109/ICCSII.2012.6454540","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454540","url":null,"abstract":"Minimum delay Ethernet switch was designed and implemented to construct Synchronous TDMA network. To minimize packet forwarding delay, a novel signal forwarding technique is introduced. The goal of this paper is realizing smaller delay than previous software based S-TDMA switch. The first point is discussion about some factors of delay and design to reduce them. In general, cut-through switch realizes shorter delay than store and forward switch. The proposed technique can realize shorter delay than cut-through switch in principle. To realize shorter delay, this paper proposed an implementation on FPGA boards. In addition, developing measurement equipment using FPGA and comparison between usual switch are also conducted. Experimental results of implemented hubs showed five times shorter delay and smaller jitter than usual software based implementation and other Ethernet switches. The maximum delay to transmit packet through each implemented switch in this paper was 400ns. This implement achieved low maximum delay of 1744ns and jitter of 40ns in 5-hops network. At the end of this paper, discussion about other delay factors and its affect to S-TDMA performance are also concluded.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133895027","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 : 2012-12-01DOI: 10.1109/ICCSII.2012.6454588
M. Aboelaze, N. Mohaghegh, M. Shehata
Service provisioning for Internet servers, as well as many other servers, plays a very important role in the cost and performance of the server. Service/content providers are required to maintain a certain Quality of Service (QoS) either contractually or implicitly in order not to lose customers. In this paper we investigate the control theoretic approaches for service provisioning. We compare between 2 widely used approaches and a simple technique we propose for admission control in order to maintain the agreed upon QoS. We show using simulation that our proposed technique is more stable, needs less overhead, and produce better results than these 2 previously proposed techniques.
{"title":"Response time control for web servers under realistic traffic patterns","authors":"M. Aboelaze, N. Mohaghegh, M. Shehata","doi":"10.1109/ICCSII.2012.6454588","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454588","url":null,"abstract":"Service provisioning for Internet servers, as well as many other servers, plays a very important role in the cost and performance of the server. Service/content providers are required to maintain a certain Quality of Service (QoS) either contractually or implicitly in order not to lose customers. In this paper we investigate the control theoretic approaches for service provisioning. We compare between 2 widely used approaches and a simple technique we propose for admission control in order to maintain the agreed upon QoS. We show using simulation that our proposed technique is more stable, needs less overhead, and produce better results than these 2 previously proposed techniques.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131418980","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 : 2012-12-01DOI: 10.1109/ICCSII.2012.6454498
Ghada Almashaqbeh
Recent advances in the fields of data computing and communication systems lead to new trends in utilizing technologies in daily life applications. In this context, e-Health, which is an emerging field that tends to utilize the evolving technologies in health and medical applications, comes to provide effective solutions for healthcare. This paper has the objective of promoting the current and future roles of computers in supporting e-Health. This is done by examining the current behavior of computer users toward their health and then suggesting new solutions accordingly. A survey targeted university students has been conducted to analyze how they take care of their health and whether computers and Internet can help. The collected responses show that those students have a little amount of health-related information. Also, they do not pay much attention for the most primitive healthy tips such as sporting or eating healthy food. In addition, it is found that despite the long daily usage of computers and Internet, students do not exploit these technologies to promote their life style to be healthier. The survey results represent the main motivation for PHA (Personal Health Assistant) project which is also introduced in this paper. PHA simulates an advanced healthcare center that provides services like gym, nutrition room, diet organizer and tracker, body indicators measurements such as heart rate and blood pressure, etc. This is done to allow busy people to get fast and trusted healthcare at anytime, anywhere basis using their personal digital devices.
数据计算和通信系统领域的最新进展导致了在日常生活中应用技术的新趋势。在这种情况下，电子保健作为一个新兴领域，往往利用保健和医疗应用方面不断发展的技术，为保健提供有效的解决方案。本文的目的是促进计算机在支持电子健康方面的当前和未来角色。这是通过检查计算机用户当前的健康行为，然后相应地提出新的解决方案来完成的。一项针对大学生的调查分析了他们如何照顾自己的健康，以及电脑和互联网是否能有所帮助。收集到的回答显示，这些学生有少量的健康相关信息。此外，他们不太注意最原始的健康提示，如运动或吃健康的食物。此外，研究发现，尽管学生每天长时间使用电脑和互联网，但他们并没有利用这些技术来促进他们更健康的生活方式。调查结果代表了PHA (Personal Health Assistant，个人健康助理)项目的主要动机，本文也对此进行了介绍。PHA模拟了一个先进的医疗保健中心，提供健身房、营养室、饮食管理和跟踪器、心率和血压等身体指标测量等服务。这样做是为了让忙碌的人们随时随地使用他们的个人数字设备获得快速和可靠的医疗保健。
{"title":"Computers and e-Health: Roles and new applications","authors":"Ghada Almashaqbeh","doi":"10.1109/ICCSII.2012.6454498","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454498","url":null,"abstract":"Recent advances in the fields of data computing and communication systems lead to new trends in utilizing technologies in daily life applications. In this context, e-Health, which is an emerging field that tends to utilize the evolving technologies in health and medical applications, comes to provide effective solutions for healthcare. This paper has the objective of promoting the current and future roles of computers in supporting e-Health. This is done by examining the current behavior of computer users toward their health and then suggesting new solutions accordingly. A survey targeted university students has been conducted to analyze how they take care of their health and whether computers and Internet can help. The collected responses show that those students have a little amount of health-related information. Also, they do not pay much attention for the most primitive healthy tips such as sporting or eating healthy food. In addition, it is found that despite the long daily usage of computers and Internet, students do not exploit these technologies to promote their life style to be healthier. The survey results represent the main motivation for PHA (Personal Health Assistant) project which is also introduced in this paper. PHA simulates an advanced healthcare center that provides services like gym, nutrition room, diet organizer and tracker, body indicators measurements such as heart rate and blood pressure, etc. This is done to allow busy people to get fast and trusted healthcare at anytime, anywhere basis using their personal digital devices.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115002143","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 : 2012-12-01DOI: 10.1109/ICCSII.2012.6454398
S. Bani-Mohammad, I. Ababneh, Mohammad Yassen
In non-contiguous allocation, a job request can be split into smaller parts that are allocated possibly non-adjacent free sub-meshes rather than always waiting until a single sub-mesh of the requested size and shape is available. Lifting the contiguity condition is expected to reduce processor fragmentation and increase system utilization. However, the distances traversed by messages can be long, and as a result the communication overhead, especially contention, is increased. The extra communication overhead depends on how the allocation request is partitioned and assigned to free sub-meshes. In this paper, a new non-contiguous processor allocation strategy, referred to as A Compacting Non-Contiguous Processor Allocation Strategy (CNCPA), is suggested for the 2D mesh networks. In the proposed strategy, a single job is compacting into more than one free location within the allocated processors, where the remaining available processors (free processors) form a large sub-mesh in the system. To evaluate the performance improvement achieved by the proposed strategy and compare it against well-known existing non-contiguous allocation strategies, we conduct extensive simulation experiments under the assumption of wormhole routing and the one-to-all and near neighbor communication patterns. The results show that the proposed strategy can eliminate both the internal and external fragmentation and reduce the communication overhead and hence improve performance in terms of job turnaround time and system utilization.
{"title":"Non-contiguous processor allocation in the mesh-connected multicomputers using compaction","authors":"S. Bani-Mohammad, I. Ababneh, Mohammad Yassen","doi":"10.1109/ICCSII.2012.6454398","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454398","url":null,"abstract":"In non-contiguous allocation, a job request can be split into smaller parts that are allocated possibly non-adjacent free sub-meshes rather than always waiting until a single sub-mesh of the requested size and shape is available. Lifting the contiguity condition is expected to reduce processor fragmentation and increase system utilization. However, the distances traversed by messages can be long, and as a result the communication overhead, especially contention, is increased. The extra communication overhead depends on how the allocation request is partitioned and assigned to free sub-meshes. In this paper, a new non-contiguous processor allocation strategy, referred to as A Compacting Non-Contiguous Processor Allocation Strategy (CNCPA), is suggested for the 2D mesh networks. In the proposed strategy, a single job is compacting into more than one free location within the allocated processors, where the remaining available processors (free processors) form a large sub-mesh in the system. To evaluate the performance improvement achieved by the proposed strategy and compare it against well-known existing non-contiguous allocation strategies, we conduct extensive simulation experiments under the assumption of wormhole routing and the one-to-all and near neighbor communication patterns. The results show that the proposed strategy can eliminate both the internal and external fragmentation and reduce the communication overhead and hence improve performance in terms of job turnaround time and system utilization.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126167411","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 : 2012-12-01DOI: 10.1109/ICCSII.2012.6454407
B. Nguyen, V. Tran, L. Hluchý
In this paper, we present a novel approach for developing services that can be deployed in different cloud infrastructures at the same time. The approach provides an instrument with emphasis on abstraction, inheritance and code reuse. Then, cloud-based services are developed easily by extending existing abstractions classes provided by the instrument or other developers. The interoperability between different clouds is solved by the basic abstraction classes of the instrument and all services are inherited and benefited from the advantage.
{"title":"Abstraction approach for developing and delivering cloud-based services","authors":"B. Nguyen, V. Tran, L. Hluchý","doi":"10.1109/ICCSII.2012.6454407","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454407","url":null,"abstract":"In this paper, we present a novel approach for developing services that can be deployed in different cloud infrastructures at the same time. The approach provides an instrument with emphasis on abstraction, inheritance and code reuse. Then, cloud-based services are developed easily by extending existing abstractions classes provided by the instrument or other developers. The interoperability between different clouds is solved by the basic abstraction classes of the instrument and all services are inherited and benefited from the advantage.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125044663","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 : 2012-12-01DOI: 10.1109/ICCSII.2012.6454384
M. Hagal, F. H. Fazzani
Extracting excellent requirements is one of the challenges that face the software developers. The characteristics of excellent requirements are concise, complete, necessary, unambiguous and consistent. Within a context where there is a lack of common understanding of what must be traced especially in generating consistency requirements, a number of methods have been proposed to software requirements consistency and traceability. Many of these dealing with requirements consistency using inconsistency rules given by software customer which may inadequate. This paper provides a guideline approach based on a visual technique that helps to reduce the degree of inconsistency which may appear by redundancy of tasks in more than one requirements.
{"title":"A use case map as a visual approach to reduce the degree of inconsistency","authors":"M. Hagal, F. H. Fazzani","doi":"10.1109/ICCSII.2012.6454384","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454384","url":null,"abstract":"Extracting excellent requirements is one of the challenges that face the software developers. The characteristics of excellent requirements are concise, complete, necessary, unambiguous and consistent. Within a context where there is a lack of common understanding of what must be traced especially in generating consistency requirements, a number of methods have been proposed to software requirements consistency and traceability. Many of these dealing with requirements consistency using inconsistency rules given by software customer which may inadequate. This paper provides a guideline approach based on a visual technique that helps to reduce the degree of inconsistency which may appear by redundancy of tasks in more than one requirements.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131042855","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 : 2012-12-01DOI: 10.1109/ICCSII.2012.6454492
N. Amdouni, M. Koubàa, T. Aguili
In this paper, we propose a novel lightpath rerouting algorithm to optimize network resources allocation in WDM all-optical networks in order to set up an incoming lightpath demand to be blocked for lack of resources or due to the absence of a suitable path and a suitable wavelength that meet the minimum Quality of Transmission (QoT) requirements. Indeed, in such networks, transmitted optical signal has to traverse crossconnect switches, fiber segments and optical amplifiers. Thus, while propagating through the network, the signal may degrade in quality as it encounters crosstalk at the cross-connect switches and collects amplified spontaneous emission noise at the optical amplifiers. Since these impairments continue to degrade the signal quality as it progresses toward its destination, the received Bit Error Rate (BER) at the destination node might become unacceptably high. Rerouting aims at reassigning the wavelength and/or the path of one or several established connections in order to free enough wavelengths to satisfy the incoming demand. Rerouting refers implicitly to dynamic traffic. Simulation results show that our algorithm improves the rejection ratio and is less CPU time consuming than rerouting algorithms previously presented in the literature.
{"title":"A novel lightpath rerouting algorithm for dynamic traffic with transmission impairments consideration in WDM all-optical networks","authors":"N. Amdouni, M. Koubàa, T. Aguili","doi":"10.1109/ICCSII.2012.6454492","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454492","url":null,"abstract":"In this paper, we propose a novel lightpath rerouting algorithm to optimize network resources allocation in WDM all-optical networks in order to set up an incoming lightpath demand to be blocked for lack of resources or due to the absence of a suitable path and a suitable wavelength that meet the minimum Quality of Transmission (QoT) requirements. Indeed, in such networks, transmitted optical signal has to traverse crossconnect switches, fiber segments and optical amplifiers. Thus, while propagating through the network, the signal may degrade in quality as it encounters crosstalk at the cross-connect switches and collects amplified spontaneous emission noise at the optical amplifiers. Since these impairments continue to degrade the signal quality as it progresses toward its destination, the received Bit Error Rate (BER) at the destination node might become unacceptably high. Rerouting aims at reassigning the wavelength and/or the path of one or several established connections in order to free enough wavelengths to satisfy the incoming demand. Rerouting refers implicitly to dynamic traffic. Simulation results show that our algorithm improves the rejection ratio and is less CPU time consuming than rerouting algorithms previously presented in the literature.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132162531","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
扫码关注我们
求助内容：
应助结果提醒方式：