In wireless data networks, the optimal routing of data depends on the link capacities which,
in turn, are determined by the allocation of communications resources (such as transmit …

In multicasting routing, the main objective is to send data from one or more sources to
multiple destinations, while at the same time minimizing the usage of resources. Examples …

We live in an increasingly connected world. Even before the appearance of the now
ubiquitous broadband links and wireless systems, networks have been used to connect …

In this article we study the problem of designing a nation-wide communication network. Such
networks usually consist of an access layer, a backbone layer, and maybe several …

The Internet is a huge world-wide packet switching network comprised of more than 13,000
distinct subnetworks, referred to as Autonomous Systems (ASs). They all rely on the Internet …

In this article, we discuss the relation of unsplittable shortest path routing (USPR) to other
routing schemes and study the approximability of three USPR network planning problems …

Most data networks nowadays use shortest path protocols to route the traffic. Given
administrative routing lengths for the links of the network, all data packets are sent along …

The world-wide Internet is a huge, virtual network comprised of more than 13, 000 distinct
networks, which all rely on the Internet Protocol (IP) for data transmission. Shortest path …

Multicasting is a technique for data routing in networks that allows multiple destinations to be
addressed simultaneously. The implementation of multicasting requires, however, the …

We study the complexity of two inverse shortest paths (ISP) problems with integer arc
lengths and the requirement for uniquely determined shortest paths. Given a collection of …