Optimaalisen tietoliikenneverkon suunnittelu

1
Optimaalisen tietoliikenneverkon suunnittelu

• Jukka K. Nurminen
• Nokia Research Center
• jukka.k.nurminen_at_nokia.com

2
Cellular Network Planning

• Radio network
• Transmission network
• Packet network

3
Radio Network Planning

• Composite Coverage displays

• Signal propagation models
• Heuristic frequency allocation algorithms

4
Transmission Network Planning Tool

• Plan the transmission network to connect GSM
  basestations with
• minimum cost
• high reliability
• easy maintenance
• flexibility for growth

• Shortest path routing
• Two disjoint paths routing
• Multilayer routing
• Topology generation
• Min spanning tree
• Traveling salesman

5
Packet Network Modeling

• IP, ATM
• Parameters (random variables)
• packet inter-arrival time
• number of packets in a packet call
• packet length
• reading time between packet calls

6
Interrupted Poisson Process (IPP)

• ON period -exponentially distributed with mean
  1/?ON
• OFF period -exponentially distributed with
  mean 1/?OFF
• Arrival rate -exponentially distributed with
  parameter ?a
• Packet length

ON period
OFF period
7
Queuing Models
Queuing models are suitable for describing
(modeling) packet switched nodes and networks

• l - packet arrival rate
• L average packet length
• C link capacity
• 1/m average service time
• W waiting time in the buffer
• d delay
• N number of packets in the system
• r - traffic load

m
C
Departing packets
Arriving packets
l, L
server
buffer
Outgoing link
The mean delay in the node is equal to the sum of
the mean waiting time in the buffer and the mean
service time
EdEW1/ m EWL/C
8
Peer-to-peer Network Analysis

• Content sharing
• Distributed computing

9
Content sharing
MP3 music, pictures, DVD movies, etc.
10
How it works?
Gnutella
Napster
2. Propagate search
5. Transfer
4. Hit found
3. Transfer
1. Search
1. Register 2. Search
0. Connect
Search A.mp3
11
Topologies for Content Sharing

• Reported power law (fit get fitter, rich get
  richer) evolved into multimodal very dynamic
• cannot be easily emulated
• Chosen options
• Random nodes have random number of connections
• Semi nodes have random number of connections, at
  least 1
• ConMesh nodes connect to existing network
• ConStars ConMesh leaf nodes

12
Simulation results
13
Distributed computing

• Currently on distributed PCs
• Can such applications run on mobile phones?

14
Lucas-Lehmer test 2p-1 is prime if and only if
S(p-1) 0 (mod 2p-1),where S(1) 4 and S(k1)
S(k)2-2.
Personal Java on Nokia Communicator