Related papers: An Efficient Approach for Generalized Load Balanci…
Efficient routing is one of the key challenges for next generation vehicular networks in order to provide fast and reliable communication in a smart city context. Various routing protocols have been proposed for determining optimal routing…
A significant challenge for computation offloading in wireless multi-hop networks is the complex interaction among traffic flows in the presence of interference. Existing approaches often ignore these key effects and/or rely on outdated…
Single path routing that is currently used in the internet routers,is easy to implement as it simplifies the routing tables and packet flow paths. However it is not optimal and has shortcomings in utilizing the network resources optimally,…
In this paper we describe a new algorithm for buffered global routing according to a prescribed buffer site map. Specifically, we describe a provably good multi-commodity flow based algorithm that finds a global routing minimizing buffer…
Information-Centric Networking is still an incomplete paradigm which introduces a large variety of new topics and approaches over the traditional networking. Since it is a relatively new concept which promises for easier and faster data…
Multipath forwarding consists of using multiple paths simultaneously to transport data over the network. While most such techniques require endpoint modifications, we investigate how multipath forwarding can be done inside the network,…
Traffic load-balancing in datacenters alleviates hot spots and improves network utilization. In this paper, a stable in-network load-balancing algorithm is developed in the setting of software-defined networking. A control plane configures…
We consider the problem of throughput-optimal packet dissemination, in the presence of an arbitrary mix of unicast, broadcast, multicast and anycast traffic, in a general wireless network. We propose an online dynamic policy, called…
In order to utilize network resources and provide a more reliable delivery of information, multipath routing algorithms are used with a higher priority than single path routing. But providing the quality of service (QoS) requirements while…
Scalable load balancing algorithms are of great interest in cloud networks and data centers, necessitating the use of tractable techniques to compute optimal load balancing policies for good performance. However, most existing scalable…
We introduced the load-balanced routing algorithms, for interconnection networks resulting from nesting, by considering the pressure of the data forwarding in each node. Benchmarks on a small cluster with various network topologies, and…
Wireless sensor networks sense and monitor real-time events. They supervise a geographic area where a phenomenon is to be monitored. The data in sensor networks have different levels of priority and hence their criticality differs. In order…
Internet traffic continues to grow relentlessly, driven largely by increasingly high resolution video content. Although studies have shown that the majority of packets processed by Internet routers are pass-through traffic, they nonetheless…
This paper proposes a new class of online policies for scheduling in input-buffered crossbar switches. Our policies are throughput optimal for a large class of arrival processes which satisfy strong-law of large numbers. Given an initial…
Backpressure-based adaptive routing algorithms where each packet is routed along a possibly different path have been extensively studied in the literature. However, such algorithms typically result in poor delay performance and involve high…
Understanding how packets are routed in Internet is significantly important to Internet measurement and modeling. The conventional solution for route simulation is based on the assumption of unweighted shortest path. However, it has been…
We present an efficient routing approach for delivering packets in complex networks. On delivering a message from a node to a destination, a node forwards the message to a neighbor by estimating the waiting time along the shortest path from…
Load balancing algorithms play critical roles in systems where the workload has to be distributed across multiple resources, such as cores in multiprocessor system, computers in distributed computing, and network links. In this paper, we…
Multipath routing is a trivial way to exploit the path diversity to leverage the network throughput. Technologies such as OSPF ECMP use all the available paths in the network to forward traffic, however, we argue that is not necessary to do…
We present novel oblivious routing algorithms for both splittable and unsplittable multicommodity flow. Our algorithm for minimizing congestion for \emph{unsplittable} multicommodity flow is the first oblivious routing algorithm for this…