Cheapest Paths in Multi-interface Networks

Authors:
Ferruccio Barsi;Alfredo Navarra;Cristina M. Pinotti
Affiliations:
Department of Computer Science and Mathematics, University of Perugia, Perugia, Italy 06123;Department of Computer Science and Mathematics, University of Perugia, Perugia, Italy 06123;Department of Computer Science and Mathematics, University of Perugia, Perugia, Italy 06123
Venue:
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Year:
2009

Citing 3
Cited 2

Cost minimization in wireless networks with a bounded and unbounded number of interfaces

Networks
Cost minimisation in multi-interface networks

NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Cost minimisation in unbounded multi-interface networks

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics

Minimizing the maximum duty for connectivity in multi-interface networks

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Min-max coverage in multi-interface networks

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-interface networks are characterized by the property that each node in the network might choose among several communication interfaces in order to establish desired connections. A connection between two neighboring nodes is established if they both activate a common interface. Each interface is associated with an activation cost. In this context we investigate on the so called Cheapest Path problem, i.e., given a node s of the network, for each other node j , we look for the cheapest set of interfaces that must be activated among the nodes in order to establish a path between s and j . Polynomial algorithms are provided.