9512.net

甜梦文库

甜梦文库

当前位置：首页 >> >> # Stochastic geometry and architecture of communication networks

Stochastic Geometry and Architecture of Communication Networks

Fran ois BACCELLIy Maurice KLEINz Marc LEBOURGESx Serguei ZUYEVy September 6, 1995

This paper proposes a new approach for communication networks planning; this approach is based on stochastic geometry. We rst summarize the state of the art in this domain, together with its economic implications, before sketching the main expectations of the proposed method. The main probabilistic tools are point processes and stochastic geometry. We show how several performance evaluation and optimization problems within this framework can actually be posed and solved by computing the mathematical expectation of certain functionals of point processes. We mainly analyze models based on Poisson point processes, for which analytical formulae can often be obtained, although more complex models can also be analyzed, for instance via simulation.

AMS 1991 Subject Classi cation. Primary : 60D05, 90B12, 93A30

The work was supported by CNET through the two research grants 93 5 B and CTI 1B 104 y INRIA, Sophia-Antipolis, France z France TELECOM, CNET, Issy Les Moulineaux x France TELECOM, Direction du Plan et de la Strat gie, Paris

Secondary : 52A22, 52C20, 60G10, 60G55, 60K30, 90A25, 90A58, 90B15, 93A13, 93A15, 93C35, 93E23

1

Stochastic modeling, macroscopic modeling, cellular networks, Voronoi tessellation, hierarchical model, mobile communications, teletraffic, point processes, Poisson process

Key words :

1 Introduction

This paper proposes a new approach based on stochastic geometry to model telecommunications network architectures for purposes of strategic planning and economic analysis. First we summarize the state-of-the-art in these two elds, before stating the basics and the advantages of the proposed method. Probabilistic models, based on geometric constructions related to stochastic point processes, are then introduced ( 2). In 3, we show how several classes of performance evaluation or optimization problems can be reduced to the calculation of moments of functionals of the underlying point processes. We mainly summarize here analytical results obtained for the homogeneous Poisson model. More complex models can be analyzed by space transformation or by simulation (see 1]). The models introduced in the paper seem generic and should nd applications for other types of public networks. The modeling approach presented in this paper seems relevant in two research domains : strategic planning and economical modeling of telecommunications network. We rst brie y survey the shortcomings of current methodology in these domains and then explain why our approach should improve existing practice.

1.1 Situation of the problem

1.1.1 Current methods for strategic planning

Current strategic planning methods use a detailed geographical description of the network both for the present and for the future. The description of the future results from an extrapolation of the current network state for a few evolution scenarios. To meet the forecast demand, strategic planning has to choose between a few potential architectures. Their costs and performances are evaluated via detailed calculations of future network con gurations. The 2

analytical results, synthesized into discriminating indicators, help to choose the best architecture among those tested. This process usually requires the development of speci c software optimization programs adapted to each network architecture. This approach uses a considerable amount of parameters out of which only some statistical characteristics are actually relevant for strategic planning. But the classical analytical network models are not meant to identify such structural parameters, which can only be empirically perceived by experts. As structural parameters are not formally identi ed, the sensitivity of strategic planning choices to input data and hypothesis can only be evaluated on empirical grounds. It is in particular impossible, with this methodology, to know to what extend the conclusions of a study stay valid for di erent networks, di erent evolution scenarios or di erent costs or performances hypothesis.

1.1.2 Network modeling for econometrical analysis

The econometrics of telecommunication networks are based on global statistics on the network and the demand. Until now, one is not really able to integrate the spatial characteristics of networks. The production and cost of the essential network function which consists in connecting pairs of distant subscribers, is not identi ed. Another speci city of networks is their ability to share the resources needed to serve di erent connections requests. Operation Research methods, applied to network design problems, model correctly these spatial characteristics, but only on detailed geographical network description, and have not been translated into macroscopic laws, allowing for instance the expression of the network cost function 4].

1.1.3 The stochastic geometry approach

A macroscopic network model, catching the essential spatial characteristics of networks economy through a minimum number of structural parameters, is thus an important research subject. The proposed approach models the space where the network operates by stochastic geometry methods. The objectives of the model are: to limit the parameters to those which determine the network optimal architecture ; 3

