The Media Broadcast industry has evolved from Serial Digital Interface (SDI) based infrastructures to IP networks. While video broadcast is well established in the data plane, use of networks transport media flows still poses challenges terms resource management and orchestration. SDN orchestration architectures have emerged that route a service across provider network. Several approaches multi...

An on-demand route discovery method in mobile ad hoc networks (MANET) uses simple flooding method, whereas a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. Thus, this leads to broadcast storm problem. This paper presents a novel algorithm for broadcasting scheme in wireless ad hoc networks using a fuzzy logic syst...

We present a method, inspired from routing in dynamic data networks, to solve the Semiring Algebraic Path Problem (SAPP) for dynamic graphs. The method can be used in dynamic networks such as Mobile Ad Hoc Networks, where the network link states are highly dynamic. The algorithm makes use of broadcasting as primary mechanism to recompute the SAPP solution. The solution suffers from broadcast st...

Mobile wireless ad-hoc networks need to maximize their network lifetime (defined as the time until the first node runs out of energy). In the broadcast network lifetime problem, all nodes are sending broadcast traffic, and one asks for an assignment of transmit powers to nodes, and for sets of relay nodes so that the network lifetime is maximized. The selection of a dynamic relay set consisting...

MANETs are networks of mobile devices for multihop communication without a separate infrastructure for routing and control. If robust protocols are available, MANETs can exploit the true ubiquity of everyday mobile devices for application scenarios such as collaborative learning, multiplayer gaming, adaptive advertising as well as in disaster management and battlefield communication. Traditiona...

A large variety of permutation routing protocols in a single-hop Network are known in the literature. Since they are single hop, there is always a wireless link connecting two nodes. One way to solve this problem in a multiple hop environment is to partition nodes into clusters, where a node in each cluster called clusterhead is responsible for the routing service. In this paper, we propose a h...

Dynamic broadcast is a communication problem where each node in a parallel computer generates packets to be broadcast to all the other nodes according to a certain random process. The lower bound on the average time required by any oblivious dynamic broadcast algorithm in an ndimensional hypercube is Ω(n+ 1 1 ρ)when packets are generated according to a Poisson process, where ρ is the load facto...

We consider the problem where broadcast requests are generated at random time instants at each node of a multiprocessor network. In particular, in our model packets arrive at each node of a network according to a Poisson process, and each packet has to be broadcast to all the other nodes. We propose an on-line decentralized routing scheme to execute the broadcasts in this dynamic environment. A...