1 © NOKIA Presentation_Name.PPT / 13-11-2003 / Jukka K. Nurminen OR at Nokia Research Center Jukka K. Nurminen Nokia Research Center

Slides:

Advertisements

Similar presentations

Voice and Data Encryption over mobile networks July 2012 IN-NOVA TECNOLOGIC IN-ARG SA MESH VOIP.

Advertisements

Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.

Green Network Project Contract

5387 Avion Park Drive Highland Heights, Ohio INTUNE v4.4 Demonstration.

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

Company Confidential 1 © 2005 Nokia DBUpgradeTool_ ppt / / JMa A Database Upgrade Tool Nokia Networks Jukka Maaranen.

SensMax People Counting Solutions Visitors counting makes the most efficient use of resources - people, time and money, which leads to higher profits in.

Nokia Technology Institute Natural Partner for Innovation.

Robot Sensor Networks. Introduction For the current sensor network the topography and stability of the environment is uncertain and of course time is.

1 MM3 - Reliability and Fault tolerance in Networks Service Level Agreements Jens Myrup Pedersen.

Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 19 Scheduling IV.

Decision Making: An Introduction 1. 2 Decision Making Decision Making is a process of choosing among two or more alternative courses of action for the.

A Context Aware Framework Mark Assad Supervisor: Bob Kummerfeld.

Intelligent machines, the “idiots savants” A High Dessert presentation at University College By Felisa J Vázquez-Abad Dept of Computer Science and Operations.

Ee392n - Spring 2011 Stanford University Intelligent Energy Systems 1 Lecture 3 Intelligent Energy Systems: Control and Monitoring Basics Dimitry Gorinevsky.

Module 3.4: Switching Circuit Switching Packet Switching K. Salah.

Operational Research II By Dr. SW Poon. Line of Balance.

EE 4272Spring, 2003 Chapter 10 Packet Switching Packet Switching Principles  Switching Techniques  Packet Size  Comparison of Circuit Switching & Packet.

*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.

Scheduling Algorithms for Wireless Ad-Hoc Sensor Networks Department of Electrical Engineering California Institute of Technology. [Cedric Florens, Robert.

William Stallings Data and Computer Communications 7th Edition

WSN Simulation Template for OMNeT++

Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.

Kick-off meeting 3 October 2012 Patras. Research Team B Communication Networks Laboratory (CNL), Computer Engineering & Informatics Department (CEID),

Decision Making Pr. J.F. Lebraty University of Lyon April

CEM 514 Modeling of Construction Operations The LP/IP hybrid method for construction time-cost trade-off analysis By Samir Abdallah Sulaiman.

 Group 3 Vahe Karapetyan Dena Rad Eidin Balali Patrick Njathi Zhong Zheng Damilare Adeoye Operations Research & Linear Programming Agenda Introduction.

Bioinformatics Protein structure prediction Motif finding Clustering techniques in bioinformatics Sequence alignment and comparison Phylogeny Applying.

Presentation on Copyright (c) 2011 Presentation Point ( m)

Multiple Criteria Optimisation for Base Station Antenna Arrays in Mobile Communication Systems By Ioannis Chasiotis PhD Student Institute for Communications.

1 CMPT 275 High Level Design Phase Architecture. Janice Regan, Objectives of Design  The design phase takes the results of the requirements analysis.

Lucent Technologies Bell Labs Innovations Lucent Technologies - Proprietary Access to the Global Internet: Which Technology Will Win? Evolution +3G builds.

Optimal Power Control, Rate Adaptation and Scheduling for UWB-Based Wireless Networked Control Systems Sinem Coleri Ergen (joint with Yalcin Sadi) Wireless.

A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.

 Protocols used by network systems are not effective to distributed system  Special requirements are needed here.  They are in cases of: Transparency.

NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /

Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.

1 Self-stabilizing Algorithms and Frequency Assignment Problems.

ECEN “Internet Protocols and Modeling”, Spring 2012 Slide 2.

Issues in (Financial) High Performance Computing John Darlington Director Imperial College Internet Centre Fast Financial Algorithms and Computing 4th.

Advanced Spectrum Management in Multicell OFDMA Networks enabling Cognitive Radio Usage F. Bernardo, J. Pérez-Romero, O. Sallent, R. Agustí Radio Communications.

Business Data Communications, Fourth Edition Chapter 11: Network Management.

Rev A Mikko Suominen Enhancing System Capacity and Robustness by Optimizing Software Architecture in a Real-time Multiprocessor Environment.

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

CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.

KAIS T On the problem of placing Mobility Anchor Points in Wireless Mesh Networks Lei Wu & Bjorn Lanfeldt, Wireless Mesh Community Networks Workshop, 2006.

Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.

Funda Ergun Behnam Malakooti Case Western Reserve University NAG Intelligent and Agile Protocols and Architectures for Space and Terrestrial Networks.

Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.

Research Project / Applications Seminar SYST 798 STATUS REPORT 20 March 2008 Team:Brian Boynton Tom Hare Eric Ho Matt Maier Ali Raza Key Sponsor: Dr. Kuo-Chu.

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

Distributed Algorithms for Dynamic Coverage in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver.

Switching. Circuit switching Message switching Packet Switching – Datagrams – Virtual circuit – source routing Cell Switching – Cells, – Segmentation.

Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.

Decisive Themes, July, JL-1 ARTEMIS Decisive Theme for Integrasys Pedro A. Ruiz Integrasys July, 2011.

Lecture 20 Review of ISM 206 Optimization Theory and Applications.

Personal Trip Assistance System. Intelligent Transport Systems Increase in traffic intensity  need for intelligent way for road usage.

2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)

Ad-hoc Networks.

Computing and Compressive Sensing in Wireless Sensor Networks

Phase transition in the Countdown problem

ERA CCRCC 2017 Michael Klöcker Session II

Video and Sensor Network Architecture and Displays

A Survey of Routing Techniques for Mobile Communication Networks

UCSD’s Responsphere Infrastructure

B.Ramamurthy Appendix A

Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.

Data and Computer Communications

X y y = x2 - 3x Solutions of y = x2 - 3x y x –1 5 –2 –3 6 y = x2-3x.

Table 2: Experimental results for linear ELP

Presentation transcript:

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

2 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Where is OR at NRC? OR analysts => No LP & Simplex => No Dynamic programming => No Integer programming => No Game theory => No Decision analysis => No At first glance there is little use of OR BUT…

3 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Design an electronic circuit fulfilling a given specification with minimum cost minimum power usage minimum size maximum reuse … Simulation -> Analog Circuit Design

4 © 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 + Simulations -> Distributed computing

5 © 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 … Graph theory -> Network Planning Tool

6 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Queuing Models -> IP network analysis time Packets in the system: - under service - waiting N - arriving packet - departing packet Little’s law: E[N]=E[W]  If:  =   L/C < 1 i.e. if the system is stabile

7 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Data analysis -> Location Detection Algorithms

8 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Statistical analysis -> Analysis of management data

9 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Non-linear programming -> Auto-tuning of base station parameters Cell pilot power P(t) is controlled with formulas:

10 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Self-organizing maps -> Context recoqnition Sensor signals for various user movements Data from a user scenario snapshot of three acc signals

11 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen What kind of OR works? OR tools and techniques embedded to application domain specific solutions Problem-solving mindset Simple, straightforward solutions Flexibility to evolve Fast and evolutionary development Meeting new and unexpected needs Tools complement rather than replace human experts Strict optimality or highly efficient algorithms are seldom needed