to provide analytical expressions for costs or performance indicators, in terms of these parameters; such expressions constitute then the network production function and lead to more e cient comparisons between strategic alternatives; to integrate natural constraints on the spatial repartition of network elements. The basic principle consists in a stochastic model of the spatial characteristics. The network description is reduced to the parameters of the stochastic processes and the decision variables are functionals of these processes : the comparison between decision variables is then based on the parameters of the stochastic processes. By this way, the production function of telecommunication services can be analytically expressed.

2 Stochastic modeling

The spatial structures observed in communication networks are usually far from being regular. For example, the zones served by telephone concentrators or the cells handled by base stations in mobile communications are far from the regular hexagonal shape which is often taken as a reference model. Ignoring these structural uctuations of the geometric objects may cause important bias on the evaluation of key system characteristics. The stochastic model which we propose in the present paper allows one to take these uctuations into account. It is based on a representation of the main objects of the telecommunication network (subscribers, stations, cables, mobiles) as a realization of a family of stochastic processes belonging to simple parametric classes. In what follows, we rst introduce a basic cell model and show that some of the key characteristics of the network can be expressed in terms of simple functionals of these processes. In the following sections, we will show how these characteristics can be analytically evaluated.

2.1 The basic cell model

The simplest probabilistic model of a telephone network is that with a single hierarchical level. 4

The subscribers and the stations are represented through their coordinates in the plane R2. Each station serves subscribers located in a certain area. Equivalently, the plane is sub-divided into cells, each of which is served by a unique station. In this paper, we take the assumption that subscribers are served by the their closest station; they are linked to this station, either by a cable or by a radio channel as in mobile communication networks. Thus the cell served by a station xi is a convex polygon Ci known as the Voronoi cell with nucleus xi , constructed with respect to the set fxj g of stations. The Voronoi cell Ci is the intersection of half planes Hij bounded by the bisectors of the segments xi ; xj ] and containing xi . The system of all the cells creates a tessellation of the plane called the Voronoi tessellation (see Figure 1). The main idea of our stochastic modeling consists in considering the conguration of the subscribers and the stations as realizations of stochastic point processes. In many applications these processes can be taken independent and Poisson. The main advantage of a Poisson process is its simplicity. The distribution of a Poisson process is completely de ned through the intensity measure representing the mean density of points. More accurately, the number of the process points in a Borel set B follows the Poisson distribution with the parameter (B ) and the number of points in disjoint Borel subsets are independent. A natural technical assumption is that the measure is locally nite, e.g. (B ) < 1 for any bounded Borel B . This guarantees that the number of the points in such a set is almost surely nite. The properties of Poisson processes are presented in detail in 7]. In the basic cell model, we consider two independent Poisson processes 0 and 1 in the plane representing the subscribers and the stations, respectively. Thus the parameters of the model reduce to the intensity measures 0 and 1 of these processes. One may for instance suppose that these two measures are proportional, i.e. 0 = 1 for some >> 1, which re ects the policy to set more stations in the places where there are more subscribers. The boundaries of the Voronoi cells which now become a random closed set, have Lebesgue measure 0. If the intensity measures are di use, i.e. they have density with respect to the Lebesgue measure, each 0-point (each subscriber) lies with probability 1 in a unique Voronoi cell constructed with respect to the process 1 (in other words, belongs to the zone of service of a unique station). The type of connections between stations and between 5

the station and its subscribers are the subject of further speci cation. For example, the stations can be directly linked if their cells are neighbours in the Voronoi tessellation. In this case, these links form the so called Delaunay triangulation. Another possibility is to connect directly all the stations within a speci ed distance R. Similarly, the subscribers can be connected to their station either via direct cables represented by segments (star network), or via intermediate concentrators (multi-level hierarchical network as described in the next section), or by some spanning graph, or by some mixture of these architectures. A typical con guration of the described model in the homogeneous star network case is shown in Figure 1. Here are the main distributions of interest for this model: the distribution of the geometric characteristics of the cells; e.g. the surface, the boundary length, the number of adjacent cells etc.; the distribution of the number of subscribers within a cell; the total length of connections between subscribers and the station to which they are connected; the distribution of geometric characteristics of the connections between the stations. Real telecommunications networks have complicated structures, where the stations play di erent roles depending on their level of hierarchy. Here we use the term stations in a broad sense, including for instance the concentration nodes where cables meet. The level of a station corresponds more or less to the minimal number of stations standing between this station and a network subscriber. We will call 0-level stations the subscribers themselves. The 1-st level stations are the stations directly connected to 0-level stations. The 2-nd level stations serve the 1-st level stations to which they are directly connected etc. The hierarchical structure of existing systems is well seen in the following chain: subscribers, distribution points, remote distribution points, remote concentrators, local exchange etc., though in reality it is rarely observed in a pure form. Nevertheless, the following model 6

