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.
Fragmentation in Elastic Optical Networks is an issue caused by isolated, non-aligned, and non-contiguous frequency slots that can not be used to allocate new connection request to the network, due to the optical layer restrictions imposed to the Routing and Spectrum Assignment (RSA) algorithms. To deal with this issue, several studies about Spectrum Defragmentation have been presented. In this work,...
In this article, the survivable routing problem on elastic optical networks (EONs) for single link-failure is studied. The failure-independent path-protecting p-cycles (FIPP p-cycles) protection scheme is used for request protection. Two heuristic algorithms are proposed to solve this problem.
Empowered by the orthogonal frequency division multiplexing (OFDM) technology, elastic optical networks (EONs) have emerged as a promising solution for future high-speed networks. Routing and spectrum allocation (RSA) is one of the key challenges to the design of EONs. An adaptive RSA is required to meet the robustness objective of EONs. The relative cost concept can be used to implement an adaptive...
Efficient resource allocation in OFDM-based optical networks is directly affected by definition and formulations of Routing and Spectrum Assignment (RSA) problem. In this paper, we propose new Binary Linear Programming (BLP) formulations for the RSA problem that provide more efficient resource allocation in comparison with previous formulations. Unlike the conventional formulations that mainly aim...
Recently a lot of effort has been dedicated to maximize throughput in highly mobile multi-channel networks such as vehicular networks. Nevertheless, distributing the load as equally as possible between service channels varying in space and time is still a matter of investigation. The contributions of this paper are two-fold. Firstly, we present an adaptive multi-channel allocation mechanism (AMC)...
Owing to Big Data popularity, the metrics Variety, Volume and Velocity (V3), are gaining importance in large scale data intensive applications. Complex Event Processing (CEP) is an efficient solution for identifying events of interest on data streams arriving from geographically distributed heterogeneous sources in near-real time. CEP is capable of handling large variety of data with high computational...
We study routing and scheduling algorithms for relay-assisted, multi-channel downlink wireless networks (e.g., OFDM-based cellular systems with relays). Over such networks, while it is well understood that the BackPressure algorithm is stabilizing (i.e., queue lengths do not become arbitrarily large), its performance (e.g., delay, buffer usage) can be poor. In this paper, we study an alternative —...
Spectral fragmentation in elastic optical networks decreases the spectral efficiency and increases the request blocking. We propose a novel auxiliary graph model and spectral defragmentation technique using independent sets to efficiently consolidate the spectrum allocation.
OFDM-based flexible optical networks provide better spectral efficiency than conventional WDM optical networks as connections can be allocated requested capacity instead of full wavelength capacity. Survivability is an important issue in OFDM-based flexible optical networks. However, little work has been done in this area. In this study, we propose a survivable multipath provisioning scheme that provides...
Many high-performance networks support both advance and immediate bandwidth reservations, the former reserving bandwidth ahead of time in a future time slot to provide guaranteed bandwidth, while the latter allocating bandwidth upon availability in the next immediate time slot. As a result, an ongoing data transfer task based on an immediate reservation may be preempted by the activation of an advance...
This paper concerns the capacity allocation problem in multilevel virtual networks. The utility and cost functions are used to determine network performance in the economic terms. The considered problem is formulated as an optimization issue. This allocation problem (referred to as master problem) is decomposed into series of constrained concave maximization subproblems. The hierarchical procedure,...
The road network of a small town is represented as a directed graph where each road junction is a vertex and each road segment (which has a length and a priority value) is a directed edge. We assume that there are several plows available to service the roads. We seek to compute an optimal allocation of routes to plows. Each route begins and ends at the same (depot) vertex. The union of all plow routes...
In multi-hop networks, conventional unipath routing approaches force the data transmission to follow a fixed sequence of nodes. In this paper, we widen this path to create a corridor of forwarding nodes. Within this corridor, data can be split and joined at different nodes as the data travels through the corridor towards the destination node. To split data, decode-and-forward OFDMA is used since with...
The gap between high throughput demand of Internet traffic and low speed capacity of a router's interface has become a bottleneck for packet forwarding. One way to close the gap is to employ a parallel mechanism, where the route lookups of multiple packets are processed simultaneously, yielding a substantial improvement in the system's throughput. This paper proposes a new pipelined trie-based routing...
Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv4/6 address, making fast name lookup a challenging issue. In this paper, we propose an effective Name Component Encoding (NCE) solution with the following two techniques: (1) A code allocation mechanism is developed to achieve...
This paper proposes a novel QoS-aware and congestion-aware Network-on-Chip architecture that not only enables quality-oriented network transmission and maintains a feasible implementation cost but also well balance traffic load inside the network to enhance overall throughput. By differentiating application traffic into different service classes, bandwidth allocation is managed accordingly to fulfill...
The wireless Internet-access mesh network (WIMNET) has been studied to offer an inexpensive, scalable Internet-access wireless network by adopting multiple access points (APs) connected by wireless links. WIMNET can improve the dependability to failures of links and/or APs by allocating APs redundantly in the network field. However, redundant APs may increase the operational cost and degrade the throughput...
Proportional fairness has been shown to maximize the aggregate utility of rate control for elastic traffic in a resource sharing communication network, and has been applied to a broad range of resource allocation problems. For a refined analysis, however, the representation of proportional fairness as a relation between vectors with positive components will often not provide the level of detail that...
Recently, the OFDM-based Spectrum-sliced Elastic Optical Path (SLICE) network attracts significant interests due to its elastic band-width allocation. The OFDM technology, on one hand, enables both sub-wavelength and super-wavelength traffic accommodation by allocating appropriate number of sub-carriers. On the other hand, it can provide high signal quality by overcoming various impairments. In SLICE...
In OFDM-based optical networks, multiple subcarriers can be allocated to accommodate various size of traffic demands. By using the multi-carrier modulation technique, subcarriers for the same node-pair can be overlapping in the spectrum domain. Compared to the traditional wavelength routed networks (WRNs), the OFDM-based Spectrum-sliced Elastic Optical Path (SLICE) network has higher spectrum efficiency...
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.