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.
We consider the problem of multicasting from a single source to a set of destinations. We assume that the source cannot reach the destinations directly, but must forward its traffic through a set of relays. Under the performance objective of maximizing the common amount of information (number of bits) that the source sends to all destinations per Joule of the total energy spent, we wish to obtain...
We develop a computational framework to study the impact of burst assembly algorithms on the byte loss rate (ByLR) of an OBS network under bursty (ON-OFF) IP traffic input. First we propose a computational method to analyze the characteristics of assembled bursts in terms of burst length and/or burst assembly time distribution under timer-based, burst-threshold-based, and dual-threshold-based burst...
It has been reported that Internet Protocol (IP) packet traffic exhibits self-similarity or long range dependence (LRD) and causes the degradation of switch performance. Therefore, it is crucial for an appropriate buffer design of switch. In this paper, we investigate the packet loss behavior of the switch under self-similar variable packet length traffic by modeling it MMPP/M/1/K as queueing system...
In this paper, we present a novel polynomial time framework for the off-line flow allocation problem in MPLS-traffic engineering (MPLS-TE) networks. This framework, named FATE (flow allocation for traffic engineering), encom-passes different objectives that illustrate the operator needs for traffic engineering and provides advanced control over the quality of the solution. Typically, we consider minimizing...
In this paper we consider algorithms for the logical topology design and traffic grooming problem in WDM networks with router interface constraints as well as optical constraints. The optical constraints include restricted transmission range due to optical impairments as well as limits on the number of available wavelengths. We formulate this problem as an integer linear program which is NP-complete...
Various network monitoring and performance evaluation schemes generate considerable amount of traffic, which affects network performance. In this paper we describe a method for minimizing network monitoring overhead based on shortest path tree (SPT) protocol. We describe two different variations of the problem: the A-problem and the E-problem, and show that there is a significant difference between...
Supporting multicast applications has drawn increased attention in the development of WDM based optical networks. To provide a high level of availability in the face of node or link failure for multicast traffic, pre-assigned spare capacity in the networks is needed. This paper studies the problem of constructing a minimum-cost, two-connected subgraph, satisfying the wavelength conversion constraint,...
When provisioning the quantitative QoS based VPN services over packet switched networks, parameters such as packet loss, delay and delay jitter, besides the required bandwidth, have to be guaranteed. While the bandwidth is easier to guarantee during the lifetime of a VPN service, maintaining a value of the loss parameter below a preset value presents serious difficulties. Thus one of the main issues...
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.