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.
Periodic reconfiguration of the virtual topology in transparent optical networks has been recently investigated as a mechanism to more efficiently adapt the network to predictable periodic traffic variations along the day or week. The scheduling of periodic reconfigurations should consider the trade-off between a lower network cost obtained through better resource allocation, and the undesired traffic...
This paper addresses offline virtual topology design in transparent optical networks under given periodic traffic. We call this planning problem ldquoScheduled Virtual Topology Designrdquo. Two problem variants are considered: for a network based on non-reconfigurable equipment and for a network based on reconfigurable equipment. Two MILP (Mixed Integer Linear Program) formulations are proposed, one...
We propose a linear formulation for traffic routing in optical networks after the virtual topology design (VTD). The formulation maximizes the amount of traffic the network is able to accept, through minimizing the residual capacity in established lightpaths. The results suggest that it is feasible to preserve enough open capacity to avoid disruption of connections and blocking of future traffic demands...
For a given network physical topology and traffic pattern, our objective is to design the logical topology and the routing algorithm on that topology so as to minimize the Congestion. The virtual topology design problem is a mixed integer linear formulation. Heuristic algorithms for this problem where suggested to relax MILP problem such as Heuristic Topology Design Algorithm (HLDA), the minimum-delay...
We propose a linear formulation for the flow routing of packets in virtual topology design (VTD) of optical networks. The formulation maximizes the established the future ability to accept additional traffic through optimization of the remaining idle capacity. The results suggest that t is feasible to preserve enough open capacity to avoid blocking of future traffic in networks with scarce resources.
This paper investigates offline planning and scheduling in transparent optical networks for a given periodic traffic demand. The main objective is to minimize the number of transceivers needed which make up for the main network cost. We call this problem ldquoScheduled Virtual Topology Designrdquo and consider two variants: non-reconfigurable and reconfigurable equipment. We formulate both problems...
Virtual topology design is an efficient approach to tackle the traffic-grooming problem which multiplexes low-granularity demands into high-granularity pipes in optical networks. But it is hard to deal with the demands with various physical constraints. In this paper, we propose a packing grooming with partial-combination algorithm (PPA) to address this issue. The PPA first routes low-granularity...
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.