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.
Border Gateway Protocol (BGP) has been the de facto inter-domain routing protocol since it was introduced. Its destination-based routing nature, which is not able to choose a specific end-to-end AS-level route, might overload some popular peering (or inter-AS) links, while making some others underused. This could result in congestion and cause service disruption. To cope with the issue of destination-based...
As an emerging technology, software defined networking (SDN) allows flexible control of network devices and supports user applications with guaranteed quality of service (QoS). To achieve flow transmission between two non-adjacent switches in SDN, efficient routing algorithm should be designed. In this paper, we jointly consider route selection and flow allocation problem. To stress the service sensitivity...
It is a hot topic to make full use of channel resources in the case of limited hardware resources on the Internet. Channel allocation in multi-interface multi-channel nodes can effectively solve the problem. Extending the single-interface single-channel OLSR protocol to multi-interface multi-channel OLSR protocol and distributed channel negotiation on multiinterface multi-channel OLSR protocol can...
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,...
HPC systems have shifted to burst buffer storage and high radix interconnect topologies in order to meet the challenges of large-scale, data-intensive scientific computing. Both of these technologies have been studied in detail independently, but the interaction between them is not well understood. I/O traffic and communication traffic from concurrently scheduled applications may interfere with each...
In this paper, we address the problem of routing, space and spectrum assignment (RSSA) in survivable flex-grid networks that implement spatial division multiplexing (SDM). In our consideration, we focus on two switching policies for the SDM (namely, independent and joint) while the network survivability is provided by dedicated path protection (DPP). We formulate the problem (RSSA-DPP) as an integer...
Developed cities are facing a serious problem of traffic congestion that leads to the wastage of both fuel and time of the commuters. To alleviate this problem, a preemptive HAPO (HAPO-P) algorithm has been presented in the literature to reduce the trip time by combining HAPO algorithm with preemptive traffic control. The HAPO-P algorithm is able to minimize the travel time to some extent, but dynamic...
Throughput performance, an important metric for interconnection networks, is often quantified by the aggregate throughput for a set of representative traffic patterns. A number of models have been developed to estimate the aggregate throughput for a given traffic pattern on an interconnection network. Since all of the models predict the same property of interconnection networks, ideally, they should...
With increased cloud adoption globally, the cloud service providers are setting up their data centers in various geographical location to cater the needs of diverse range of users across the globe. The cost of managing data center includes not only hardware, software costs but also the electricity costs prevailing at that location. The cost of electricity varies from location to location and it is...
School Bus Routing (SBR) is a typical instance of Vehicle Routing Problem (VRP). Meanwhile SBR has unique and important objectives, such as safety of the students and total amount of time the students stay on the bus that other VRPs usually do not need to consider. When all these factors are considered, the school bus routing problem becomes a complex combinatorial optimization issue which the traditional...
The flow aggregation scheme which aggregates a large number of finer-grained services into one large flow can save transceivers and improve spectrum efficiency. It ensures that all services in the aggregated flow have a same routing. Moreover, the spectrum allocated to all finer-grained services in the aggregated flow is continuous. Compared with independent transmission scheme which conducts the...
We present a heuristic algorithm to address the optimization problem of routing and spectrum allocation, aimed at traffic protection and restoration in an elastic optical network. The algorithm searches for working and backup disjoint paths, using the shared path protection scheme. It divides the spectrum into two partitions and prioritizes slots in one of them for backup path traffic. The way the...
Resource competition, a serious problem in many actual networks, largely influence the network performance and may lead to network congestion. The allocation of link's bandwidth resource is a key process to relieve the situation. Researchers have put forward some strategies to improve the network capacity. They thought that the allocation strategies were determined by the importance of each link which...
A cognitive vehicle network is date from Vehicular Ad hoc Networks (VANET), which is proposed to solve the problem of control channel and spectrum scarcity in VANET. To resolve channel conflict problem in channel switching in vehicle network, a new dynamic spectrum allocation algorithm (DSAARCC) is proposed. When the vehicle user chooses the channel, to minimize the average delay under the condition...
In Software Defined Networking (SDN), the severe conflict between rule number and memory size has attracted considerable academic attention. Ternary Content Addressable Memory (TCAM), generally used to guarantee the query speed, is a scarce and expensive resource, which limits the number of rules that the switch can support. However, the table miss may increase processing burden of the controller...
We design a metric to measure the occupied holding time difference of frequency slots. With the metric, a routing and spectrum allocation algorithm in dynamic scenario is proposed to improve the network spectral utilization. Evaluation results show the proposed algorithm outperforms obviously in blocking probability.
CGRA (Coarse-Grained Reconfigurable Array) is competitive hardware architecture for streaming applications due to its excellent tradeoff between programmability and efficiency. However, the efficiency of CGRA highly depends on how applications are mapped onto it with optimized operation placement and data routing. In the routing procedure, data are transferred through different processing elements...
A resource allocation scheme consisting of joint assignment of routing, wavelength and time-slot is proposed to construct different channels in software-defined optical networks secured by quantum key distribution (QKD). Security level is considered by key-updating period.
We propose an inter-core crosstalk-aware routing, spectrum and core allocation scheme with spectrum bands and spatial Sp-Chs in multi-dimensional optical networks to get higher SE and lower XT. 15% reduction in XT is achieved.
In this work, we investigate overlapping shared segment protection under continuous and TDM-mode sliding scheduled traffic model and compare its performance with that of shared path protection under sliding scheduled traffic model in Store-and-Transfer WDM Networks. Simulations show the following: Under continuous sliding scheduled traffic model, shared segment protection has 12% lower blocking rate...
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.