The purpose of this paper is to formally describe new optimization models for distributed telecommunication networks. Modern distributed networks put more focus on the processing of information and less on the actual transportation of data, than we are traditionally used to in telecommunications. This paper introduces new models for decision support at operational, tactical and strategic levels...

Many networked systems involve multiple modes of transport. Such systems are called multimodal, and examples include logistic networks, biomedical phenomena, manufacturing process and telecommunication networks. Existing techniques for determining optimal paths in multimodal networks have either required heuristics or else application-specific constraints to obtain tractable problems, removing ...

Let θ 7→ P (θ) be a set-valued mapping from R into the family of closed compact polyhedra in R. Let ξ be a R valued random variable. Many stochastic optimization problems in computer networking, system reliability, transportation, telecommunication, finance etc. can be formulated as a problem to minimize (or maximize) the probability P{ξ ∈ P (θ)} under some constraints on the decision variable ...

Many real-life systems such as manufacturing, telecommunication and transportation systems may be regarded as a stochastic-flow network whose arcs have independent integer-value random capacities. System reliability of such a system can be computed in terms of minimal path vectors to demand level d, called d-MinPaths (d-MPs) or minimal cut vectors to demand level d, called d-MinCuts (d-MCs). Th...

Non-repudiation is a security service that provides cryptographic evidence to support the settlement of disputes. In this paper, we introduce the state-of-the-art of non-repudiation protocols for multiple entities. We extend an existing multi-party non-repudiation (MPNR) protocol to allow an originator to send different messages to many recipients in a single transaction. We further propose an ...

We study the Minimum Labelling Spanning Tree Problem : Given a graph G with a color (label) assigned to each edge (not necessarily properly) we look for a spanning tree of G with the minimum number of different colors. The problem has several applications in telecommunication networks, electric networks, multimodal transportation networks, among others, where one aims to ensure connectivity by ...

in order to improve the level of intelligence, availability, being on demand, convenience, information and humanization of rural public transportation systems, they are more willing to use modern information and communicative technologies. in addition to management services, intelligent transportation systems can provide passengers, drivers, travel agencies and other institutions with other ser...

The general clustering algorithms do not guarantee optimality because of the hardness of the problem. Polynomial-time methods can find the clustering corresponding to the exact optimum only in special cases. For example, the dynamic programming algorithm can solve the one-dimensional clustering problem, i.e., when the items to be clustered can be characterised by only one scalar number. Optimal...

Project Summary The recent loss of lives, and traffic jams stretching for tens of miles as hurricanes Rita and Katrina approached the Gulf Coast demonstrate the enormous difficulty of evacuating urban areas. Mass evacuations are among the most difficult problem areas in Transportation Science because they violate key assumptions underlying traditional theories, e.g., Wardrop equilibrium among s...