2.2 Hierarchical model

0

W(0)

Stations Subscribers Cables Cell boundaries Figure 1: The Basic model with a single hierarchical level of stations (the connections between stations are not speci ed)

7

seems reasonable as the rst approach to the description of such multi-level systems. In this model there are N levels of stations, where N can take any integer value. The case N = 1 is not excluded. The stations of level i are represented by a realization of a homogeneous Poisson process i . The processes 0 ; 1 ; : : : ; N are supposed to be independent with decreasing intensities: 0 > 1 > : : : > N. Except for stations of level N , in the pure hierarchical model, stations with the same level have no direct connection between them. As in the basic model the stations of level j (j = 0; : : : ; N ? 1) are connected to their closest stations of level j + 1. The structure of the basic model repeats itself at each level: the cells of the stations of level j form the Voronoi tessellation of the plane with respect to the process j and the stations of level j ? 1 contained in a cell of a station x(j ) of level j are directly connected to the latter. Thanks to that similarity, the main characteristics of this model can be expressed by the characteristics of the basic model. Figure 2 shows a typical con guration of a hierarchical star network model. The simplest model of requests is based on the hierarchical cell model. Fix the con gurations of all processes (i) (i) i = fx1 ; x2 ; : : :g i = 0; 1; : : : ; N; and denote by fV (i) (x(i) )g1 the Voronoi cell of station x(i) of level i, with k k=1 k respect to the process i . For almost all x 2 R2 there exists a unique cell V (i) (x) (a cell of level i) which contains x. Let n(i) (x) denote its nucleus, i.e. the i-level station which is the closest to x. In our model, a station of level i calls a station of a level j located at the distance r of it with intensity fij (r), independently of all other stations and of ongoing communications. The conditions

N XZ 1

2.3 Modeling requests for communications

for each i = 0; 1 : : :, ensure that the number of calls made by each station in a nite time is almost sure nite. 8

j =0 0

rfij (r)dr < 1;

Figure 2: Hierarchical star network model with 3 levels of stations.

9

We now describe the circuit switching scheme. Given the availability of the required resources, a communication request from x(i) to x(j ) is routed as follows. Let h = h(x(i) ; x(j ) ) be the minimal hierarchy level such that V (h) (x(i) ) = V (h) (x(j ) ) or h = N if there is no such i. The communication is established via direct links from x(i) to n(i+1)(x(i) ), then from n(i+1)(x(i) ) to n(i+2)(x(i) ) etc., to n(h) (x(i) ); after that via links from n(h) (x(i) ) to n(h) (x(j ) ) (via connections between stations of the highest level N if h = N ) and nally via links from n(h) (x(j ) ) to n(h?1) (x(j ) ), etc. and from n(j +1)(x(j ) ) to x(j ). In the case when V (h) (x(i) ) = V (h) (x(j ) ) for a certain h, there exists a unique route of the described form between x(i) and x(j ) . The variable h will be called the height of communication between x(i) and x(j ) . Wireless communication systems can be integrated within our framework by adding: 1. a model for the road system; 2. a model of tra c on the roads; 3. a model for the radio communication handling (allocation, capturing, release, handover). The basic model can be used as follows: the emission/reception stations (antennas) are represented by a point process (equivalent to the rst level stations) with respect to which a random process of radio telephone users plays the same role as the process of xed subscribers in the basic model. In contrast, one of the main peculiarities of mobile communication systems is the phenomenon of handover which consists in rerouting the call when a mobile with communication in progress moves from one cell to another. As a model for the road system, we propose the so-called Poisson line process, where each line is characterized by the following parameters: p is the distance from the line to the origin, taken positive if the line is above 0 and negative otherwise (for vertical lines, p is the abscissa of the intersection point of the line with the abscissa axis). (0 < ) is the angle between the line and the abscissa axis (inclination); 10

2.4 Mobile communications

