1. 1 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Optimaalisen tietoliikenneverkon suunnittelu Jukka K. Nurminen Nokia Research Center jukka.k.nurminen@nokia.com

2. 2 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Cellular Network Planning 1.Radio network 2.Transmission network 3.Packet network

3. 3 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Radio Network Planning • Composite Coverage displays • Signal propagation models • Heuristic frequency allocation algorithms

4. 4 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Plan the transmission network to connect GSM basestations with • minimum cost • high reliability • easy maintenance • flexibility for growth • … Transmission Network Planning Tool • Shortest path routing • Two disjoint paths routing • Multilayer routing • Topology generation •Min spanning tree •Traveling salesman

5. 5 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen 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. 6 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen 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  OFF  ON  a OFFON ON period OFF period

7. 7 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Queuing Models Queuing models are suitable for describing (modeling) packet switched nodes and networks buffer server Arriving packets Departin g packets Outgoin g link  L  C •  - packet arrival rate • L – average packet length • C – link capacity •1/  – average service time • W – waiting time in the buffer • d – delay • N – number of packets in the system •  - traffic load The mean delay in the node is equal to the sum of the mean waiting time in the buffer and the mean service time E[d]=E[W]+1/  = E[W]+L/C

8. 8 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Peer-to-peer Network Analysis 1.Content sharing 2.Distributed computing

9. 9 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Content sharing • Napster • Systems based on FastTrack KaZaA Grokster Morpheus (earlier) • Gnutella LimeWire Shareaza Morpheus (newer) Centralized Distributed MP3 music, pictures, DVD movies, etc.

10. 10 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Search A.mp3 1. Register 2. Search 3. Transfer Napster How it works? Gnutella 1. Search 5. Transfer 2. Propagate search 0. Connect 4. Hit found

11. 11 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen 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. 12 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Simulation results

13. 13 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Distributed computing • Currently on distributed PCs • Can such applications run on mobile phones?

14. 14 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Client 3 Client 2Client/Server 1 Client 4 Client 5 Root server Lucas-Lehmer test: 2 p -1 is prime if and only if S(p-1) = 0 (mod 2 p -1), where S(1) = 4 and S(k+1) = S(k) 2 -2. Personal Java on Nokia Communicator mobile phone +