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.
With the rapidly growing of geo-distributed applications in the Internet, there is a huge amount of data generated in geo-distributed datacenters everyday. However, because of region privacy concerns and limitation of inter-DC WAN bandwidth, moving all the geo-distributed data to a single datacenter for centralized processing is not practical. Therefore, we intend to process the data where it generates...
Multicast can jointly utilize the network resources when delivering the same content to a set of destinations; hence, it can effectively reduce the consumption of network resources more than individual unicast. The source of a multicast, however, does not need to be in a specific location as long as certain constraints are satisfied. This means the multicast can have uncertain sources, which could...
Increasing bulk data transfers have been overwhelming the Internet. To overcome this, optical circuit-switched (OCS) networks are equipped with assistive storage, so that bulk data that are delay tolerant can be temporarily stored at intermediate nodes and forwarded at later times. But, the use of storage greatly complicates the routing problem, since data storage must be incorporated into routing...
In this paper the mathematical model of multicast routing of flows with support shared explicit reservation of link resources is proposed. The proposed model consists of a linear expressions, which are responsible for providing the connectivity of the calculated multicast routes, and also the absence of loops in them. The novelty of the model is the using of conditions of prevention the congestion...
In cloud-like scenarios, demand is served at one of multiple possible data center (DC) destinations. Usually, the exact DC that is used can be freely chosen, which leads to an anycast routing problem. Furthermore, the demand volume is expected to change over time, e.g., following a diurnal pattern. Given that virtually all application domains today rely heavily on cloud-like services, it is important...
S-parameter is commonly used for channel modeling and crosstalk modeling between channels in high speed digital design. However, for I/O buffer circuit designer, S-parameter models are not well received owing to all general frequency domain data is difficult to incorporate into a transient circuit simulation. S-parameter is a frequency domain data and is difficult to deal in a transient circuit simulation...
The improvement of the scalability of routing decisions is quite relevant in modern telecommunication networks. In this regard, effective approach is associated with the implementation of hierarchical routing. This involves carrying out a structural and functional decomposition of the network, based on the introduction and supporting of multi-level routing decisions. However, the existing protocol...
WSNs with randomly deployed nodes, to reduce energy consumption while ensuring the connectivity and power of entire network is an important issue of research. A mobility and energy-aware cross-layer searching routing algorithm works in stationary and mobile scenario with the satisfactory performance in addition to mobility handling, provides route to nodes which forward data between each other directly...
This paper is devoted to the development of the extended multi-commodity flow model in order to provide optimal routing based on the criteria of quality of service and minimal maximal channel utilization. Since most of the models consider these criteria separately and do not consider different requirements of flows to quality of service, the proposed model allows to close this gap by allowing to achieve...
In this paper we propose an online, reward-based routing and spectrum assignment (RSA) method for multirate flex-grid optical networks. The method, denoted as MDP-RSA, is derived from a flex-grid optical link model based on the theory of Markov decision processes. Assuming that connections arrive randomly offering a reward to the system, the objective is to take the best decision on admission, routing...
We consider the problem of dimensioning resilient backbone networks for cloud-like scenarios where demand is to be served at one among several candidate data centers (DCs), and where that demand varies over time, which we assume to be slotted. We thus consider multi-period traffic, for which we need to find routes to both a primary DC and a backup DC (in case the primary, or the network connection...
Since today's networks use traditional centralized management systems, the management became costly with the growth in the number of network equipments and available services. It became then clear that it was necessary to distribute the central management responsibilities throughout the network equipments.
The majority of modern routing algorithms in computer networks is based on Bellman-Ford and Dijkstra's algorithms. The efforts to calculate these algorithms lead to the complexity O(N3) and O(N2) correspondingly. Here N is the number of communication nodes or routers in computer network. When changing communication links bandwidth in given algorithms total recalculation of routing tables takes place...
Routing in previous research works for bounded delay in Delay-Tolerant Networks (DTNs) tried their best to impose bounded delay on the message delivery. However, the existing routing protocols had a lot of issues due to the infinite buffer size and bandwidth assumption, where these resources are limited in realistic environment. In this paper, we modify and extend epidemic routing using ordinary differential...
The general method available for comparison between the Distributed Hash Table (DHT) based structured overlay networks are average latency per successful lookup and percentage of successful lookups. For a DHT based lookup service with lookup retries for failed lookups, both average latency per successful lookup as well as percentage of successful lookups are key to evaluate the performance. Although,...
Software Defined Networking (SDN) makes load balancing efficient and intelligent. However, fully deploying an SDN presents economical, organizational and technical challenges. Therefore, load balancing in hybrid SDN networks where the routing protocol parameters are designed through an SDN channel is one of the hottest topics in the field. In addition, symmetrically routing is a practical requirement...
In this paper, we consider a disruption tolerant network (DTN) which enables data transmission with intermittent connectivity and in which instantaneous end-to-end path between a source and destination may not exist. We explore routing problems in such networks in consideration of limited storage for each intermediate node. A graph model called the storage enhanced time-varying graph (STVG) is presented,...
This paper presents a novel multipath load balancing algorithm called priority-based adaptive weighting (PAW) for video over software defined networks (SDN). Based on priority differentiation among video packets, PAW adopts a per-packet strategy to distribute ingress video packets over the multiple egress ports of an entry SDN-switch connecting to those output links leading to the same IP destination,...
Multiservice telecommunication network is studied under adaptive routing in accordance with LLR method and the influence of equipment faults on network performance at connection level is analyzed. The approach is formulated to calculate call blocking probability and evaluate mean increment of this probability caused by limited reliability of network elements. The applicability of proposed mathematical...
In order to guarantee and optimize end-to-end Quality-of-Service (QoS) in heterogeneous and converged mobile Internet, a novel QoS routing algorithm proposed to optimize multiple QoS metrics on virtual Overlay platform based on Multi-Objective optimization is introduced at this paper. Because of the imprecise network information, the membership function and probability are combined to find a solution...
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.