is the type of the road represented by the line (highway, one-way road, etc.); is the parameter de ning the tra c characteristics of the road. The road system is modeled by a realization of a Poisson process in the phase space R 0; ) S T , where the part E = R 0; ) S represents the position and the type of the road and T is the space of tra c parameters on a road, i.e. the parameters allowing one to characterize the positions and the velocities of the vehicles on a road. In the homogeneous case (i.e. when the distribution of the process is left invariant by shifts in the plane), the intensity measure takes the form:

r dp O(d

) Q( ; d ) T ( ; ; d );

where is the density of roads, the probability measure O(d ) on 0; ) gives the orientation distribution of a typical road,

r

type and inclination . If the orientation distribution O is uniform, we obtain an isotropic road model. If, in contrast, O has two atoms f0g and f =2g, we obtain the Manhattan type model, where the masses of the atoms represent the frequencies of the roads in each direction. Using measure Q, one can take into account di erent characteristics on roads of di erent directions (in Manhattan the avenues are larger than the streets). The simplest tra c model on a road is a Poisson marked process. For each road Di = (pi; i ; i ) of the line process, let x(i) denote the local coordinates and consider a set of independent Poisson processes associated with the lines of the process. The process i on a xed line Di is de ned on the phase space R R and driven by the intensity measure (i) dx(i) V (i) (dv). t 11

Q( ; d ) is the distribution of the type of a road having inclination , T ( ; ; d ) is the distribution of the tra c parameters on a road of

Here the parameter (i) gives the density of the tra c and V (i) (dv) is the t velocity distribution of a typical vehicle (which can be positive or negative with respect to the local coordinates). All these parameters depend on the inclination and the type of the road Di. A realization of this process has the following form X i (0) = (x ;v ) ; where the rst term gives the position of the j -th vehicle at a xed time, say, 0 and the second one gives its velocity. After a time t the process becomes

i(t) =

X

j

(i)

j

j

j

(x( ) +v t;v ) :

i j j j

An important property of a homogeneous Poisson process is that the distribution of the process i(t) coincides with that of i (0) (this result is known as Barlett's Theorem (cf 7], pp. 59-60 and 49]). When using this tra c model, one can take for space T the space of counting measures on R2. Then T ( ; ; ) is the distribution of the Poisson process with intensity measure t( ; ) dx V ( ; )(dv ) (in the previous notations t ( i ; i ) = (i) and V ( i ; i )(dv) = V (i) (dv)). For this model, here are t the most important distributions of interest: the distribution of the number of vehicles in a xed cell; the distribution of the number of cell boundary crossings in a speci ed time unit (the handover e ect explained earlier); the distribution of the sojourn time of a typical vehicle in a cell etc.

3 Analytical results

3.1 Basic cell model

Random Voronoi and Delaunay tessellations are well known objects in stochastic geometry. The rst two moments of the distributions of the main geometric characteristics can be found, e.g. in 10], 8]. From this, one obtains the moments of the distribution of the surface of a typical cell, its perimeter etc. A typical cell here means the cell of a 12

station "chosen at random" among all the stations of 1. An appropriate mathematical de nition is provided by Palm theory. By the ergodic theorem (cf. 5], p. 485), the empirical distribution of some characteristic Z of a point, obtained through an observation of the process in a large square ( window ) of size R, converges as R grows to in nity, to the Palm distribution of that characteristic. On the other hand, Slivnyak's Theorem (cf. 11], pp. 114 115]) states that the Palm distribution of Z coincides with the distribution of the characteristic Z of point 0, where the point at 0 is added to each con guration of the homogeneous Poisson process. The Voronoi cell of point 0 is denoted C0. Many interesting characteristics of a typical 1-point (station) fall into the following class of functionals:

Sf def =

X

x2

i

f (xi )1fxi 2 C0g;

0

where f (x) : R2 7! R+ is a given non-negative function. Often in practice the function f (x) depends only on the distance jxj and has the form f (x) = Djxj for some non-negative parameters ; D. The most interesting cases are: N , the number of 0-particles (subscribers) in a typical cell (here = 0; D = 1); L, the sum of the distances between all 0-particles (subscribers) in a typical cell and its nucleus (their corresponding station). The variable L corresponds to the values = 1; D = 1 and gives an estimate of the total cable length for connecting subscribers to stations. A better estimate to the total cable length can be obtained by adjusting the parameter relating the geographic distance to the corresponding cable length; this parameter can be estimated through the analysis of real data. In the rest of this subsection, we present analytical results obtained in 6].

which the integrals below exist. Then (i) ESf =

Z

0

