A Strategy to Manage Cache Coherency in a Distributed Mobile Wireless Environment
|
|
- Donald Randall
- 6 years ago
- Views:
Transcription
1 A Strategy to Manage Cache Coherency in a Distributed Mobile Wireless Environment Anurag Kahol, Sumit Khurana, Sandeep K. S. Gupta, and Pradip K. Srimani Shumei Chen Hoang Nguyen Jeff Wilson Team Members 11/14/01 2 1
2 Outline Introduction Proposed Scheme & Comparison with Existing Schemes Formal Description of the Proposed Scheme Performance Analysis Performance Comparison Conclusions 11/14/01 3 Objectives Introduction Minimize overhead for MH to validate cache upon reconnection Allow stateful servers Minimize bandwidth requirement 11/14/01 4 2
3 Approach Introduction (cont.) Use asynchronous cache invalidation messages Buffer invalidation messages from servers at MH s Home Location Cache (HLC) when MH is disconnected, and deliver upon reconnection 11/14/01 5 Results Introduction (cont.) Average data access latency is reduced Numbers of up-link requests by MH decrease Cost is buffers (and buffer management) at HLC Validation Mathematical model Simulation 11/14/01 6 3
4 Background Caching improves performance in distributed systems Query response time Throughput Caching concerns What to cache Invalidation Consistency 11/14/01 7 Background (cont.) Mobile computing issues Low power (battery) Frequent disconnects (planned and unplanned) Mobility 11/14/01 8 4
5 Background (cont.) Cache maintenance is intended to maintain consistency must conserve battery power Energy efficient Adapt to varying QoS 11/14/01 9 Background (cont.) Caching scheme factors Data access patterns and update rates Communication/access costs Client mobility pattern Connectivity characteristics (disconnection pattern, available bandwidth,.) Location dependence of the data 11/14/
6 Background (cont.) Cache invalidation Wired approach (e.g., NFS) not suitable for wireless Most mobile environment schemes are based on a call-back (invalidation report) mechanism Must account for cases where MH may be disconnected at time invalidation report is sent 11/14/01 11 System model 11/14/01 12 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment 6
7 States of Operation Data Hoarding Reintegration Disconnected 11/14/01 13 Mobile Host States Wake-up Awake (Active, Dozing) Sleep 11/14/
8 Communication Up-link (query) Down-link (reply) 11/14/01 15 Caching MH caches portion of database in memory to reduce number of up-link requests (queries) required The challenge is to ensure client cache remains consistent with shared database 11/14/
9 Assumptions Whenever any data item anywhere is updated, an invalidation message is sent to all MSS via wired network (perfect connectivity) MH can detect network connection state MH informs HLC before it stores (or updates) any data item in its local cache (implies connection is required) 11/14/01 17 Assumptions (cont.) Static host which is nearest to the MH, and maintains HLC of the MH, forwards to the MH any invalidation reports it receives 11/14/
10 Proposed Scheme Pre-assigned static MSS maintains MH home location cache (HLC) For a roaming MH, its HLC is duplicated at the MSS of its current cell An MSS always maintains an HLC for each MH in its coverage area at any given time 11/14/01 19 Proposed scheme (cont.) Each HLC being maintained in the MSS keeps track of what data have been locally cached at MH The HLC is a list of records (x,t,invalid_flag) for each data item x locally cached at MH (x is the ID of data item and T is the timestamp of the last invalidation of x) 11/14/
11 Proposed scheme (cont.) Invalidation reports are transmitted asynchronously and are buffered at the MSS until explicit acknowledgment is received from the specific MH. The invalid_flag is set to true for data items for which an invalidation report has been sent to the MH but no acknowledgment is received 11/14/01 21 Proposed scheme (cont.) Each MH maintains a local cache of data items it frequently accesses. Before answering queries from application, it will verify whether requested data is in consistent state. If data is valid, it will satisfy the query, otherwise an uplink request to MSS is needed 11/14/
12 Proposed scheme (cont.) When MH receives invalidation report from MSS, it marks a particular data item in its local cache invalid Cache time stamp is used to allow MA to discard invalidations it no longer needs to keep and determine which invalidation it needs to resend to MH 11/14/01 23 Proposed scheme (cont.) MA discards any messages from MH s HLC with time stamp less than or equal to timestamp t it received from MH and only sends invalidation messages with timestamp greater than t 11/14/
13 11/14/01 25 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment Scheme comparison All existing schemes are based on synchronous or periodic broadcasting of invalidation reports All existing scheme are based on aggregating queries for a fixed period of time and then answering them after receiving an invalidation report 11/14/
14 Scheme comparison (cont.) All existing schemes assume a stateless server and do not address mobility issues Under existing schemes, the entire cache is invalid if the client is disconnected for a period larger than broadcast period or some multiple of it 11/14/01 27 Scheme comparison (cont.) Poor network utilization under existing schemes (no traffic for a long period of time followed by heavy burst) Higher queuing delay under existing schemes Proposed scheme is asynchronous and stateful 11/14/
15 Scheme comparison (cont.) Performance is enhanced at cost of maintaining additional buffer spaces at MSS 11/14/ /14/01 30 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment 15
16 11/14/01 31 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment Formal Description Data Structure Each data object has an unique identifier Data x denotes data associated with a data item with identifier x 11/14/
17 MH data structure t s : Time stamp of last invalidation report or data received by MH from its home MSS cache: Data cache. Data cache item is of the form (x, Data x, Valid_flag). Data x is considered valid only if Valid_flag is TRUE. 11/14/01 33 MH data structure (cont.) First_Request : A flag set to TRUE when an MH wakes up and is yet to make its first query after awakening. It is set to FALSE once the first request after waking up is made. First_Waiting : A flag set to TRUE when an MH has made its first query after getting reconnected to the network but the data has not been received. 11/14/
18 MSS data structure An array of list HCL[1.N] where HCL[i] is a list of record of type (x,t,invalid_flag) for each data item x cached by Mh i. N is the total number of MHs that are in the MSS cell. T is the time stamp of the last invalidation of x. The invalid_flag is set to TRUE for data items for which an invalidation report has been sent but no implicit acknowledgment has been received. 11/14/01 35 Messages INVALIDATION_REPORT (item_list,t,first_flag): Sent to MH by its home MSS to report invalidation of data in item_list. T is the time stamp associated with this report. first_flag is set to TRUE if this invalidation report is in response to the first query of the MH upon waking up. 11/14/
19 Messages (cont.) DATA_REQUEST(i,x,t,first_request): Sent by MH i to its MSS to request data item x when x is not found in its local cache. t is set to the time stamp t s maintained by the MH. first_request is set to TRUE if this is the first data request after the MH regains connectivity to the network. DATA(x,Data x,t): Broadcast by an MSS to send data to all MHs caching x. T is a time stamp set to the current time at the MSS. 11/14/01 37 MSS tasks If MSS receives a request for data from an MH (DATA_REQUEST): For each request, an MH sends the time stamp of the last message it had received from the MSS. The MSS deletes all entries in the HLC for the MH which had been invalidated before the time stamp carried in the message. If the data request is the first after a sleep, all items cached by MH, marked invalid since the last message received by MH are repeated through an invalidation report. Requested data item is sent to MH and added to its HLC. 11/14/
20 MSS tasks (cont.) Data item(s) updated at MSS (informed by server): The MSS sends an invalidation report to all MHs that are caching the changed data item. It also updates the data time stamp in the HLC for these MHs and marks these items as invalid. 11/14/01 39 MH tasks MH generates a request for a data item: If the MH has woken up after a sleep and if it is a first request, it sends a data request for the item and sets a flag first_waiting to TRUE to indicate that the buffered invalidations during the sleep period have not yet been received. Once the invalidation reports are received, it will answer successive queries from the cache. If the query is not a first after waking up, the cache is checked for that data item. If the item is not in the cache, the data request is sent to the MSS and the query is answered once the data arrive from the MSS. 11/14/
21 MH tasks (cont.) MH receives an invalidation report from the MSS: The MH set its cache time stamp to the time stamp in the current message and invalidates all the data items mentioned in the report in its cache. 11/14/01 41 MH tasks (cont.) MH receives data from the MSS: MH updates its cache with the current information and also updates its cache time stamp. MH wakes up after disconnection: MH set the flag First_Request to TRUE 11/14/
22 Performance Analysis Performance Analysis Goal: estimate miss probability and mean query delay Model constraints: single Mobile Switching Station (MSS) with N mobile hosts 11/14/
23 Assumptions M data items, each of size b a bits No queuing of queries when MH is disconnected Single wireless channel of bandwidth W All messages are queued and serviced FCFS 11/14/01 45 Assumptions (cont.) Queries are of size b q bits; invalidations are of size b i bits Processing overhead is ignored 11/14/
24 MH queries Queries have Poisson distribution with mean rate? Queries are uniformly distributed over all items M in the database P( N( t) = n) = n ( λt) λt n! e 11/14/01 47 MH queries (cont.) Time between updates follows exponential distribution with mean 1/µ Update rate is exponentially distributed with mean µ 11/14/
25 11/14/01 49 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment MH states Mobile hosts alternate between sleep and awake modes s is the fraction of time in sleep mode; 0 <= s <= 1? is frequency at which state changes Consider exponentially distributed interval of time t with mean 1/? 11/14/
26 11/14/01 51 Hit ratio estimation? e = (1 s)? = effective rate of query generation Queries are uniformly distributed over M items in the database? x =? e /M = [(1 s)?/m] 11/14/
27 Hit rate estimation (cont.) Queries for a specific data item x by a MH would be a miss in the local cache (which would require an uplink request) in either of two conditions [Event 1] During time t, item x has been invalidated at least once [Event 2] Data item x has not been invalidated during time t, but MH has slept at least once during t 11/14/ /14/01 54 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment 27
28 t λ xt ( λxe ) µ x µ Mµ P[Event 1] = µ e dx dt = = 0 0 λx + µ (1 s) λ + Mµ Probability of query for x Probability of invalidation in time [0,t] 11/14/01 55 Probability of state change P[Event 2] = t λxt µ t λxt1 ωt1 ω ( t t1 ) ( λ e e ) e ωe ( 1 e ) x 0 0 dt dt 1 Probability of query for x Probability of at least one wakeup in [t-t 1 ] Probability of invalidation in time [t,8 ] Probability that query for x is after t 1 11/14/
29 29 11/14/01 57 ( ) ( ) ( ) = [Event 2] t t t t t t t x dt dt e e e e e P x x ω ω λ µ λ ω λ ( ) = ω λ µ ω ω λ µ λ ω λ µ λ λ ω λ ωλ x x e x e e e x 2 11/14/01 58 P miss and P hit P miss = P[Event 1] + P[Event 2] P hit = 1 - P miss
30 Mean query delay estimation T delay = mean query delay Model up-link queries as M/D/1 queue (assumes dedicated up-link channel of bandwidth C) Model invalidations on down-link channel as M/D/1 queue (assumes dedicated down-link channel of bandwidth C) 11/14/01 59 N MHs in cell Uplink query generation rate Query service rate 11/14/01 60 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment 30
31 Mean invalidation arrival rate Invalidation service rate 11/14/01 61 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment Effective arrival rate of invalidations Query service rate 11/14/01 62 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment 31
32 Mean query delay estimation Combine M/D/1 queues Resultant mean query delay T delay = P miss T q T q ~ 2µ q λq + λi = ~ 2µ q µ q λq + λi Average delay by an uplink query 11/14/01 63 Performance Comparison Simulation experiment Model Single cell with a base station and varying number of mobile hosts High/low invalidation rate Goal Experimental results vs. theoretical analysis Efficiency in managing disconnection Metrics: Uplink,Delay 11/14/
33 Performance Comparison Performance Comparision Low Data Invalidation Rate 11/14/01 66 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment 33
34 Performance Comparison High Data Invalidation Rate AT > TS 11/14/01 67 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment Impact factors Network delay and waiting for broadcast delay TS > AT Network congestion, total query Cache discard Size of invalidation report 11/14/
35 Comparison with Ideal scheme 11/14/01 69 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment Model Validation 11/14/01 70 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment 35
36 Pros of AS scheme Deal with frequent disconnection Minimize overhead Preserve bandwidth Reducing latency 11/14/01 71 State information management State information about local cache maintained at the home MSS Keep consistency with local cache Coda s state info scheme Info stored at server part and MSS part 11/14/
37 Data concurrency Cache discard after disconnection Coda s disconnection handling AS targets applications asking for strict data currency guarantee and where stale data access is undesirable Bank account, traffic information.. 11/14/01 73 Application in mobile IP implementation Mobile IP architecture Home agent Foreign agent Integrated with AS MA s located in MSS HLC maintained in home agent, can be duplicated on foreign agent 11/14/
38 11/14/01 75 A. Kahol, S. Khurana, S. K. S. Gupta, P. K. Srimani, An Efficient Cache Maintenance Scheme for Mobile Environment Summary Bandwidth saving and latency reduction proved through performance analysis and simulation Future work includes study the effect of different mobility pattern, cost of invalidation 11/14/
Service Management in PCN Systems
Lecture 2: Service and Data Management Ing-Ray Chen CS 6204 Mobile Computing Virginia Tech Fall 2005 Courtesy of G.G. Richard III for providing some of the slides for this chapter 1 Service Management
More informationA Strategy to Manage Cache Consistency in a Distributed Mobile Wireless Environment
A Strategy to Manage Cache Consistency in a Distributed Mobile Wireless Environment Anurag Kahol, Sumit Khurana, Sandeep K. S. Gupta, and Pradip K. Srimani Department of Computer Science Colorado State
More informationA Strategy to Manage Cache Consistency in a Disconnected Distributed Environment
686 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 12, NO. 7, JULY 2001 A Strategy to Manage Cache Consistency in a Disconnected Distributed Environment Anurag Kahol, Sumit Khurana, Sandeep
More information4. Data Transmitting Agent based strategy for
120 Chapter 4 4. Data Transmitting Agent based strategy for Effective Cache Consistency 4.1 Architecture of Multicast-Data Dissemination Model Using Data Transmitting Agent The architecture of a mobile
More informationSimulating a General Purpose Mobile Computing Environment
Computer Science Technical Report Simulating a General Purpose Mobile Computing Environment Anurag Kahol, Sumit Khurana, Sandeep Gupta and Pradip Srimani Department of Computer Science Colorado State University
More informationDynamic Cache Consistency Schemes for Wireless Cellular Networks
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 5, NO., FEBRUARY 00 Dynamic Cache Consistency Schemes for Wireless Cellular Networks Zhijun Wang, Mohan Kumar, Sajal K Das, and Huaping Shen Abstract
More informationTHE falling cost of both communication and mobile
IEEE TANSACTIONS ON KNOWLEDGE AND DATA ENGINEEING, VOL. 15, NO. 5, SEPTEMBE/OCTOBE 2003 1251 A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments Guohong Cao, Member, IEEE Abstract
More informationOn Improving the Performance of Cache Invalidation in Mobile Environments
Mobile Networks and Applications 7, 291 303, 2002 2002 Kluwer Academic Publishers. Manufactured in The Netherlands. On Improving the Performance of Cache Invalidation in Mobile Environments GUOHONG CAO
More informationEnergy-Efficient Mobile Cache Invalidation
Distributed and Parallel Databases 6, 351 372 (1998) c 1998 Kluwer Academic Publishers. Manufactured in The Netherlands. Energy-Efficient Mobile Cache Invalidation KUN-LUNG WU, PHILIP S. YU AND MING-SYAN
More informationChapter 13 TRANSPORT. Mobile Computing Winter 2005 / Overview. TCP Overview. TCP slow-start. Motivation Simple analysis Various TCP mechanisms
Overview Chapter 13 TRANSPORT Motivation Simple analysis Various TCP mechanisms Distributed Computing Group Mobile Computing Winter 2005 / 2006 Distributed Computing Group MOBILE COMPUTING R. Wattenhofer
More informationCPET 565/CPET 499 Mobile Computing Systems. Lecture 8. Data Dissemination and Management. 2 of 3
CPET 565/CPET 499 Mobile Computing Systems Lecture 8 and Management 2 of 3 Based on the Text used in the course: Fundamentals of Mobile & Pervasive Computing, 2005, by Frank Adelstein, et. al, from McGraw-Hill
More informationMobile Transport Layer
Mobile Transport Layer 1 Transport Layer HTTP (used by web services) typically uses TCP Reliable transport between TCP client and server required - Stream oriented, not transaction oriented - Network friendly:
More informationOutline 9.2. TCP for 2.5G/3G wireless
Transport layer 9.1 Outline Motivation, TCP-mechanisms Classical approaches (Indirect TCP, Snooping TCP, Mobile TCP) PEPs in general Additional optimizations (Fast retransmit/recovery, Transmission freezing,
More informationDatabases Lesson 03 Data Cache Consistency Maintenance in Mobile and Web Environments
Databases Lesson 03 Data Cache Consistency Maintenance in Mobile and Web Environments Oxford University Press 2007. All rights reserved. 1 Access Latency in mobile environment A device needs a data-record
More informationDDSS: Dynamic Dedicated Servers Scheduling for Multi Priority Level Classes in Cloud Computing
DDSS: Dynamic Dedicated Servers Scheduling for Multi Priority Level Classes in Cloud Computing Husnu Saner Narman Md. Shohrab Hossain Mohammed Atiquzzaman School of Computer Science University of Oklahoma,
More informationCooperative Cache Invalidation Strategies for Internet-based Vehicular Ad Hoc Networks
Cooperative Cache Invalidation Strategies for Internet-based Vehicular Ad Hoc Networks Sunho Lim Chansu Yu Chita R. Das Dept. of EECS, South Dakota State University, Brookings, SD 577, sunho.lim@sdstate.edu
More informationCSE 4215/5431: Mobile Communications Winter Suprakash Datta
CSE 4215/5431: Mobile Communications Winter 2013 Suprakash Datta datta@cse.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.cse.yorku.ca/course/4215 Some slides are adapted
More informationImproving Reliable Transport and Handoff Performance in Cellular Wireless Networks
Improving Reliable Transport and Handoff Performance in Cellular Wireless Networks H. Balakrishnan, S. Seshan, and R. H. Katz ACM Wireless Networks Vol. 1, No. 4, pp. 469-482 Dec. 1995 P. 1 Introduction
More informationCache Management for Concurrent Transaction Execution in Mobile Wireless Environment
Journal of Computer Science 7 (3): 374-378, 2011 ISSN 1549-3636 2011 Science Publications Cache Management for Concurrent Transaction Execution in Mobile Wireless Environment 1 J.C. Miraclin Joyce Pamila
More informationMobile Communications Chapter 9: Mobile Transport Layer
Prof. Dr.-Ing Jochen H. Schiller Inst. of Computer Science Freie Universität Berlin Germany Mobile Communications Chapter 9: Mobile Transport Layer Motivation, TCP-mechanisms Classical approaches (Indirect
More informationCERIAS Tech Report Autonomous Transaction Processing Using Data Dependency in Mobile Environments by I Chung, B Bhargava, M Mahoui, L Lilien
CERIAS Tech Report 2003-56 Autonomous Transaction Processing Using Data Dependency in Mobile Environments by I Chung, B Bhargava, M Mahoui, L Lilien Center for Education and Research Information Assurance
More informationWeb-based Energy-efficient Cache Invalidation in Wireless Mobile Environment
Web-based Energy-efficient Cache Invalidation in Wireless Mobile Environment Y.-K. Chang, M.-H. Hong, and Y.-W. Ting Dept. of Computer Science & Information Engineering, National Cheng Kung University
More informationMobile Communications Chapter 9: Mobile Transport Layer
Prof. Dr.-Ing Jochen H. Schiller Inst. of Computer Science Freie Universität Berlin Germany Mobile Communications Chapter 9: Mobile Transport Layer Motivation, TCP-mechanisms Classical approaches (Indirect
More informationToward a Reliable Data Transport Architecture for Optical Burst-Switched Networks
Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks Dr. Vinod Vokkarane Assistant Professor, Computer and Information Science Co-Director, Advanced Computer Networks Lab University
More informationDesign of Parallel Algorithms. Course Introduction
+ Design of Parallel Algorithms Course Introduction + CSE 4163/6163 Parallel Algorithm Analysis & Design! Course Web Site: http://www.cse.msstate.edu/~luke/courses/fl17/cse4163! Instructor: Ed Luke! Office:
More informationPerformance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s
Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s M. Nagaratna Assistant Professor Dept. of CSE JNTUH, Hyderabad, India V. Kamakshi Prasad Prof & Additional Cont. of. Examinations
More informationAPPCCM: Adaptive Per-User Per-Object Cache Consistency Management for Mobile Client-Server Applications in Wireless Mesh Networks
APPCCM: Adaptive Per-User Per-Object Cache Consistency Management for Mobile Client-Server Applications in Wireless Mesh Networks Yinan Li, Ing-Ray Chen Department of Computer Science Virginia Polytechnic
More informationInnovative Mobile e-healthcare Systems: A New Rule-based Cache Replacement Strategy using Least Profit Values
Innovative Mobile e-healthcare Systems: A New Rule-based Cache Replacement Strategy using Least Profit Values Ramzi A. Haraty 1 Department of Computer Science and Mathematics Lebanese American University
More informationECS-087: Mobile Computing
ECS-087: Mobile Computing TCP over wireless TCP and mobility Most of the Slides borrowed from Prof. Sridhar Iyer s lecture IIT Bombay Diwakar Yagyasen 1 Effect of Mobility on Protocol Stack Application:
More informationOptimized Paging Cache Mappings for efficient location management Hyun Jun Lee, Myoung Chul Jung, and Jai Yong Lee
Optimized Paging Cache Mappings for efficient location management Hyun Jun Lee, Myoung Chul Jung, and Jai Yong Lee Abstract Cellular IP maintains distributed cache for location management and routing purposes.
More informationETSN01 Exam Solutions
ETSN01 Exam Solutions March 014 Question 1 (a) See p17 of the cellular systems slides for a diagram and the full procedure. The main points here were that the HLR needs to be queried to determine the location
More informationDeadline Guaranteed Service for Multi- Tenant Cloud Storage Guoxin Liu and Haiying Shen
Deadline Guaranteed Service for Multi- Tenant Cloud Storage Guoxin Liu and Haiying Shen Presenter: Haiying Shen Associate professor *Department of Electrical and Computer Engineering, Clemson University,
More informationWeek 7: Traffic Models and QoS
Week 7: Traffic Models and QoS Acknowledgement: Some slides are adapted from Computer Networking: A Top Down Approach Featuring the Internet, 2 nd edition, J.F Kurose and K.W. Ross All Rights Reserved,
More informationIntroduction to Real-Time Communications. Real-Time and Embedded Systems (M) Lecture 15
Introduction to Real-Time Communications Real-Time and Embedded Systems (M) Lecture 15 Lecture Outline Modelling real-time communications Traffic and network models Properties of networks Throughput, delay
More informationMultiple Access (1) Required reading: Garcia 6.1, 6.2.1, CSE 3213, Fall 2010 Instructor: N. Vlajic
1 Multiple Access (1) Required reading: Garcia 6.1, 6.2.1, 6.2.2 CSE 3213, Fall 2010 Instructor: N. Vlajic Multiple Access Communications 2 Broadcast Networks aka multiple access networks multiple sending
More informationA New Hashing and Caching Approach for Reducing Call Delivery Cost and Location Server s Load in Wireless Mobile Networks
Proceedings of 2009 12 th International Conference on Computer and Information Technology (ICCIT 2009) 21-23 December, 2009, Dhaka, Bangladesh A New Hashing and Caching Approach for Reducing Call Delivery
More informationPerformance Evaluation of Scheduling Mechanisms for Broadband Networks
Performance Evaluation of Scheduling Mechanisms for Broadband Networks Gayathri Chandrasekaran Master s Thesis Defense The University of Kansas 07.31.2003 Committee: Dr. David W. Petr (Chair) Dr. Joseph
More informationWhat Is Congestion? Effects of Congestion. Interaction of Queues. Chapter 12 Congestion in Data Networks. Effect of Congestion Control
Chapter 12 Congestion in Data Networks Effect of Congestion Control Ideal Performance Practical Performance Congestion Control Mechanisms Backpressure Choke Packet Implicit Congestion Signaling Explicit
More informationUpdate Propagation Algorithms for Supporting Disconnected Write in Mobile Wireless Systems with Data Broadcasting Capability
Wireless Personal Communications (2005) 34: 227 253 DOI: 10.1007/s11277-005-2845-2 C Springer 2005 Update Propagation Algorithms for Supporting Disconnected Write in Mobile Wireless Systems with Data Broadcasting
More informationBasics (cont.) Characteristics of data communication technologies OSI-Model
48 Basics (cont.) Characteristics of data communication technologies OSI-Model Topologies Packet switching / Circuit switching Medium Access Control (MAC) mechanisms Coding Quality of Service (QoS) 49
More informationA Centralized Approaches for Location Management in Personal Communication Services Networks
A Centralized Approaches for Location Management in Personal Communication Services Networks Fahamida Firoze M. Tech. (CSE) Scholar, Deptt. Of CSE, Al Falah School of Engineering & Technology, Dhauj, Faridabad,
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationWorst-case Ethernet Network Latency for Shaped Sources
Worst-case Ethernet Network Latency for Shaped Sources Max Azarov, SMSC 7th October 2005 Contents For 802.3 ResE study group 1 Worst-case latency theorem 1 1.1 Assumptions.............................
More informationRegistration, Broadcast, Cache, Transaction Reversal and Security
Registration, Broadcast, Cache, Transaction Reversal and Security Telecommunications and Networks Group IIT Madras Deepti Kumar deepti@lantana.tenet.res.in TeNeT Group IIT-M 2 nd December Outline Registration
More informationChapter 3 A New Framework for Multicast Mobility in WiFi Networks
Chapter 3 A New Framework for Multicast Mobility in WiFi Networks 3.1 Introduction This chapter presents the designed framework that was produced during this research. The chapter describes about network
More informationCongestion Control in TCP
Congestion Control in TCP Antonio Carzaniga Faculty of Informatics University of Lugano May 6, 2005 Outline Intro to congestion control Input rate vs. output throughput Congestion window Congestion avoidance
More informationQoS-Enabled Video Streaming in Wireless Sensor Networks
QoS-Enabled Video Streaming in Wireless Sensor Networks S. Guo and T.D.C. Little Department of Electrical and Computer Engineering Boston University, Boston, MA 02215 {guosong, tdcl}@bu.edu MCL Technical
More informationAutonomous Transaction Processing Using Data Dependency in Mobile Environments Λ
Autonomous Transaction Processing Using Data Dependency in Mobile Environments Λ IlYoung Chung, 1y Bharat Bhargava, 1 Malika Mahoui, 2 and Leszek Lilien 1 1 Department of Computer Sciences and Center for
More informationDistributed File Systems Part II. Distributed File System Implementation
s Part II Daniel A. Menascé Implementation File Usage Patterns File System Structure Caching Replication Example: NFS 1 Implementation: File Usage Patterns Static Measurements: - distribution of file size,
More informationImpact of transmission errors on TCP performance. Outline. Random Errors
Impact of transmission errors on TCP performance 1 Outline Impact of transmission errors on TCP performance Approaches to improve TCP performance Classification Discussion of selected approaches 2 Random
More information10. Replication. CSEP 545 Transaction Processing Philip A. Bernstein. Copyright 2003 Philip A. Bernstein. Outline
10. Replication CSEP 545 Transaction Processing Philip A. Bernstein Copyright 2003 Philip A. Bernstein 1 Outline 1. Introduction 2. Primary-Copy Replication 3. Multi-Master Replication 4. Other Approaches
More informationCS321: Computer Networks Congestion Control in TCP
CS321: Computer Networks Congestion Control in TCP Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Jodhpur E-mail: manaskhatua@iitj.ac.in Causes and Cost of Congestion Scenario-1: Two Senders, a
More informationDesign and Development of Carrier Assignment and Packet Scheduling in LTE-A and Wi-Fi
PhD Defense Design and Development of Carrier Assignment and Packet Scheduling in LTE-A and Wi-Fi Husnu S. Narman Outline Introduction Objective Multi-band in LTE-A Multi-band in Wi-Fi Conclusion Husnu
More informationWireless Networks (CSC-7602) Lecture 8 (15 Oct. 2007)
Wireless Networks (CSC-7602) Lecture 8 (15 Oct. 2007) Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark 1 Today Wireline Fair Schedulling Why? Ideal algorithm Practical algorithms Wireless Fair Scheduling
More informationWireless Networked Systems
Wireless Networked Systems CS 795/895 - Spring 2013 Lec #6: Medium Access Control QoS and Service Differentiation, and Power Management Tamer Nadeem Dept. of Computer Science Quality of Service (802.11e)
More informationDesigning Next-Generation Data- Centers with Advanced Communication Protocols and Systems Services. Presented by: Jitong Chen
Designing Next-Generation Data- Centers with Advanced Communication Protocols and Systems Services Presented by: Jitong Chen Outline Architecture of Web-based Data Center Three-Stage framework to benefit
More informationChapter 7 CONCLUSION
97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in
More informationEfficient Cache Consistency in Server-Based MANET with Cache Replication
Efficient Cache Consistency in Server-Based MANET with Cache Replication J. Bibiana Jenifer 1, M. Manikandan 2 Student, Computer Science and Engineering, Adhiyamaan College of Engineering, Hosur, India
More informationSELECTION OF METRICS (CONT) Gaia Maselli
SELECTION OF METRICS (CONT) Gaia Maselli maselli@di.uniroma1.it Computer Network Performance 2 Selecting performance metrics Computer Network Performance 3 Selecting performance metrics speed Individual
More informationUsing Low-power Modes for Energy Conservation in Ethernet LANs
Using Low-power Modes for Energy Conservation in Ethernet LANs Maruti Gupta Department of Computer Science Portland State University Portland, OR 9727 Email: mgupta@cs.pdx.edu Suresh Singh Department of
More information1. Memory technology & Hierarchy
1. Memory technology & Hierarchy Back to caching... Advances in Computer Architecture Andy D. Pimentel Caches in a multi-processor context Dealing with concurrent updates Multiprocessor architecture In
More informationMobile Routing : Computer Networking. Overview. How to Handle Mobile Nodes? Mobile IP Ad-hoc network routing Assigned reading
Mobile Routing 15-744: Computer Networking L-10 Ad Hoc Networks Mobile IP Ad-hoc network routing Assigned reading Performance Comparison of Multi-Hop Wireless Ad Hoc Routing Protocols A High Throughput
More informationEnd-To-End Delay Optimization in Wireless Sensor Network (WSN)
Shweta K. Kanhere 1, Mahesh Goudar 2, Vijay M. Wadhai 3 1,2 Dept. of Electronics Engineering Maharashtra Academy of Engineering, Alandi (D), Pune, India 3 MITCOE Pune, India E-mail: shweta.kanhere@gmail.com,
More informationSleep/Wake Aware Local Monitoring (SLAM)
Sleep/Wake Aware Local Monitoring (SLAM) Issa Khalil, Saurabh Bagchi, Ness Shroff Dependable Computing Systems Lab (DCSL) & Center for Wireless Systems and Applications (CWSA) School of Electrical and
More informationCHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS
28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the
More informationA Generalized Target-Driven Cache Replacement Policy for Mobile Environments
A Generalized Target-Driven Cache Replacement Policy for Mobile Environments Liangzhong Yin, Guohong Cao Department of Computer Science & Engineering The Pennsylvania State University University Park,
More informationCongestion Control in Communication Networks
Congestion Control in Communication Networks Introduction Congestion occurs when number of packets transmitted approaches network capacity Objective of congestion control: keep number of packets below
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Broch et al Presented by Brian Card 1 Outline Introduction NS enhancements Protocols: DSDV TORA DRS AODV Evaluation Conclusions
More informationCongestion Control in TCP
Congestion Control in TCP Antonio Carzaniga Faculty of Informatics University of Lugano November 11, 2014 Outline Intro to congestion control Input rate vs. output throughput Congestion window Congestion
More informationCongestion. Can t sustain input rate > output rate Issues: - Avoid congestion - Control congestion - Prioritize who gets limited resources
Congestion Source 1 Source 2 10-Mbps Ethernet 100-Mbps FDDI Router 1.5-Mbps T1 link Destination Can t sustain input rate > output rate Issues: - Avoid congestion - Control congestion - Prioritize who gets
More informationWireless TCP. TCP mechanism. Wireless Internet: TCP in Wireless. Wireless TCP: transport layer
Wireless TCP W.int.2-2 Wireless Internet: TCP in Wireless Module W.int.2 Mobile IP: layer, module W.int.1 Wireless TCP: layer Dr.M.Y.Wu@CSE Shanghai Jiaotong University Shanghai, China Dr.W.Shu@ECE University
More informationCh 1. Mobile Adaptive Computing
Ch 1. Mobile Adaptive Computing What is Mobile Computing Mobile computing? Distributed system Wireless communications Mobility of communications devices Difference between mobile computing and mobile communications?
More informationResource allocation in networks. Resource Allocation in Networks. Resource allocation
Resource allocation in networks Resource Allocation in Networks Very much like a resource allocation problem in operating systems How is it different? Resources and jobs are different Resources are buffers
More informationLecture 16: Router Design
Lecture 16: Router Design CSE 123: Computer Networks Alex C. Snoeren Eample courtesy Mike Freedman Lecture 16 Overview End-to-end lookup and forwarding example Router internals Buffering Scheduling 2 Example:
More informationQueuing Networks Modeling Virtual Laboratory
Queuing Networks Modeling Virtual Laboratory Dr. S. Dharmaraja Department of Mathematics IIT Delhi http://web.iitd.ac.in/~dharmar Queues Notes 1 1 Outline Introduction Simple Queues Performance Measures
More informationCS 556 Advanced Computer Networks Spring Solutions to Midterm Test March 10, YOUR NAME: Abraham MATTA
CS 556 Advanced Computer Networks Spring 2011 Solutions to Midterm Test March 10, 2011 YOUR NAME: Abraham MATTA This test is closed books. You are only allowed to have one sheet of notes (8.5 11 ). Please
More informationCongestion Control for High Bandwidth-delay Product Networks. Dina Katabi, Mark Handley, Charlie Rohrs
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Outline Introduction What s wrong with TCP? Idea of Efficiency vs. Fairness XCP, what is it? Is it
More informationLecture 2: Snooping and Directory Protocols. Topics: Snooping wrap-up and directory implementations
Lecture 2: Snooping and Directory Protocols Topics: Snooping wrap-up and directory implementations 1 Split Transaction Bus So far, we have assumed that a coherence operation (request, snoops, responses,
More informationMobile Transport Layer
Mobile Transport Layer 1 Transport Layer E.g. HTTP (used by web services) typically uses TCP Reliable transport between client and server required TCP Stream oriented Network friendly: time-out congestion
More informationWireless TCP Performance Issues
Wireless TCP Performance Issues Issues, transport layer protocols Set up and maintain end-to-end connections Reliable end-to-end delivery of data Flow control Congestion control Udp? Assume TCP for the
More informationMarkov Chains and Multiaccess Protocols: An. Introduction
Markov Chains and Multiaccess Protocols: An Introduction Laila Daniel and Krishnan Narayanan April 8, 2012 Outline of the talk Introduction to Markov Chain applications in Communication and Computer Science
More informationCongestion Control 3/16/09
Congestion Control Outline Resource Allocation Queuing TCP Congestion Control Spring 009 CSE3064 Issues Two sides of the same coin pre-allocate resources so at to avoid congestion control congestion if
More informationArchitecture or Parallel Computers CSC / ECE 506
Architecture or Parallel Computers CSC / ECE 506 Summer 2006 Scalable Programming Models 6/19/2006 Dr Steve Hunter Back to Basics Parallel Architecture = Computer Architecture + Communication Architecture
More informationMultiple Access Communications. EEE 538, WEEK 11 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department
Multiple Access Communications EEE 538, WEEK 11 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department 1 Multiple Access Satellite systems, radio networks (WLAN), ethernet segment
More informationOptimal Routing and Scheduling in Multihop Wireless Renewable Energy Networks
Optimal Routing and Scheduling in Multihop Wireless Renewable Energy Networks ITA 11, San Diego CA, February 2011 MHR. Khouzani, Saswati Sarkar, Koushik Kar UPenn, UPenn, RPI March 23, 2011 Khouzani, Sarkar,
More informationCongestion Control in TCP
Congestion Control in CP Antonio Carzaniga Faculty of Informatics University of Lugano Apr 7, 2008 2005 2007 Antonio Carzaniga 1 Intro to congestion control Outline Input rate vs. output throughput Congestion
More informationMultiJav: A Distributed Shared Memory System Based on Multiple Java Virtual Machines. MultiJav: Introduction
: A Distributed Shared Memory System Based on Multiple Java Virtual Machines X. Chen and V.H. Allan Computer Science Department, Utah State University 1998 : Introduction Built on concurrency supported
More informationImportant Lessons. Today's Lecture. Two Views of Distributed Systems
Important Lessons Replication good for performance/ reliability Key challenge keeping replicas up-to-date Wide range of consistency models Will see more next lecture Range of correctness properties L-10
More informationLecture 23: Storage Systems. Topics: disk access, bus design, evaluation metrics, RAID (Sections )
Lecture 23: Storage Systems Topics: disk access, bus design, evaluation metrics, RAID (Sections 7.1-7.9) 1 Role of I/O Activities external to the CPU are typically orders of magnitude slower Example: while
More informationA MOBILE COMMIT PROTOCOL BASED ON TIMEOUTS. Lavanya Sita Tekumalla, BE (CSE) Osmania University College of Engineering. Hyderabad , India.
A MOBILE COMMIT PROTOCOL BASED ON TIMEOUTS Lavanya Sita Tekumalla, BE (CSE) Osmania University College of Engineering Hyderabad 500007, India. ABSTRACT In a mobile environment, the two phase commit protocol
More informationAODV-PA: AODV with Path Accumulation
-PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications
More informationCHAPTER 4 SINGLE LAYER BLACK HOLE ATTACK DETECTION
58 CHAPTER 4 SINGLE LAYER BLACK HOLE ATTACK DETECTION 4.1 INTRODUCTION TO SLBHAD The focus of this chapter is to detect and isolate Black Hole attack in the MANET (Khattak et al 2013). In order to do that,
More informationMaster Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master
More informationScaling Optimistic Concurrency Control by Approximately Partitioning the Certifier and Log
Scaling Optimistic Concurrency Control by Approximately Partitioning the Certifier and Log Philip A. Bernstein Microsoft Research Redmond, WA, USA phil.bernstein@microsoft.com Sudipto Das Microsoft Research
More informationADVANCED COMPUTER NETWORKS
ADVANCED COMPUTER NETWORKS Congestion Control and Avoidance 1 Lecture-6 Instructor : Mazhar Hussain CONGESTION CONTROL When one part of the subnet (e.g. one or more routers in an area) becomes overloaded,
More informationThis formula shows that partitioning the network decreases the total traffic if 1 N R (1 + p) < N R p < 1, i.e., if not all the packets have to go
Chapter 3 Problem 2 In Figure 3.43 of the text every node transmits R bps, and we assume that both network partitions consist of 1 N nodes. So the total traffic generated by the nodes 2 of each Ethernet
More informationQuality of Service. Traffic Descriptor Traffic Profiles. Figure 24.1 Traffic descriptors. Figure Three traffic profiles
24-1 DATA TRAFFIC Chapter 24 Congestion Control and Quality of Service The main focus of control and quality of service is data traffic. In control we try to avoid traffic. In quality of service, we try
More informationComputation of Multiple Node Disjoint Paths
Chapter 5 Computation of Multiple Node Disjoint Paths 5.1 Introduction In recent years, on demand routing protocols have attained more attention in mobile Ad Hoc networks as compared to other routing schemes
More informationOverview Computer Networking What is QoS? Queuing discipline and scheduling. Traffic Enforcement. Integrated services
Overview 15-441 15-441 Computer Networking 15-641 Lecture 19 Queue Management and Quality of Service Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15-441-f16 What is QoS? Queuing discipline and scheduling
More informationMaster Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Chair for
More information