1 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen Optimaalisen tietoliikenneverkon suunnittelu Jukka K. Nurminen Nokia Research Center

Slides:

Advertisements

Similar presentations

Ch. 12 Routing in Switched Networks

Advertisements

Performance in Decentralized Filesharing Networks Theodore Hong Freenet Project.

Scalable Routing In Delay Tolerant Networks

Multipath Routing for Video Delivery over Bandwidth-Limited Networks S.-H. Gary Chan Jiancong Chen Department of Computer Science Hong Kong University.

1 EL736 Communications Networks II: Design and Algorithms Class1: Introduction Yong Liu 09/05/2007.

Peer-to-Peer and Social Networks An overview of Gnutella.

1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.

Mobile Ad-hoc Network Simulator: mobile AntNet R. Hekmat * (CACTUS TermiNet - TU Delft/EWI/NAS) and Radovan Milosevic (MSc student) Mobile Ad-hoc networks.

Capacity Planning IACT 918 July 2004 Gene Awyzio SITACS University of Wollongong.

Communications Research Centre (CRC) Defence R&D Canada – Ottawa 1 Properties of Mobile Tactical Radio Networks on VHF Bands Li Li & Phil Vigneron Communications.

1 Introduction to Network Layer Lesson 09 NETS2150/2850 School of Information Technologies.

Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.

Data and Computer Communications

Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.

Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, and Chonggang Wang University of Minnesota, AT&T Lab, Arizona State University, Syracuse University, NEC.

A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.

DIJKSTRA’s Algorithm. Definition fwd search Find the shortest paths from a given SOURCE node to ALL other nodes, by developing the paths in order of increasing.

Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.

Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.

Jaringan Komputer Lanjut Packet Switching Network.

1 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen OR at Nokia Research Center Jukka K. Nurminen Nokia Research Center

Channel Allocation Protocols. Dynamic Channel Allocation Parameters Station Model. –N independent stations, each acting as a Poisson Process for the purpose.

Playback delay in p2p streaming systems with random packet forwarding Viktoria Fodor and Ilias Chatzidrossos Laboratory for Communication Networks School.

Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.

LightFlood: An Optimal Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

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.

Volcano Routing Scheme Routing in a Highly Dynamic Environment Yashar Ganjali Stanford University Joint work with: Nick McKeown SECON 2005, Santa Clara,

1 Introduction to Networking Lesson 01 NETS2150/2850.

Traffic Engineering Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.

NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.

William Stallings Data and Computer Communications 7th Edition

Exploiting Content Localities for Efficient Search in P2P Systems Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang 1 1 College of William and Mary,

LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.

1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Sections 8.1 – 8.5)

Dynamic routing – QoS routing Load sensitive routing QoS routing.

Module 2.0: Modeling of Network Components. Queueing theory  Basics : average number of packets 1/  : mean service time per packet [s] arriving per.

1 Internet Management and Security We will look at management and security of networks and systems. Systems: The end nodes of the Internet Network: The.

1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:

Network Topologies.

Model and tools. Traffic Model Poisson law – Napoléon worries about the statistics of horse accidents of his generals – Poisson confirms these are unfrequent.

Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.

LECTURE 9 CT1303 LAN. LAN DEVICES Network: Nodes: Service units: PC Interface processing Modules: it doesn’t generate data, but just it process it and.

Network Aware Resource Allocation in Distributed Clouds.

“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.

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.

Data and Computer Communications Chapter 10 – Circuit Switching and Packet Switching (Wide Area Networks)

Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.

1 V1-Filename.ppt / / Jukka K. Nurminen Content Search UnstructuredP2P Content Search Unstructured P2P Jukka K. Nurminen *Partly adapted from.

J.Tiberghien - VUB09-06-K.Steenhaut & J.Tiberghien - VUB 1 Telecommunications Concepts Chapter 1.6 Multiplexing & Routing.

SIGCOMM 2001 Lecture slides by Dr. Yingwu Zhu Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.

1 Dr. Ali Amiri TCOM 5143 Lecture 8 Capacity Assignment in Centralized Networks.

Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.

FastTrack Network & Applications (KaZaA & Morpheus)

PEER TO PEER (P2P) NETWORK By: Linda Rockson 11/28/06.

Efficient P2P Search by Exploiting Localities in Peer Community and Individual Peers A DISC’04 paper Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang.

Lecture # 03 Switching Course Instructor: Engr. Sana Ziafat.

LightFlood: An Efficient Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

Ethernet. Ethernet  Ethernet is the standard communications protocol embedded in software and hardware devices, intended for building a local area network.

Rehab AlFallaj.  Network:  Nodes: Service units: PC Interface processing Modules: it doesn’t generate data, but just it process it and do specific task.

Self-stabilizing energy-efficient multicast for MANETs.

Delay in packet switched network. Circuit switching In Circuit switched networks the resources needed along a path (buffers and link transmission rate)

Indian Institute of Technology Bombay 1 Communication Networks Prof. D. Manjunath

Computer Communication & Networks Lecture # 03 Circuit Switching, Packet Switching Nadeem Majeed Choudhary

-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.

Towards an integrated multimedia service hosting overlay Dongyan Xu Xuxian Jiang Proceedings of the 12th annual ACM international conference on Multimedia.

Network Processing Systems Design

Multi-hop Coflow Routing and Scheduling in Data Centers

Coverage and Connectivity in Sensor Networks

Data and Computer Communications

Host and Small Network Relaying Howard C. Berkowitz

Presentation transcript:

1 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Optimaalisen tietoliikenneverkon suunnittelu Jukka K. Nurminen Nokia Research Center

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

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

4 © NOKIA Presentation_Name.PPT / / 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 / / 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 / / 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 / / 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 / / Jukka K. Nurminen Peer-to-peer Network Analysis 1.Content sharing 2.Distributed computing

9 © NOKIA Presentation_Name.PPT / / 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 / / 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 / / 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 / / Jukka K. Nurminen Simulation results

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

14 © NOKIA Presentation_Name.PPT / / 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) Personal Java on Nokia Communicator mobile phone +