Theorem 1 Let f; f1 and f2 be non-negative functions de ned on R2 for

f (x)e?

1

jxj2 dx;

(1)

13

(ii) cov(Sf ; Sf ) =

+

2 0

Z Z

1

f1 (x)f2 (x)e? jxj dx f1(x1 )f2(x2 ) e? A(x ;x ) ? e? (jx j +jx j ) ] dx1dx2; (2)

2

Z

0

1

2

1

1

2

1

1

2

2

2

where A(x1; x2) is the area of the union of two discs of radii x1 and x2 centered in x1 ; x2, respectively. In particular, the rst two moments of the distribution of the variables N and L are given by:

EN

= 2 =

0 1 0 3=2 1 0 1

(3) (4) + 0:280 + 0:147 2

0 3=2 1 2 0 2 1 2 0 3 1 2 0 5=2 : 1

EL = varN

(5) (6) (7)

var L =

0 2 1

cov (N ; L) =

+ 0:197

The proof of this theorem is based on the Palm theory observations, in particular, on Campbell's Theorem (cf. 11], p.99). The next result concerns the tail decay of the distribution of Sf , when f (x) = Djxj . It is based on large deviation techniques.

Theorem 2 There exist positive constants A1; A2; C1 and C2 depending on

0

and

1

only, such that for all positive x

A1x?1=(2+ ) exp(?C1x2=(2+ )) < PfSf > xg < A2 exp(?C2x2=(2+ ) ): (8) In particular, for all n 2 N,

(1 + 4 1= 0)?n < PfN

ng <

14

6

n+6

(1 + 0:347 1= 0)?n

(9)

The constants Ai ; Ci (i = 1; 2) are the unique solutions of certain equations. In the limiting case, when def 1= 0 vanishes, the decay rate con= stants Ci become: ! 2 + 2=(2+ ) (1 + o(1)); 1 C1 = 2=(2+ ) 2 2 D 0 ! 2 + 2=(2+ ) (1 + o(1)): 1 C =

2

More complete results can be found in 6]. These results are useful for statistical estimation of the number of subscribers and the total cable length in a cell. We use the notations of Section 2.3. Replacing the processes 0 and 1 by i and i+1, one obtains the characteristics of the number of stations of level i in a cell of the level i +1 and the length of cables connecting them by using the results of the Section 3.1. Let Q( ) be the probability that two xed points of the plane, distant of , belong to the same Voronoi cell of a tessellation constructed with respect to a homogeneous Poisson process with intensity 1. Simple scaling considerations p that the same probability for a Poisson process with intensity give is Q( ). Using the independence between the processes 0; : : : ; N , we obtain that the probability Hij (r; h) to have a communication of a height h between a station x(i) of level i and a station x(j ) of level j distant of r from it, can be expressed by the following formulae:

2=(2+ ) 0

D

3.2 Tra c in the hierarchical model

Hij (r; h)

8 > > > > > > < > > > > > :

8 > < => :

0; if h < i _ j or h = i = j < N ; 2 ); exp(? i_j r if h = i _ j < N; i 6= j ; 1; if h = i _ j = N ;

Hij (r; h) = >

(1 ? exp(? i_j r2)) Q(r h ) Qh?1i_j +1(1 ? Q(r m)); m= if h = i _ j + 1; : : : ; N ? 1; i 6= j ; (1 ? exp(? i_j r2)) QN ?1_j +1(1 ? Q(r m=i 15

p

p

p )); m

if h = N; i 6= j ;

and

where i _ j = maxfi; j g. The term 1 ? exp(? i_j r2 ) above is the probability that the station (minfi;j g) of the lower level does not belong to the cell of the station x(maxfi;j g) x of the higher level (that is always true if i = j ). The other terms give the probability that the least level cell containing the two stations has level h. This distribution allows one to express many characteristics of the model. In 1], the following characteristics were obtained: The mean number of calls of height h given by a xed station of level i by unit of time:

p ) Qh?1 (1 ? Q(rp )); if h = i + 1; : : : ; N ? 1; h m=i+1 m Hii (r; h) = > Q : N ?1 (1 ? Q(r p )); if h = N ,

8 > <

Q(r

m=i+1

m

Mi (h) = 2

N X

j =0

j

Z +1

0

rfij (r)Hij (r; h) dr:

In a system without capacity constraints, the mean number of communications of level h for a station of level i: 2

N X

where T ij (r; h) is the mean duration of a communication of height h from a i-level station to a j -level station at distance r of it. The function 1 ? Q( ) is known as the linear contact distribution function of a planar Voronoi tessellation (cf. 9]). Its numerical values as well as explicit upper and lower bounds are given in 1].

