scholarly journals Utilization Balancing Algorithms for Dynamic Multicast Scheduling Problem in EON

2016 ◽  
Vol 62 (4) ◽  
pp. 363-370 ◽  
Author(s):  
Marcin Markowski
Keyword(s):  
Communication Networks ◽  
Heuristic Algorithms ◽  
Data Transfer ◽  
Optical Network ◽  
Scheduling Problem ◽  
Present Communication ◽  
Elastic Optical Network ◽  
Link Utilization ◽  
Dynamic Multicast ◽  
Multicast Scheduling

Abstract Dynamic data transfer demands are often being a challenge for present communication networks, as they appear in unpredictable time and must be satisfied prior to deadline. Important kind are the multi-target demands occurring in task of replication, backup, database synchronization or file transferring in pear-to-pear networks. Optimal scheduling usually depends of the nature of transport network. In the paper dynamic deadline-driven multicast scheduling problem over elastic optical network is considered. Particularly, the method for improving link utilization by traffic balance for multicast demands is proposed. Few heuristic algorithms and results of experiments, proving the benefits of balancing concept are presented

scholarly journals CUSTOMER ACCESS NETWORKING ON THE BASIS OF ETHERNET FTTH, PON TECHNOLOGIES

2017 ◽  
Vol 21 (1) ◽  
pp. 8-15
Author(s):  
A. M. Belitsky ◽  
R. R. Ivanenko ◽  
A. V. Besedin ◽  
A. Y. Klochkov
Keyword(s):  
Communication Networks ◽  
Data Transfer ◽  
Low Cost ◽  
Optical Network ◽  
Access Point ◽  
Passive Optical Network ◽  
Optical Networking ◽  
Home Networks ◽  
Fiber To The Home ◽  
Telephone Exchange

Nowadays, one of the trends of information and communication networks development is the provision within the shortest time of a larger number of telecommunication services to network users. Currently, connection of subscribers to xDSL communication channels provided by public switched telephone networks (PSTN) is widespread. Providers of classic telephony make active use of these networks due to the low cost of the connection of a subscriber. An obvious disadvantage of this connection type is the limited data transfer rate. Some Internet providers rapidly develop ETTH (Ethernet To The Home) networks. The advantage of ETTH networks is the targeting of the delivery of communication services to subscribers. One of the disadvantages is the operation of a network at the Ethernet level with all typical for this protocol features. The practice of optical networking has existed for many years; however, the basic approach to optical networking is based on the use of active equipment from the access node to users. PON-based (Passive Optical Network) FTTH architecture (Fiber To The Home) is as a rule, compatible with the Ethernet Protocol. The article shows the advantages of the deployment of PON-based FTTH networks, in particular, saving of fiber-optic lines in the area from the optical splitters to the Central telephone exchange or access point by using relevant ports. The article provides the description of access networks architecture applying Ethernet FTTH and PON technologies, and also discusses the prospects for further development of the above mentioned networks.

Limitation of Erlang B Traffic Model in Elastic Optical Network for Blocking Probability Estimation

2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Ujjwal ◽  
Jaisingh Thangaraj
Keyword(s):  
Blocking Probability ◽  
Optical Network ◽  
Constant Load ◽  
Traffic Model ◽  
Service Rate ◽  
Service Provisioning ◽  
Connection Request ◽  
Elastic Optical Network ◽  
Simulation Results ◽  
Single Path

Abstract In this paper, an algorithm for multipath connection provisioning in elastic optical network (EON) has been proposed. Initially, the algorithm prefers the single-path routing for service provisioning. But when single-path routing is not adequate to serve a dynamic connection, the algorithm switches to the connection request fragmentation. Its computation is based on the parameters such as capacity_constant and capacity_allowed to fragment the connection request on disjoint paths. Simulation results clearly state that the proposed algorithm performs well in service provisioning as compared to the traditional single-path routing algorithms and improves the average network throughput. Thereafter, we have investigated the limitation of Erlang B traffic model in EON for calculation of link blocking probability using routing and spectrum assignment (RSA) algorithm. It is verified by the following two ways: (i) effect on the blocking probability in case of constant load and (ii) effect of slot width on the blocking probability. Our simulation results indicate that in EON due to dynamic RSA, blocking probability is not constant in case of proportionate varying of call arrival and service rate giving constant load and blocking probability depends on the number of slots per link, but in Erlang B traffic model blocking probability is always constant in case of constant load and it considers wavelength per link instead of slots per link. This is attributed to the fact that Erlang B traffic model fails to calculate blocking probability accurately in EON. We have computed the carried traffic on 14 nodes, 21-link National Science Foundation Network (NSFNET) topology.

Sign in / Sign up

Export Citation Format

Share Document