Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...

The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...

The explosive development of ICT (information and communication technology) industry has emerged as one of the major sources of world energy consumption. Therefore, this paper concerns about the BS (base station) energy saving issue, for most energy consumption of the communication network comes from the BSs and the core network. Particularly, we consider dynamically turning off certain BSs whe...

We address the computer communication network design problem of optimal location of switches/ routers as well as interconnection (OLSRI) of the core network. This problem is applicable, for example, in the network topological architecture design arising in ATM PNNI environment or IP/ATM networking environment. While the pure location design problem has received much attention in the literature,...