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.
This study deals with a strategy to save energy in an Internet protocol (IP) network allowing different subsets of IP links to be put in the sleep mode during different traffic periods. The proposed solution involves a three-phase algorithm. In the first phase, time-varying critical traffic matrices from a large collection of real traffic matrices are obtained. In the second phase, a local search...
In this paper, we study the tradeoff between two important traffic engineering objectives: load balance and energy efficiency. Although traditional commonly used multi-objective optimization methods can yield a Pareto efficient solution, they need to construct an aggregate objective function (AOF) or model one of the two objectives as a constraint in the optimization problem formulation. As a result,...
We propose an energy saving scheme for wireless access networks called FDS (Frequency Distribution Scheme), which associates frequency allocation with service classes. In this scheme we construct a multi-period algorithm and a TSM (Traffic Supervision Mechanism) to adaptively distribute as few frequencies as possible while still satisfy the traffic demand. We implement our scheme in a sample wireless...
When planning survivable WDM mesh networks, conventional solutions to provide differentiated reliability under shared risk link group (SRLG) constraints mostly assume explicit knowledge of traffic matrices, and consider the failure probability of a fiber link with single criteria (e.g., the link length). Due to the highly variation of nowadays demand patterns and multiple causes of SRLG failures,...
Intra-domain traffic engineering can significantly enhance the performance of large IP backbone networks. An important component of current methods for traffic engineering with link state routing protocols like OSPF is accurate knowledge of traffic matrix. However, the traffic matrix is unknown and varies with time. So it is important to obtain a traffic engineering method that is "robust"...
An important traffic engineering problem for OSPF networks is the determination of optimal link weights. In this paper, we assume that the traffic matrix, which specifies traffic load between every source-destination pair in the network, is unknown and varies with time, but that always lies inside an explicitly defined region. Our goal is to compute an optimal link weights that minimizes maximum link...
We propose a new optical hybrid switching solution that takes advantage of both Optical Burst Switching (OBS) and Optical Circuit Switching (OCS) technologies, namely, HyLABS (Hybrid Lightpath and Burst Switching). HyLABS uses static program optimized technology and dynamic switching between OCS and OBS, for network environment with uncertain and high bursty traffic demand. Our study shows that HyLABS...
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...
We address the issue of traffic-oblivious routing (i.e., robust routing) in WDM networks dealing with both link and node failures under load-balancing architectures. Two distinct schemes are proposed. One is static with the goal of minimizing total network cost given a set of multiple failures. The other considers dynamic network environment (i.e., connection requests arrive one after another), and...
Valiant load-balancing [1] (VLB) has attracted considerable research interest in recent years, as it guarantees 100% throughput for any traffic matrix satisfying hose model[2] constraints without obtaining precise traffic matrix. However, when the traffic variation tends to be gentle, the measurement of traffic demands between certain node pairs becomes feasible. Then it is likely to adjust the VLB...
In this paper, we propose a novel hybrid optical network design method, cycle-based hybrid switching optical networks (CHSON), to efficiently support bursty traffic patterns of current networks. CHSON integrates highly efficient transportation of optical circuit switching with statistical multiplexing of Optical burst switching. CHSON could not only reduce the strain on packet forwarding of traditional...
Sampling technology has been widely deployed in measurement systems to control memory consumption and processing overhead. However, most of the existing sampling methods suffer from large estimation errors in analyzing small-size flows. To address the problem, we propose a novel adaptive non-linear sampling (ANLS) method for passive measurement. Instead of statically configuring the sampling rate,...
Previous delay-based congestion control algorithms always omit the impact of traffic in reverse path, e.g. TCP Vegas. To address this problem, we analyze the relation between TCP performance and reverse traffic and describe a novel approach, unidirectional trip aware TCP, UTA TCP, for congestion control in high-speed long-latency networks, from design to implementation. Results of our experiments...
Previous theory and experiments show that delay- based algorithm, e.g. TCP Vegas, outperforms other congestion control algorithms with loss-based events. Unfortunately, previous analytic models of TCP Vegas always omit the impact of traffic in reverse path. To address this problem, we develop a simple analytic model in the presence of traffic in reverse path. This model captures the key innovative...
It is expected that a sizable portion of the future traffic in high-speed optical networks will be multicast. Since the bandwidth requirement of an individual user is only a fraction of optical channel capacity, multicast traffic grooming problem is becoming a crucial constituent in designing WDM networks. This paper proposes the traffic grooming algorithm called EMGA for multicast sessions in dynamic...
In this paper, we propose a novel method to address the problem of designing virtual topology over WDM networks under traffic demand uncertainties. We present a traffic model under uncertainties. The optimization goal of virtual topology design is defined as minimizing the maximum value among p percentiles of the traffic distribution on all light-paths. Correspondingly, we propose a heuristic algorithm...
In this paper, we introduce a novel oblivious routing scheme based on valiant load-balancing for the model of polyhedral uncertainty (i.e., hose model), and the scheme is implemented with traffic-grooming approach in WDM mesh networks. Considering that a high-speed connection request in optical networks is difficult to be divided into low-speed connections, we propose the method of hose-model separation...
Wavelength division multiplexing (WDM) is an important technique for next-generation networks, which offers a viable solution to fully exploit the enormous bandwidth available in fiber optics. Optical layer multicast refers to the support of point-to-multipoint connections directly at the physical layer by employing passive devices known as power splitters. Since the bandwidth requirement of an individual...
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.