j =0

j

Z +1

0

rfij (r) T ij (r; h) Hij (r; h) dr;

3.3 Mobile communication models

We use the notations of the model for mobile communications introduced in Section 2.4. We are interested here in some characteristic of the tra c, expressed as a non-negative random variable, the distribution of which, denoted by T , depends on the position and the type of the road under consideration. More speci cally, 16

will be a family of random variables with distributions TD indexed by D 2 E = R 0; ) S the phase space of the road process. D ( ) will denote the characteristic function of the distribution TD . P Given a realization = i Di of the road process, consider the system of independent random variables i def D associated with the road system. = This is just another representation of the Poisson process introduced in Section 2.4. P The main quantity of interest is the additive functional def i i . Using = the independence of the system f i g, one obtains the following expression for the characteristic function of the variable :

D

i

( )=E

Y

D 2supp

i

D(

i

):

Now using the explicit expression for the Poisson process generating functional (cf. 5, p.225]), we obtain the following theorem:

Theorem 3

( ) = exp

Z

where M (dD) = r dp O(d ) Q( ; d ) is the intensity measure of the road process . In particular, if the integral below exist, then

E var

E

( D ( ) ? 1) M (dD) ;

(10)

=

Z

=

EZ

ET D M (dD);

E

2 ET D M (dD); :

(11) (12)

where ET denotes expectation with respect to the distribution TD . Typical examples of such additive functional are the number of communicating vehicles within a cell, and the number of the cell boundary crossings per unit time. For Z a domain of R2, let

hit(Z ) def f(p; ) 2 R 0; ) : the line (p; ) intersects Z g: = For D = (p; ; ) with (p; ) 2 hit(Z ), let D be the number N (Z ) of vehicles in communication on road (p; ) and within Z . We take D = 0 if (p; ) 62

17

Consider, for example, the tra c model described in Section 2.4. The positions of communicating vehicles on a road (p; ; ) at a xed instant are given by a homogeneous Poisson process with intensity t ( ; ). Let l(p; ) be the length of the intersection of the road (p; ) with Z . The number of the vehicles in this part of the road has Poisson distribution with parameter t( ; )l(p; ). So taking

D(

hit(Z ). As a direct application of the last theorem, we obtain the distribution of the number of the vehicles in communication inside Z .

) = expf t ( ; )l(p; )(e ? 1)g

)

in (10), we obtain the characteristic function of N (Z ). In the case of an isotropic road system, Formula (10) becomes ( ) = exp

(

r

Z

S

Q(d )

Z

hit(Z )

(expf t ( )l(p; )(e ? 1)g ? 1) d dp (13) )Q(d )

Z

and the moments of the distribution of N (Z ) are given by

EN (Z ) = r jZ j

Z

varN (Z ) = EN (Z ) + r

S

t(

S t

2(

)Q(d )

Z

(14)

l2 (p; ) d dp: (15) hit(Z )

R

Here we have used the following elementary fact that hit(Z ) l(p; ) d dp equals times the area jZ j of the domain Z . A similar calculation can be done within the framework of the basic cell model, when we take the Voronoi cell C0 (a random set!) as the domain Z . In 1] we obtained the following expressions

EN (C0 ) = r t ;

1

varN (C0 ) = r t

where

k def t =

Z

1

+ 0:672

r 2 t 3=2

1

+ 0:280

r t ;

2 1

( S t

k

)Q(d ):

Another problem of this type is the number of boundary crossings. The same machinery can be used to nd the distribution of the total number of 18

crossings of a xed line segment in the plane during a time unit. For this take D to be the number of crossings of an intersection point of the line D = (p; ; ) with the segment and apply Theorem 3. Unfortunately, this is the only situation when Theorem 3 is directly applicable. The problem with general domain Z is that, with positive probability, there are more than one intersection point, and the number of crossings in these points are strongly dependent (in fact, it can be shown that these variables are associated). This does not matter for computing the rst moment of the total number F (Z ) of the boundary crossings since the expectation is always additive regardless the dependence of the summands. Nevertheless, lower and upper bounds can be derived for higher moments and general domains Z as it is shown bellow. Consider, for example, an isotropic road system with a homogeneous Poisson process as the tra c model on the roads. As above t ( ) is the intensity of communicating vehicles on a road of type and each vehicle is uniformly marked by a velocity with distribution V (dv). It can be shown that the number of crossings of a xed point on such a road follows the Poisson distribution with parameter t ( )E jV j, where the last term is the mean of the absolute value of the velocity on a road of type (expectation with respect to the measure V ). Now, a direct application of Formula (14) leads to Theorem 4 The mean number of crossings of a xed domain Z equals 2 EF (Z ) = j@Z j M ;

