We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byJuliet Merton
Modified over 2 years ago
1 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Optimaalisen tietoliikenneverkon suunnittelu Jukka K. Nurminen Nokia Research Center firstname.lastname@example.org
2 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Cellular Network Planning 1.Radio network 2.Transmission network 3.Packet network
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 © 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 © 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 © 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 © 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 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Peer-to-peer Network Analysis 1.Content sharing 2.Distributed computing
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 © 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 © 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 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Simulation results
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 © 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 +
1 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen OR at Nokia Research Center Jukka K. Nurminen Nokia Research Center
Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
Multipath Routing for Video Delivery over Bandwidth-Limited Networks S.-H. Gary Chan Jiancong Chen Department of Computer Science Hong Kong University.
Communications Research Centre (CRC) Defence R&D Canada – Ottawa 1 Properties of Mobile Tactical Radio Networks on VHF Bands Li Li & Phil Vigneron Communications.
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, and Chonggang Wang University of Minnesota, AT&T Lab, Arizona State University, Syracuse University, NEC.
Peer-to-Peer and Social Networks An overview of Gnutella.
Towards an integrated multimedia service hosting overlay Dongyan Xu Xuxian Jiang Proceedings of the 12th annual ACM international conference on Multimedia.
FastTrack Network & Applications (KaZaA & Morpheus)
Capacity Planning IACT 918 July 2004 Gene Awyzio SITACS University of Wollongong.
Delay in packet switched network. Circuit switching In Circuit switched networks the resources needed along a path (buffers and link transmission rate)
MIT Fun queues for MIT The importance of queues When do queues appear? –Systems in which some serving entities provide some service in a shared.
Scalable Routing In Delay Tolerant Networks
1 V1-Filename.ppt / / Jukka K. Nurminen Content Search UnstructuredP2P Content Search Unstructured P2P Jukka K. Nurminen *Partly adapted from.
Ch. 12 Routing in Switched Networks
1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Sections 8.1 – 8.5)
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
A Peer-to-Peer On-Demand Streaming Service and Its Performance Evaluation Presenter: Nera Liu Author: Yang Guo, Kyoungwon Suh, Jim Kurose and Don Towsley.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
© 2017 SlidePlayer.com Inc. All rights reserved.