The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper we first report on an optimization process for assessing the sensitivity on CAPEX of the most important parameters of IP-aggregation / IP-core and WDM transport networks. We then combine resulting transport network topologies with content delivery functions placed in caches. We analyze their impact on network CAPEX and optimize content delivery deployment for specific scenarios. We consider...
In this paper we assess the sensitivity of the most important topological parameters of an all-IP network with WDM transport planes with respect to a capital expenditure (CAPEX) optimization. We consider conservative and progressive traffic growth scenarios applied to several access network architectures in an effort to identify optimum metro and core router locations.
Optical code-division multiplexing (OCDM) over wavelength-division multiplexing network technology is of interest for all-optical networks because it has many channels and can create a secure network. However, OCDM networks experience a cycle-attack problem due to multi-access interference propagation; if the problem occurs, all transferred signals cannot be decoded. To avoid this problem, the OCDM...
PTN is a new generation of connection -oriented technology, it not only can run the carrier-class Ethernet services, and also can concord with the traditional TDM service well. In this paper, based on mature, stable SDH devices management, network topology management, and process management, we design a new PTN network management module, in which we rebuild and update some database model and logic...
With new optical transport systems able to provide sub-wavelength granularity, the dynamic characteristics of the network are expected to strongly increase. Furthermore, such properties are highly related to the underlying physical network topology, which in turn require from the control plane important features such as scalability, dynamism and automatism. In this paper we analyze the properties...
In IP over WDM networks, a single failure in the WDM layer breaks down multiple IP links and may leave the virtual topology disconnected. This will make the restoration by the IP layer impossible, which must be avoided by suitable virtual topology design. In this paper, we focus on single-node failure and develop a Remove-Node Algorithm to map IP links on lightpaths in such a way that the IP topology...
This paper investigates the implications of topologies on the average path length of networks, which is the dominant parameter affecting performance. Based on the available literature, classic network topologies are reviewed and analyzed. Furthermore, a new class of communication networks is introduced, and a topology design algorithm is proposed to improve network performance in terms of average...
Future networks require virtual network topology management method using distributed PCEs for multi-layer multi-domain path computations. Once a path is established within a lower layer, it can be used as a data link in an upper layer and it can be advertised as a Traffic Engineering Link and exploited in the path computation by an upper layer. This paper presents cross-layer provisioning system architecture...
Link-disjoint routing strategy can offer a set of reliable alternate paths when the active best path fails. However, simply employing a set of fully disjointed paths may not necessarily result in the efficient network resource utilization in some circumstances, which degrades the performance of the network system under a highly loaded traffic condition. In this study, we propose two heuristic link-disjoint...
This work examines protection of multicast sessions in optical networks utilizing a novel segment-based algorithm called Level Protection. Our proposed scheme exhibits improved performance compared to other segment-based multicast protection schemes.
While partitioning a network for scalability and manageability purposes, we identify the significance of survivability of individual partitions. We formulate and solve “2-SRLG-connected” topology partitioning using a flexible mapping onto the physical topology.
The rise of large-scale Data Centers to power the Internet infrastructure is driving new architectural directions for optical networking. This paper highlights these architectural options and discusses technology building blocks for scaling inter-Datacenter connectivity.
We report a network design algorithm to effectively reduce the cost and power consumption of translucent networks by using all-optical 2R regenerators. Simulation results show that the number of O/E/O 3R can be effectively reduced.
We propose a MILP based design model for energy reduction in IP over dynamic optical networks. By virtual topology reconfiguration, it can dynamically switch off unnecessary networking equipments, and reduce the power caused by over-provision. Simulation results indicate that the proposed design can significantly improve network energy performance.
In this paper, we propose a topology-based Multicast-Capable (MC) nodes placement heuristic - Power Attenuation Constrained Placement (PACP) in amplifier-less power attenuation constrained all- optical metropolitan area network (AL-MAN). We define a selection function in our algorithm to find the 'best' locations in the network for a given number of MC nodes to achieve good performance in overall...
Generalized Survivable Network (GSN) can improve the performance of Optical Flow Switched (OFS) network in short flow (<;1 sec) scenario. We solve the design problem of OFS network with GSN for arbitrary mesh topologies. The framework is generic and achieves significant savings compared with the typical algorithm.
Population characteristics such as density or dispersion are heavily used in exploring the viability of infrastructure investments and telecommunication networks' development, but not much attention has been paid to the effects of distribution of population sizes. In this paper, a fast method is presented for estimating the backbone network cost using population size distribution as an input parameter,...
The combination of deflection routing and burst retransmission is an attractive scheme for resolving the burst contention problem in Optical Burst Switching (OBS) networks. Most of previous works on hybrid schemes use simulation approach to prove the efficicency. In this paper, we develop an analytical model for obtaining the overall burst loss ratio of an OBS network that take into account deflection...
This paper proposes a protocol proxy scheme that can emulate the open shortest path first (OSPF) protocol in an effective and flexible manner. It is implemented in our developed network emulator, which is used to test network controllers for IP optical network management. In the protocol scheme, OSPF protocol emulation is achieved by combining an OSPF protocol proxy (introduced here) and an OSPF peer...
In this paper an analysis of modified degree 5 chordal rings is presented. First modified graphs and reference graphs (ideal and optimal) have been defined, and it is shown that the reference graphs are useful for estimation of average path length and diameter in both original and modified graphs. Then the comparison of basic graph parameters, diameter and average path length, is given for original...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.