An important parameter in ATM-based network design and management is the cell loss probability in ATM multiplexers. However, it depends on many unknown and unpredictable traac parameters such as burst length distribution, mean rate, etc. In this paper, we propose a simple and robust fuzzy-based algorithm to predict the cell loss probability in large-sized systems based only on both a small amou...

In this chapter, we survey communication related issues arising in the context of Low Earth Orbit (LEO) satellite constellations. In particular, we study the impact of the predictable movement of the satellites on the techniques used in topological design, routing, and hand-over strategies.

Future space networks could leverage on high-readiness terrestrial technology. Terrestrial networks have been designed and built with a primary concern for scalability. The white paper • Conducts an assessment of the scalability paradigm in terrestrial network design, • Conducts an assessment of future scalability needs for space networks, and • Identifies gaps between space needs and terrestri...

We study the value and quality of deterministic solutions to scheduled stochastic capacitated multi-commodity service network design problems. We study both the fixed and variable (integer and continuous) capacity cases, and investigate models with and without asset-balance constraints. For the deterministic cases, we replace the random variables in the stochastic model with the 50 th and the 7...

This proposal addresses two problems in programmable networks. Speci cally, we are interested in networks that can dynamically deploy applications and session-speci c plugins within network routers, to provide advanced communication services. In the rst half of the proposal, we present a general approach to the problem of conguring application sessions that require intermediate processing in pr...

We investigate a multicommodity network design problem where a discrete set of technologies with step-increasing cost and capacity functions should be installed on the edges. This problem is a fundamental network design problem having many important applications in contemporary telecommunication networks. We describe an exact constraint generation approach and we show that the conjunctive use o...

This paper considers the problem of designing a minimum cost network meeting a given set of traac requirements between n sites, using one type of channels of a given capacity, with varying setup costs for diierent vertex pairs (comprised of a xed part plus a part dependent on the pair). An approximation algorithm is proposed for this problem, guaranteeing a solution whose cost is greater than t...

We describe a multilayer connection control architecture for broadband communications. A graph framework is introduced to describe network layers of network design, path configurations, dynamic call routing, burst switching, and ATM cell switching. These hierarchical layers of switching are performed at decreasing time scales, respectively. Switching at the higher layer is performed to reduce b...

In this paper, we study the k edge-connected L-hop-constrained network design problem. Given a weighted graph G = (V,E), a set D of pairs of nodes, two integers L ≥ 2 and k ≥ 2, the problem consists in finding a minimum weight subgraph of G containing at least k edge-disjoint paths of length at most L between every pairs {s, t} ∈ D. We consider the problem in the case where L = 2, 3 and |D| ≥ 2...

This paper proposes optimization frameworks for discrete road network design considering the land-use transport interaction over time. Unlike existing models, the optimization frameworks can determine the optimal designs automatically without trial-and-error once the objective(s) is/are clearly defined. Moreover, these frameworks allow the evaluation of the impacts of the optimal designs on the...