Awareness, belief, and communication reaching consensus.
Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)
Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)
In this paper we study bi-directional nearness in a network based on AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process). Usually we use forward (one-dimensional) direction nearness based on Euclidean distance. Even if the nearest point to i is point j, the nearest point to j is not necessarily point i. Sowe propose the concept of bi-directional nearness defined by AHP'ssynthesizing of weights “for” direction and “from” direction. This concept of distance is a relative distance...
Building representative-based data aggregation tree in wireless sensor networks.
Characterization of the departure process from an ME/ME/1 queue
In this paper we propose a family of finite approximations for the departure process of an ME/ME/1 queue indexed by a parameter defined as the system size of the finite approximation. The approximations capture the interdeparture times from an ME/ME/1 queue exactly and preserve the lag correlations of inter-event times of the departures from an ME/ME/1 queue up to lag .
Characterization of the departure process from an ME/ME/1 queue
In this paper we propose a family of finite approximations for the departure process of an ME/ME/1 queue indexed by a parameter k defined as the system size of the finite approximation. The approximations capture the interdeparture times from an ME/ME/1 queue exactly and preserve the lag correlations of inter-event times of the departures from an ME/ME/1 queue up to lag (k - 1).
Computer Network Design Problems
Constrained -means algorithm for resource allocation in mobile cloudlets
With the rapid increase in the number of mobile devices connected to the Internet in recent years, the network load is increasing. As a result, there are significant delays in the delivery of cloud resources to mobile users. Edge computing technologies (edge, cloudlet, fog computing, etc.) have been widely used in recent years to eliminate network delays. This problem can be solved by allocating cloud resources to the cloudlets that are close to users. The article proposes a clustering-based model...
Cutwidth of the -dimensional mesh of -ary trees
Cutwidth of the r-dimensional Mesh of d-ary Trees
We prove that the cutwidth of the r-dimensional mesh of d-ary trees is of order , which improves and generalizes previous results.
Deux problèmes d'ordonnancement en télécommunications par satellite
Efficient offline algorithmic techniques for several packet routing problems in distributed systems.
Evaluation of node position based email communication
Fast approximation of minimum multicast congestion – Implementation versus theory
The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known -hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with edges and multicast requests, an -approximation can be computed in time, where bounds the time for computing an -approximate minimum Steiner tree. Moreover, we present a new fast heuristic that...
Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known NP-hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with m edges and k multicast requests, an r(1 + ε)(rOPT + exp(1)lnm)-approximation can be computed in O(kmε-2lnklnm) time, where β bounds the time for computing an r-approximate minimum Steiner tree. Moreover,...
Fast simulation for road traffic network
In this paper we present a method to perform fast simulation of large markovian systems. This method is based on the use of three concepts: Markov chain uniformization, event-driven dynamics, and modularity. An application of urban traffic simulation is presented to illustrate the performance of our approach.
Fast simulation for Road Traffic Network
In this paper we present a method to perform fast simulation of large Markovian systems. This method is based on the use of three concepts: Markov chain uniformization, event-driven dynamics, and modularity. An application of urban traffic simulation is presented to illustrate the performance of our approach.
Fault diagnosis of networked control systems
Networked Control Systems (NCSs) deal with feedback control systems with loops closed via data communication networks. Control over a network has many advantages compared with traditionally controlled systems, such as a lower implementation cost, reduced wiring, simpler installation and maintenance and higher reliability. Nevertheless, the networkinduced delay, packet dropout, asynchronous behavior and other specificities of networks will degrade the performance of closed-loop systems. In this context,...
Flow control in connection-oriented networks: a time-varying sampling period system case study
In this paper congestion control problem in connection-oriented communication network with multiple data sources is addressed. In the considered network the feedback necessary for the flow regulation is provided by means of management units, which are sent by each source once every M data packets. The management units, carrying the information about the current network state, return to their origin round trip time RTT after they were sent. Since the source rate is adjusted only at the instant of...
Forecasting Telecommunication New Service Demand by Analogy Method and Combined Forecast