r 1

where j@Z j is the length of the boundary of Z and

M1 =

Z

t( )E

jV j Q(d ):

1

For a typical Voronoi cell in the basic model, this number is 8 EF (C0) = p r M1:

The following result can also be found in 1]: Theorem 5 The variance of the number of boundary crossings of a convex domain Z is bounded by 2 j@Z jM varF (Z ) 4 j@Z jM ;

r

2

r

2

19

where

M2 = ( t ( )E jV j + ( t ( )E jV j)2 ) Q(d ):

varF (C0)

r

"

Z

For the basic cell model " # r 0; 945M1 + 8M2 p

1 1

0; 945M1 + 16M2 : p

1 1

#

Consider the following optimization problem: for connecting each subscriber to one concentrator, one can either use a direct link, or an indirect link via some distribution point. A distribution point is a location where several links originating from subscribers can be grouped into one further link to some concentrator with some economy of scale. The general assumption is still that connections are always to the closest point (i.e. each subscriber is connected to the closest distribution point, and each distribution point to the closest concentrator) What is the optimal intensity of such distribution points? Consider 3 independent homogeneous Poisson processes i (i = 0; 1; 2) in the plane R2 with intensities i , representing subscribers (process 0), distribution points (process 1) and concentrators (process 2), respectively. Each point of the process 0 is connected to a point of process 1 according to the least distance principle. Similarly, each points of 1 is connected to the closest point of the process 2. In a typical example, these connections represent cables. Each cable has an associated cost which consists of two parts: 1. the cost of the cable itself, and 2. the cost of the civil engineering (trench, post supports etc.) The cost of a cable connecting a point of i to the closest point of i+1, is given by a polynomial function Ci;i+1r , where r is the distance between the points and Ci;i+1; i;i+1 are some non-negative parameters. The cost of the civil engineering is given in this case by the function Ei;i+1r" , where Ei;i+1; "i;i+1 > 0. Note, that the cables from a distribution point to a concentrator share the same civil engineering, and it is reasonable to assume that the cost of

i;i+1 i;i+1

3.4 Example of architecture optimization

20

civil engineering does not depend on the number of cables which are grouped there. Our goal here is to nd the optimal ratio between intensities of the processes which minimizes the average cost of the connections of a typical concentrator. More precisely, the cost function is the following:

G = E2 :D1N1 (0) +

+

X

def

8 <

X

h

x 2 0 \V1 (y )

j i

39 = (E01jxj ? yij"01 + C01jxj ? yi j 01 ) 5; :

i

y 2 1 \V2 (0)

E12jyi j" + C12jyi j N0(yi )

12 12

(16)

Here and below, Ek denotes the expectation with respect to the Palm distribution of the process k ; Vk (x) is the Voronoi cell constructed with respect to the process k , with nucleus x 2 k ; D1 is the cost of maintenance and installation of a distribution point; Nk (x) is the number of k -points in Vk+1(x) (k = 0; 1). The following result is proved in 3]: Let

A1 = A2 =

? "12 =2 "12 =2+2 2

12

E12

in the point

Theorem 6 The cost function G has a unique minimal value in 1, attained

1

01 A3 = E012 0 ? "2 + 1 ; " = 2 ! C01 0 ? 01 + 1 : A4 = =2 2

01 01

=2 2

C12

"12 + 1 + D1 ; 2

2 +1 ;

12

0

12

=2+2 ?

!

2

2

which solves the equation

A3"01

