In recent years, web technology carried on growing and at same time, the number of internet users increased significantly in number. Today, a Web server is capable of processing millions of requests per day, but during the peak period may collapse and becomes critical causing unavailability of the services offered by the servers. That is why Web server performance is a topic of great interest to many researchers. In this paper, we evaluate experimentally the impact of JSP and PHP dynamic content technology: JSP and PHP with access to a database of performance data of Apache Web server. Using the “ApacheBench” performance measurement tool, the approach is to compare the performances of four different configurations of a Web server, such as: Apache Web server implementing JSP technology with access to PostgreSQL database, Apache using PHP technology with the PostgreSQL as database, Apache Web server using the JSP technology with access to MySQL database, finally Apache and PHP with DBMS MySQL. At the end of this article, we also present a Simulink model of Web server performance based on the simple M/M/1 queue. During the modeling, the MATLAB software was used.
{"title":"Analysis and Simulink Modeling of the Performance of Dynamic Web Server Using JSP and PHP","authors":"Fontaine Rafamantanantsoa, Paulson Ravomampiandra","doi":"10.4236/CN.2018.104016","DOIUrl":"https://doi.org/10.4236/CN.2018.104016","url":null,"abstract":"In recent years, web technology carried on growing and at same time, the number of internet users increased significantly in number. Today, a Web server is capable of processing millions of requests per day, but during the peak period may collapse and becomes critical causing unavailability of the services offered by the servers. That is why Web server performance is a topic of great interest to many researchers. In this paper, we evaluate experimentally the impact of JSP and PHP dynamic content technology: JSP and PHP with access to a database of performance data of Apache Web server. Using the “ApacheBench” performance measurement tool, the approach is to compare the performances of four different configurations of a Web server, such as: Apache Web server implementing JSP technology with access to PostgreSQL database, Apache using PHP technology with the PostgreSQL as database, Apache Web server using the JSP technology with access to MySQL database, finally Apache and PHP with DBMS MySQL. At the end of this article, we also present a Simulink model of Web server performance based on the simple M/M/1 queue. During the modeling, the MATLAB software was used.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"56 1","pages":"196-210"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90317153","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}
Dileep Kumar Sajnani, Abdul Rasheed Mahesar, A. Lakhan, Irfan Ali Jamali
In a traditional Mobile Cloud Computing (MCC), a stream of data produced by mobile users (MUs) is uploaded to the remote cloud for additional processing throughout the Internet. Though, due to long WAN distance it causes high End to End latency. With the intention of minimize the average response time and key constrained Service Delay (network and cloudlet Delay) for mobile users (MUs), offload their workloads to the geographically distributed cloudlets network, we propose the Multi-layer Latency Aware Workload Assignment Strategy (MLAWAS) to allocate MUs workloads into optimal cloudlets, Simulation results demonstrate that MLAWAS earns the minimum average response time as compared with two other existing strategies.
{"title":"Latency Aware and Service Delay with Task Scheduling in Mobile Edge Computing","authors":"Dileep Kumar Sajnani, Abdul Rasheed Mahesar, A. Lakhan, Irfan Ali Jamali","doi":"10.4236/CN.2018.104011","DOIUrl":"https://doi.org/10.4236/CN.2018.104011","url":null,"abstract":"In a traditional Mobile Cloud Computing (MCC), a stream of data produced by mobile users (MUs) is uploaded to the remote cloud for additional processing throughout the Internet. Though, due to long WAN distance it causes high End to End latency. With the intention of minimize the average response time and key constrained Service Delay (network and cloudlet Delay) for mobile users (MUs), offload their workloads to the geographically distributed cloudlets network, we propose the Multi-layer Latency Aware Workload Assignment Strategy (MLAWAS) to allocate MUs workloads into optimal cloudlets, Simulation results demonstrate that MLAWAS earns the minimum average response time as compared with two other existing strategies.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"33 1","pages":"127-141"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87261539","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 research work aims at modelling a framework for Private Cloud infrastructure Deployment for Information and Communication Technology Centres (ICTs) in tertiary institutions in Nigeria. Recent researches have indicated that cloud computing will become the mainstream in computing technology and very effective for businesses. All Tertiary Institutions have ICT units, and are generally charged with the responsibilities of deploying ICT infrastructure and services for administration, teaching, research and learning in higher institution at large. The Structured System Analysis and Design Methodology (SSADM) is used in this research and a six-step framework for a cost effective and scalable Private cloud infrastructure using server virtualization is presented as an alternative that can guarantee total and independent control of data flow in the institutions, while ensuring adequate security of vital information.
{"title":"Modelling Conceptual Framework for Private Cloud Infrastructure Deployment in the ICT Centre of Tertiary Institutions","authors":"E. Ekwonwune, Chukwuma D. Anyiam, O. Osuagwu","doi":"10.4236/CN.2018.103010","DOIUrl":"https://doi.org/10.4236/CN.2018.103010","url":null,"abstract":"This research work aims at modelling a framework for Private Cloud infrastructure Deployment for Information and Communication Technology Centres (ICTs) in tertiary institutions in Nigeria. Recent researches have indicated that cloud computing will become the mainstream in computing technology and very effective for businesses. All Tertiary Institutions have ICT units, and are generally charged with the responsibilities of deploying ICT infrastructure and services for administration, teaching, research and learning in higher institution at large. The Structured System Analysis and Design Methodology (SSADM) is used in this research and a six-step framework for a cost effective and scalable Private cloud infrastructure using server virtualization is presented as an alternative that can guarantee total and independent control of data flow in the institutions, while ensuring adequate security of vital information.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"11 1","pages":"117-125"},"PeriodicalIF":0.0,"publicationDate":"2018-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91248307","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}
Collaborative filtering algorithm is the most widely used and recommended algorithm in major e-commerce recommendation systems nowadays. Concerning the problems such as poor adaptability and cold start of traditional collaborative filtering algorithms, this paper is going to come up with improvements and construct a hybrid collaborative filtering algorithm model which will possess excellent scalability. Meanwhile, this paper will also optimize the process based on the parameter selection of genetic algorithm and demonstrate its pseudocode reference so as to provide new ideas and methods for the study of parameter combination optimization in hybrid collaborative filtering algorithm.
{"title":"Research on Parameter Optimization in Collaborative Filtering Algorithm","authors":"Zijiang Zhu","doi":"10.4236/cn.2018.103009","DOIUrl":"https://doi.org/10.4236/cn.2018.103009","url":null,"abstract":"Collaborative filtering algorithm is the most widely used and recommended algorithm in major e-commerce recommendation systems nowadays. Concerning the problems such as poor adaptability and cold start of traditional collaborative filtering algorithms, this paper is going to come up with improvements and construct a hybrid collaborative filtering algorithm model which will possess excellent scalability. Meanwhile, this paper will also optimize the process based on the parameter selection of genetic algorithm and demonstrate its pseudocode reference so as to provide new ideas and methods for the study of parameter combination optimization in hybrid collaborative filtering algorithm.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"123 1","pages":"105-116"},"PeriodicalIF":0.0,"publicationDate":"2018-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80356560","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}
Emmanuel Kondela, A. Nungu, J. W. Matiko, J. S. Otim, B. Pehrson
We present a problem for benchmarking the robustness of cellular up-links, in an automatic weather station (AWS) testbed. Based on the problem, we conduct a small-scale measurement study of robustness, where the AWS is equipped with four (4) cellular modems for weather data delivery. The effectiveness of up-links is challenging because of overlapping spatial-temporal factors such as the presence of good reflectors that lead to multi-path effects, interference, network load or other reasons. We argue that, there is a strong need for independent assessments of their robustness, to perform end-to-end network measurement. However, it is yet difficult to go from a particular measurement to an assessment of the entire network. We extensively measure the variability of Radio Signal Strength (RSSI) as link metric on the cellular modems. The RSSI is one of the important link metrics that can determine the robustness of received RF signals, and explore how they differed from one another at a particular location and instant time. We also apply the statistical analysis that quantifies the level of stability by considering the robustness, referring short-term variation, and determines good up-link in comparison to weak one. The results show that the robustness of cellular up-links exists for an unpredictable period of time and lower than one could hope. More than 50% of up-links are intermittent. Therefore, we plan to extend our work by exploring RSSI thresholds, to develop a classification scheme supporting a decision whether a link is either intermittent or not. This will help in normalizing the level of stability, to design the RSSI estimation metric for the robust routing protocol in weather data networks.
{"title":"Benchmarking the Robustness of Cellular Up-Links in Automatic Weather Station Networks","authors":"Emmanuel Kondela, A. Nungu, J. W. Matiko, J. S. Otim, B. Pehrson","doi":"10.4236/CN.2018.103007","DOIUrl":"https://doi.org/10.4236/CN.2018.103007","url":null,"abstract":"We present a problem for benchmarking the robustness of cellular up-links, in an automatic weather station (AWS) testbed. Based on the problem, we conduct a small-scale measurement study of robustness, where the AWS is equipped with four (4) cellular modems for weather data delivery. The effectiveness of up-links is challenging because of overlapping spatial-temporal factors such as the presence of good reflectors that lead to multi-path effects, interference, network load or other reasons. We argue that, there is a strong need for independent assessments of their robustness, to perform end-to-end network measurement. However, it is yet difficult to go from a particular measurement to an assessment of the entire network. We extensively measure the variability of Radio Signal Strength (RSSI) as link metric on the cellular modems. The RSSI is one of the important link metrics that can determine the robustness of received RF signals, and explore how they differed from one another at a particular location and instant time. We also apply the statistical analysis that quantifies the level of stability by considering the robustness, referring short-term variation, and determines good up-link in comparison to weak one. The results show that the robustness of cellular up-links exists for an unpredictable period of time and lower than one could hope. More than 50% of up-links are intermittent. Therefore, we plan to extend our work by exploring RSSI thresholds, to develop a classification scheme supporting a decision whether a link is either intermittent or not. This will help in normalizing the level of stability, to design the RSSI estimation metric for the robust routing protocol in weather data networks.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"95 1","pages":"78-92"},"PeriodicalIF":0.0,"publicationDate":"2018-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90546377","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}
Coarse graining of complex networks is an important method to study large-scale complex networks, and is also in the focus of network science today. This paper tries to develop a new coarse-graining method for complex networks, which is based on the node similarity index. From the information structure of the network node similarity, the coarse-grained network is extracted by defining the local similarity and the global similarity index of nodes. A large number of simulation experiments show that the proposed method can effectively reduce the size of the network, while maintaining some statistical properties of the original network to some extent. Moreover, the proposed method has low computational complexity and allows people to freely choose the size of the reduced networks.
{"title":"Coarse Graining Method Based on Noded Similarity in Complex Network","authors":"Yingying Wang, Zhen Jia, Lang Zeng","doi":"10.4236/cn.2018.103005","DOIUrl":"https://doi.org/10.4236/cn.2018.103005","url":null,"abstract":"Coarse graining of complex networks is an important method to study large-scale complex networks, and is also in the focus of network science today. This paper tries to develop a new coarse-graining method for complex networks, which is based on the node similarity index. From the information structure of the network node similarity, the coarse-grained network is extracted by defining the local similarity and the global similarity index of nodes. A large number of simulation experiments show that the proposed method can effectively reduce the size of the network, while maintaining some statistical properties of the original network to some extent. Moreover, the proposed method has low computational complexity and allows people to freely choose the size of the reduced networks.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"1 1","pages":"51-64"},"PeriodicalIF":0.0,"publicationDate":"2018-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72516173","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}
E. Ekwonwune, Nwachukwu Catherine Ada Ngozi, O. O. Eberechi
Road Traffic monitoring involves the collection of data describing the characteristic of vehicles and their movement through road networks. Such data may be used for one of these purposes such as law enforcement, congestion and incident detection and increasing road capacity. Transportation is a requirement for every nation regardless of its economy, political stability, population size and technological development. Movement of goods and people from one place to another is crucial to maintain strong economic and political ties between the various components of any given nation among nations. However, there are different modes of transportation and the most paramount one to human beings is road transportation. Due to increase in the modes of transportation, road users encounter different problems such as road blockage and incidents. Therefore there is need to monitor users incidents and to know the causes. Road traffic monitoring can be done manually or using ICT devices. This paper focuses on how the use of ICT devices can enhance road traffic monitoring. It traces the brief history of transportation; it equally discussed road traffic and safety, tools for monitoring road traffic, Intelligent Transportation Systems (ITS) use for traffic monitoring and their benefits. The result shows that the use of ICT devices in road traffic monitoring should be a Millennium Goal for all developed and developing countries because of its numerous advantages in the reduction of the intensity of traffic and other road incidents.
{"title":"ICT Devices: Vital Tools for Enhancing Road Traffic Monitoring","authors":"E. Ekwonwune, Nwachukwu Catherine Ada Ngozi, O. O. Eberechi","doi":"10.4236/CN.2018.103004","DOIUrl":"https://doi.org/10.4236/CN.2018.103004","url":null,"abstract":"Road Traffic monitoring involves the collection of data describing the characteristic of vehicles and their movement through road networks. Such data may be used for one of these purposes such as law enforcement, congestion and incident detection and increasing road capacity. Transportation is a requirement for every nation regardless of its economy, political stability, population size and technological development. Movement of goods and people from one place to another is crucial to maintain strong economic and political ties between the various components of any given nation among nations. However, there are different modes of transportation and the most paramount one to human beings is road transportation. Due to increase in the modes of transportation, road users encounter different problems such as road blockage and incidents. Therefore there is need to monitor users incidents and to know the causes. Road traffic monitoring can be done manually or using ICT devices. This paper focuses on how the use of ICT devices can enhance road traffic monitoring. It traces the brief history of transportation; it equally discussed road traffic and safety, tools for monitoring road traffic, Intelligent Transportation Systems (ITS) use for traffic monitoring and their benefits. The result shows that the use of ICT devices in road traffic monitoring should be a Millennium Goal for all developed and developing countries because of its numerous advantages in the reduction of the intensity of traffic and other road incidents.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"47 1 1","pages":"43-50"},"PeriodicalIF":0.0,"publicationDate":"2018-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77775299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Recently, some coarse-graining methods based on network synchronization have been proposed to reduce the network size while preserving the synchronizability of the original network. In this paper, we investigate the effects of the coarse graining process on synchronizability over complex networks under different average path lengths and different degrees of distribution. A large amount of experiments demonstrate a close correlation between the average path length, the heterogeneity of the degree distribution and the ability of spectral coarse-grained scheme in preserving the network synchronizability. We find that synchronizability can be well preserved in spectral coarse-grained networks when the considered networks have a longer average path length or a larger degree of variance.
{"title":"Influence of Topological Properties of Complex Networks on the Effect of Spectral Coarse-Grained Network","authors":"Lang Zeng, Zhen Jia, Yingying Wang","doi":"10.4236/CN.2018.103008","DOIUrl":"https://doi.org/10.4236/CN.2018.103008","url":null,"abstract":"Recently, some coarse-graining methods based on network synchronization have been proposed to reduce the network size while preserving the synchronizability of the original network. In this paper, we investigate the effects of the coarse graining process on synchronizability over complex networks under different average path lengths and different degrees of distribution. A large amount of experiments demonstrate a close correlation between the average path length, the heterogeneity of the degree distribution and the ability of spectral coarse-grained scheme in preserving the network synchronizability. We find that synchronizability can be well preserved in spectral coarse-grained networks when the considered networks have a longer average path length or a larger degree of variance.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"37 1","pages":"93-104"},"PeriodicalIF":0.0,"publicationDate":"2018-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79166967","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}
Designing an excellent original topology not only improves the accuracy of routing, but also improves the restoring rate of failure. In this paper, we propose a new heuristic topology generation algorithm—GA-PODCC (Genetic Algorithm based on the Pareoto Optimality of Delay, Configuration and Consumption), which utilizes a genetic algorithm to optimize the link delay and resource configuration/consumption. The novelty lies in designing the two stages of genetic operation: The first stage is to pick the best population by means of the crossover, mutation, and selection operation; The second stage is to select an excellent individual from the best population. The simulation results show that, using the same number of nodes, GA-PODCC algorithm improves the balance of all the three optimization objectives, maintaining a low level of distortion in topology aggregation.
设计一个优秀的原始拓扑不仅可以提高路由的精度，而且可以提高故障的恢复率。本文提出了一种新的启发式拓扑生成算法ga - podcc (Genetic Algorithm based on the Pareoto Optimality of Delay, Configuration and Consumption)，该算法利用遗传算法对链路延迟和资源配置/消耗进行优化。其新颖之处在于设计了两个阶段的遗传操作:第一阶段是通过交叉、突变和选择操作来挑选最优群体;第二阶段是从最优群体中选择一个优秀的个体。仿真结果表明，在节点数相同的情况下，GA-PODCC算法提高了三个优化目标的均衡性，保持了较低的拓扑聚合失真水平。
{"title":"Design of a Heuristic Topology Generation Algorithm in Multi-Domain Optical Networks","authors":"Lei Wang, Hua Feng, Li Lin, Li Du","doi":"10.4236/CN.2018.103006","DOIUrl":"https://doi.org/10.4236/CN.2018.103006","url":null,"abstract":"Designing an excellent original topology not only improves the accuracy of routing, but also improves the restoring rate of failure. In this paper, we propose a new heuristic topology generation algorithm—GA-PODCC (Genetic Algorithm based on the Pareoto Optimality of Delay, Configuration and Consumption), which utilizes a genetic algorithm to optimize the link delay and resource configuration/consumption. The novelty lies in designing the two stages of genetic operation: The first stage is to pick the best population by means of the crossover, mutation, and selection operation; The second stage is to select an excellent individual from the best population. The simulation results show that, using the same number of nodes, GA-PODCC algorithm improves the balance of all the three optimization objectives, maintaining a low level of distortion in topology aggregation.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"130 1","pages":"65-77"},"PeriodicalIF":0.0,"publicationDate":"2018-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87679517","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}
Hani H. Attar, Mohammad Alhihi, Mohammad Samour, A. Solyman, Shmatkov Sergiy Igorovich, Kuchuk Nina Georgievna, Fawaz Khalil
The optimal load distribution over a set of independent paths for Multi-Protocol Label Switching for Traffic Engineering (MPLS-TE) networks is regarded as important issue; accordingly, this paper has developed a mathematical method of optimal procedures for choosing the shortest path. As a criterion for choosing the number of paths, a composite criterion is used that takes into account several parameters such as total path capacity and maximum path delay. The mathematical analysis of using the developed method is carried out, and the simulation results show that there are a limited number of the most significant routes that can maximize the composite quality of service indicator, which depends on the network connectivity and the amount of the traffic. The developed technological proposals allow increasing the utilization factor of the network by 20%.
{"title":"A Mathematical Model for Managing the Distribution of Information Flows for MPLS-TE Networks under Critical Conditions","authors":"Hani H. Attar, Mohammad Alhihi, Mohammad Samour, A. Solyman, Shmatkov Sergiy Igorovich, Kuchuk Nina Georgievna, Fawaz Khalil","doi":"10.4236/CN.2018.102003","DOIUrl":"https://doi.org/10.4236/CN.2018.102003","url":null,"abstract":"The optimal load distribution over a set of independent paths for Multi-Protocol Label Switching for Traffic Engineering (MPLS-TE) networks is regarded as important issue; accordingly, this paper has developed a mathematical method of optimal procedures for choosing the shortest path. As a criterion for choosing the number of paths, a composite criterion is used that takes into account several parameters such as total path capacity and maximum path delay. The mathematical analysis of using the developed method is carried out, and the simulation results show that there are a limited number of the most significant routes that can maximize the composite quality of service indicator, which depends on the network connectivity and the amount of the traffic. The developed technological proposals allow increasing the utilization factor of the network by 20%.","PeriodicalId":91826,"journal":{"name":"... IEEE Conference on Communications and Network Security. IEEE Conference on Communications and Network Security","volume":"42 1","pages":"31-42"},"PeriodicalIF":0.0,"publicationDate":"2018-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76480989","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
扫码关注我们
求助内容：
应助结果提醒方式：