?("01 =2+1) + A

1

4 01 1

?( 01 =2+1) = 2A

1:

21

In particular case when "01 =

(A3 + A4) 2=(2+ ) 1= 2A1 and the minimal value of the cost function is equal to

01 "

def

=

we obtain

#

G( 1 ) =

"

+ 2A

1

=(2+ )

"

2

(A3 + A4)

#2=(2+ )

+ A2 :

For = 1 we obtain respectively

#2=3 0 (C01 + E01 ) and 1= 2 2E12 + 4D1 3=2 2 3 2=3 G( 1 ) = 5=20 3=2 (E12 + 2D1 3=2)1=3(C01 + E01)2=3 + 2 2 2

12

=2 212 =2+2

C12

0

?

2 +1 :

12

!

4 Perspectives

The proposed approach to the modeling of telecommunication networks can be used for several variations on the basic models introduced here. As an illustration of this assertion, consider again hierarchical model. The main drawback of the model is that it only contains hierarchical links between stations. However, real systems may have connections to several stations of the higher level, for reliability reasons. These auxiliary connections can easily be taken into consideration. It is su cient to connect the lower level stations not only to their closest, but to the second closest, third closest etc. stations of the next level. This construction leads to a thinner tessellation than the Voronoi tessellation, which was also studied in the literature. One can derive geometric characteristics of these auxiliary connections as we do in 1]. Unfortunately, analytical methods are not always possible for complex models (as e.g. non-homogeneous, non-Poisson models etc. or even many complex phenomena of Poisson models). For such situations simulations are sometimes the only possible way of studying the system behavior. In connection with this, we would quote the stochastic gradient methods developed by the authors in 2] and 1]. 22

Some non-homogeneous models can also be treated by change of space methods described in 1]. This is important since real systems are rather far from being homogeneous.

23

References

1] F. Baccelli, M. Klein, M. Lebourges, and S. Zuyev. G om trie al atoire et architecture de r seaux de communications. Annales des T l communications, 1996. 2] F. Baccelli, M. Klein, and S. Zuyev. Perturbation analysis of functionals of random measures. Adv. in Appl. Probab., 27:306 325, 1995. 3] F. Baccelli and S. Zuyev. Optimal poisson spanning; optimization of distribution in a communication network. Operations Research, 1995, submitted. 4] N. Curien and M. Gensollein. Economie des T l communications. Ouverture et r glementation. Economica-ENSPTT, Paris, 1992. 5] D. J. Daley and D. Vere-Jones. An Introduction to the Theory of Point Processes. Springer, New York, 1988. 6] S. Foss and S. Zuyev. On a certain Voronoi aggregative process related to a bivariate Poisson process. Adv. in Appl. Probab., 1995. 7] J. F. C. Kingman. Poisson Processes. Oxford Studies in Probability. Oxford Univ. Press, 1993. 8] J. M ller. Lectures on random Voronoi tesselations, volume 87 of Lect. Notes in Statist. Springer-Verlag, 1994. 9] L. Muche and D. Stoyan. Contact and chord length distributions of the Poisson Voronoi tesselation. J. Appl. Probab., 29:467 471, 1992. 10] A. Okabe, B. Boots, and K. Sugihara. Spatial tesselations. Wiley series in probability and mathematical statistics. Wiley, 1992. 11] D. Stoyan, W. S. Kendall, and J. Mecke. Stochastic Geometry and its Applications. Wiley series in probability and mathematical statistics. Wiley, Chichester, 1987.

24

赞助商链接

- PAC LEARNING WITH GENERALIZED SAMPLES AND AN APPLICATION TO STOCHASTIC GEOMETRY 1
- Robust Camera Pose Recovery Using Stochastic Geometry
- Stochastic Differential Geometry and the Random Flows of Viscous and Magnetized Fluids in S
- THE COSMIC FOAM STOCHASTIC GEOMETRY AND SPATIAL CLUSTERING ACROSS THE UNIVERSE
- NEW THEORY OF PATTERN RECOGNITION ON THE BASIS OF STOCHASTIC GEOMETRY
- Communication Networks -05 -Communication Process And Layered Architecture
- Probability of stochastic processes and spacetime geometry
- Stochastic geometry and wireless networks
- Design and analysis of quality of service on distributed fault-tolerant communication networks
- Weighted networks of scientific communication the measurement and geometrical role of weigh
- Stochastic Differential Geometry and the Random Flows of Viscous and Magnetized Fluids in S
- architecture and design—distributed networks, wireless communication
- An Overview of Quality of Service (QoS) and QoS Routing in Communication Networks
- A Quality Of Service Framework for Communication Networks and Distributed Systems
- Construction and Maintenance of a Cluster-based Architecture for Sensor Networks

更多相关文章：
更多相关标签：