Communications Asymmetry, Classification of Data Delivery Mechanisms, Data Dissemination, Broadcast Models, Selective Tuning and Indexing Methods, Data Synchronization – Introduction, Software, and Protocols
RPC allows a program to call a subroutine that resides on a remote machine. When a call is made, the calling process is suspended and execution takes place on the remote machine. The results are then returned. This makes the remote call appear local to the programmer. RPC uses message passing to transmit information between machines and allows communication between processes on different machines or the same machine. It provides a simple interface like local procedure calls but involves more overhead due to network communication.
This document discusses interprocess communication (IPC) and message passing in distributed systems. It covers key topics such as:
- The two main approaches to IPC - shared memory and message passing
- Desirable features of message passing systems like simplicity, uniform semantics, efficiency, reliability, correctness, flexibility, security, and portability
- Issues in message passing IPC like message format, synchronization methods (blocking vs. non-blocking), and buffering strategies
The document discusses different methods for disseminating data to mobile devices, including push-based, pull-based, and hybrid methods. Push-based methods involve broadcasting data from servers to devices, pull-based methods allow devices to request data from servers, and hybrid methods use a combination of both. The document also covers techniques for mobile devices to selectively tune into and cache relevant data, such as using indexes that map the locations of data buckets.
2. Distributed Systems Hardware & Software conceptsPrajakta Rane
This document discusses distributed system software and middleware. It describes three types of operating systems used in distributed systems - distributed operating systems, network operating systems, and middleware operating systems. Middleware operating systems provide a common set of services for local applications and independent services for remote applications. Common middleware models include remote procedure call, remote method invocation, CORBA, and message-oriented middleware. Middleware offers services like naming, persistence, messaging, querying, concurrency control, and security.
The document discusses various design issues related to interprocess communication using message passing. It covers topics like synchronization methods, buffering strategies, process addressing schemes, reliability in message passing, and group communication. The key synchronization methods are blocking and non-blocking sends/receives. Issues addressed include blocking forever if the receiving process crashes, buffering strategies like null, single-message and finite buffers, and naming schemes like explicit and implicit addressing. Reliability is achieved using protocols like four-message, three-message and two-message. Group communication supports one-to-many, many-to-one and many-to-many communication with primitives for multicast, membership and different ordering semantics.
Fault tolerance is important for distributed systems to continue functioning in the event of partial failures. There are several phases to achieving fault tolerance: fault detection, diagnosis, evidence generation, assessment, and recovery. Common techniques include replication, where multiple copies of data are stored at different sites to increase availability if one site fails, and check pointing, where a system's state is periodically saved to stable storage so the system can be restored to a previous consistent state if a failure occurs. Both techniques have limitations around managing consistency with replication and overhead from checkpointing communications and storage requirements.
Localization uses a user's cellular or web connection to identify and track their location. The GSM network uses home and visitor location registers to store information about a user's location. This allows a user's location to be identified worldwide using their phone number. Handover is the process of switching a user's radio connection between base stations to maintain connectivity as the user moves.
Mac protocols for ad hoc wireless networks Divya Tiwari
The document discusses MAC protocols for ad hoc wireless networks. It addresses key issues in designing MAC protocols including limited bandwidth, quality of service support, synchronization, hidden and exposed terminal problems, error-prone shared channels, distributed coordination without centralized control, and node mobility. Common MAC protocol classifications and examples are also presented, such as contention-based protocols, sender-initiated versus receiver-initiated protocols, and protocols using techniques like reservation, scheduling, and directional antennas.
RPC allows a program to call a subroutine that resides on a remote machine. When a call is made, the calling process is suspended and execution takes place on the remote machine. The results are then returned. This makes the remote call appear local to the programmer. RPC uses message passing to transmit information between machines and allows communication between processes on different machines or the same machine. It provides a simple interface like local procedure calls but involves more overhead due to network communication.
This document discusses interprocess communication (IPC) and message passing in distributed systems. It covers key topics such as:
- The two main approaches to IPC - shared memory and message passing
- Desirable features of message passing systems like simplicity, uniform semantics, efficiency, reliability, correctness, flexibility, security, and portability
- Issues in message passing IPC like message format, synchronization methods (blocking vs. non-blocking), and buffering strategies
The document discusses different methods for disseminating data to mobile devices, including push-based, pull-based, and hybrid methods. Push-based methods involve broadcasting data from servers to devices, pull-based methods allow devices to request data from servers, and hybrid methods use a combination of both. The document also covers techniques for mobile devices to selectively tune into and cache relevant data, such as using indexes that map the locations of data buckets.
2. Distributed Systems Hardware & Software conceptsPrajakta Rane
This document discusses distributed system software and middleware. It describes three types of operating systems used in distributed systems - distributed operating systems, network operating systems, and middleware operating systems. Middleware operating systems provide a common set of services for local applications and independent services for remote applications. Common middleware models include remote procedure call, remote method invocation, CORBA, and message-oriented middleware. Middleware offers services like naming, persistence, messaging, querying, concurrency control, and security.
The document discusses various design issues related to interprocess communication using message passing. It covers topics like synchronization methods, buffering strategies, process addressing schemes, reliability in message passing, and group communication. The key synchronization methods are blocking and non-blocking sends/receives. Issues addressed include blocking forever if the receiving process crashes, buffering strategies like null, single-message and finite buffers, and naming schemes like explicit and implicit addressing. Reliability is achieved using protocols like four-message, three-message and two-message. Group communication supports one-to-many, many-to-one and many-to-many communication with primitives for multicast, membership and different ordering semantics.
Fault tolerance is important for distributed systems to continue functioning in the event of partial failures. There are several phases to achieving fault tolerance: fault detection, diagnosis, evidence generation, assessment, and recovery. Common techniques include replication, where multiple copies of data are stored at different sites to increase availability if one site fails, and check pointing, where a system's state is periodically saved to stable storage so the system can be restored to a previous consistent state if a failure occurs. Both techniques have limitations around managing consistency with replication and overhead from checkpointing communications and storage requirements.
Localization uses a user's cellular or web connection to identify and track their location. The GSM network uses home and visitor location registers to store information about a user's location. This allows a user's location to be identified worldwide using their phone number. Handover is the process of switching a user's radio connection between base stations to maintain connectivity as the user moves.
Mac protocols for ad hoc wireless networks Divya Tiwari
The document discusses MAC protocols for ad hoc wireless networks. It addresses key issues in designing MAC protocols including limited bandwidth, quality of service support, synchronization, hidden and exposed terminal problems, error-prone shared channels, distributed coordination without centralized control, and node mobility. Common MAC protocol classifications and examples are also presented, such as contention-based protocols, sender-initiated versus receiver-initiated protocols, and protocols using techniques like reservation, scheduling, and directional antennas.
This document discusses different distributed computing system (DCS) models:
1. The minicomputer model consists of a few minicomputers with remote access allowing resource sharing.
2. The workstation model consists of independent workstations scattered throughout a building where users log onto their home workstation.
3. The workstation-server model includes minicomputers, diskless and diskful workstations, and centralized services like databases and printing.
It provides an overview of the key characteristics and advantages of different DCS models.
The document discusses database issues related to mobile computing. It describes how mobile devices cache data from servers to reduce latency when the device is offline. The cached data is referred to as being "hoarded" in the device database. It discusses different database architectures including one-tier architectures where the database is specific to a mobile device and two-tier architectures involving client-server models. It also describes different cache invalidation mechanisms used to maintain consistency between cached data on devices and data on servers.
Parallel and distributed computing allows problems to be broken into discrete parts that can be solved simultaneously. This approach utilizes multiple processors that work concurrently on different parts of the problem. There are several types of parallel architectures depending on how instructions and data are distributed across processors. Shared memory systems give all processors access to a common memory space while distributed memory assigns private memory to each processor requiring explicit data transfer. Large-scale systems may combine these approaches into hybrid designs. Distributed systems extend parallelism across a network and provide users with a single, integrated view of geographically dispersed resources and computers. Key challenges for distributed systems include transparency, scalability, fault tolerance and concurrency.
The document discusses mobile commerce (m-commerce), which is defined as buying and selling goods and services through wireless handheld devices like mobile phones. It provides an overview of the history and evolution of m-commerce since 1997. It then describes key applications and services of m-commerce like mobile ticketing, money transfers, content purchases, banking, coupons, and different payment methods. The document concludes that m-commerce refers to any monetary transaction conducted via a mobile network using a mobile device.
The network layer provides two main services: connectionless and connection-oriented. Connectionless service routes packets independently through routers using destination addresses and routing tables. Connection-oriented service establishes a virtual circuit between source and destination, routing all related traffic along the pre-determined path. The document also discusses store-and-forward packet switching, where packets are stored until fully received before being forwarded, and services provided to the transport layer like uniform addressing.
Agreement Protocols, Distributed Resource Management: Issues in distributed File Systems, Mechanism for building distributed file systems, Design issues in Distributed Shared Memory, Algorithm for Implementation of Distributed Shared Memory.
Trends in distributed systems include the emergence of pervasive technology, ubiquitous and mobile computing, increasing demand for multimedia, and viewing distributed systems as a utility. These trends have led to modern networks consisting of interconnected wired and wireless devices that can connect from any location. Mobile and ubiquitous computing allow small portable devices to connect to distributed systems from different places. Distributed multimedia systems enable accessing content like live broadcasts from desktops and mobile devices. Distributed systems are also seen as a utility with physical and logical resources rented rather than owned, such as with cloud computing which provides internet-based applications and services on demand.
Distributed shared memory (DSM) is a memory architecture where physically separate memories can be addressed as a single logical address space. In a DSM system, data moves between nodes' main and secondary memories when a process accesses shared data. Each node has a memory mapping manager that maps the shared virtual memory to local physical memory. DSM provides advantages like shielding programmers from message passing, lower cost than multiprocessors, and large virtual address spaces, but disadvantages include potential performance penalties from remote data access and lack of programmer control over messaging.
Clock synchronization in distributed systemSunita Sahu
This document discusses several techniques for clock synchronization in distributed systems:
1. Time stamping events and messages with logical clocks to determine partial ordering without a global clock. Logical clocks assign monotonically increasing sequence numbers.
2. Clock synchronization algorithms like NTP that regularly adjust system clocks across the network to synchronize with a time server. NTP uses averaging to account for network delays.
3. Lamport's logical clocks algorithm that defines "happened before" relations and increments clocks between events to synchronize logical clocks across processes.
Mobile Transport Layer protocols aim to address challenges with TCP over mobile networks. Traditional TCP uses congestion control like slow start and fast retransmit/recovery that can reduce performance over mobile. Indirect TCP splits the connection at the access point to avoid wireless errors affecting the wired segment. Snooping TCP buffers packets at the access point and performs local retransmissions on errors. Mobile TCP splits the connection and uses an optimized TCP between the supervisory host and mobile host, choking the sender when the mobile is disconnected to avoid buffering large amounts of undelivered data.
The document discusses cloud computing models including infrastructure as a service (IaaS), platform as a service (PaaS), and software as a service (SaaS). IaaS provides basic computing resources, storage, and networking capabilities. PaaS provides development tools and environments for building applications. SaaS provides users access to applications via the internet without installation or maintenance of software.
The document discusses combiners and partitioners in MapReduce frameworks. It explains that combiners allow for local aggregation of map output key-value pairs before shuffling to reducers. This can significantly reduce the amount of data transferred between maps and reduces. For a combiner to be effective, the reduce operation must be commutative and associative so the local aggregations can be merged. The document provides examples of operations like sum() and max() that qualify for use as combiners. It also discusses factors like serialization overhead that should be considered when deciding whether a combiner will provide benefits for a given job.
File Replication : High availability is a desirable feature of a good distributed file system and file replication is the primary mechanism for improving file availability. Replication is a key strategy for improving reliability, fault tolerance and availability. Therefore duplicating files on multiple machines improves availability and performance.
Replicated file : A replicated file is a file that has multiple copies, with each copy located on a separate file server. Each copy of the set of copies that comprises a replicated file is referred to as replica of the replicated file.
Replication is often confused with caching, probably because they both deal with multiple copies of data. The two concepts has the following basic differences:
A replica is associated with server, whereas a cached copy is associated with a client.
The existence of cached copy is primarily dependent on the locality in file access patterns, whereas the existence of a replica normally depends on availability and performance requirements.
Satynarayanana [1992] distinguishes a replicated copy from a cached copy by calling the first-class replicas and second-class replicas respectively
Inter-Process Communication in distributed systemsAya Mahmoud
Inter-Process Communication is at the heart of all distributed systems, so we need to know the ways that processes can exchange information.
Communication in distributed systems is based on Low-level message passing as offered by the underlying network.
Replication in computing involves sharing information so as to ensure consistency between redundant resources, such as software or hardware components, to improve reliability, fault-tolerance, or accessibility.
Unit 4 -2 energy management in adhoc wireless networkdevika g
Unit 4 -2 energy management in adhoc wireless network unit 4-2 mobile computing ,classification of energy management transimmission power power management
Mobile IP is a protocol that allows mobile devices like phones and laptops to change location between networks while maintaining the same IP address. When a mobile node changes to a foreign network, its home agent intercepts any data packets and tunnels them to the mobile node's care-of address at its new location. The foreign agent then decapsulates the tunneled packets and delivers them locally to the mobile node. This allows the mobile node to seamlessly change networks without disrupting communications.
Sockets provide logical connections between endpoints for two-way communication over a network. A socket is used by both the client and server to establish a connection, with the server socket waiting for client connection requests and the client socket initiating requests to send and receive data from the server. Sockets use IP addresses to connect devices running IPv4 or IPv6 and transmit data between endpoints.
This Presentation provides a detailed insight about Collaborating Using Cloud Services Email Communication over the Cloud - CRM Management – Project Management-Event
Management - Task Management – Calendar - Schedules - Word Processing –
Presentation – Spreadsheet - Databases – Desktop - Social Networks and Groupware.
The document discusses data dissemination and synchronization in mobile computing. It covers key topics such as communications asymmetry, classification of data delivery mechanisms, and data synchronization.
Specifically, it describes how mobile communication is intrinsically asymmetric with downstream bandwidth from servers to devices being much larger than upstream bandwidth. It also classifies data delivery mechanisms into push-based (publish-subscribe), pull-based (on-demand), and hybrid models. Push-based mechanisms involve the server pushing data to devices by broadcasting, pull-based involves devices pulling data on demand, and hybrid combines both approaches.
1) The document discusses different mechanisms for data dissemination to mobile devices, including push-based (data is broadcast without requests), pull-based (data is sent on demand in response to requests), and hybrid approaches.
2) A key challenge is asymmetric communication bandwidth, with much higher bandwidth available for sending data to devices than for receiving data from them.
3) Push-based broadcasting allows data to be sent efficiently to multiple devices simultaneously but may disseminate unwanted information, while pull-based on-demand delivery only sends requested data but can overburden servers with many requests.
This document discusses different distributed computing system (DCS) models:
1. The minicomputer model consists of a few minicomputers with remote access allowing resource sharing.
2. The workstation model consists of independent workstations scattered throughout a building where users log onto their home workstation.
3. The workstation-server model includes minicomputers, diskless and diskful workstations, and centralized services like databases and printing.
It provides an overview of the key characteristics and advantages of different DCS models.
The document discusses database issues related to mobile computing. It describes how mobile devices cache data from servers to reduce latency when the device is offline. The cached data is referred to as being "hoarded" in the device database. It discusses different database architectures including one-tier architectures where the database is specific to a mobile device and two-tier architectures involving client-server models. It also describes different cache invalidation mechanisms used to maintain consistency between cached data on devices and data on servers.
Parallel and distributed computing allows problems to be broken into discrete parts that can be solved simultaneously. This approach utilizes multiple processors that work concurrently on different parts of the problem. There are several types of parallel architectures depending on how instructions and data are distributed across processors. Shared memory systems give all processors access to a common memory space while distributed memory assigns private memory to each processor requiring explicit data transfer. Large-scale systems may combine these approaches into hybrid designs. Distributed systems extend parallelism across a network and provide users with a single, integrated view of geographically dispersed resources and computers. Key challenges for distributed systems include transparency, scalability, fault tolerance and concurrency.
The document discusses mobile commerce (m-commerce), which is defined as buying and selling goods and services through wireless handheld devices like mobile phones. It provides an overview of the history and evolution of m-commerce since 1997. It then describes key applications and services of m-commerce like mobile ticketing, money transfers, content purchases, banking, coupons, and different payment methods. The document concludes that m-commerce refers to any monetary transaction conducted via a mobile network using a mobile device.
The network layer provides two main services: connectionless and connection-oriented. Connectionless service routes packets independently through routers using destination addresses and routing tables. Connection-oriented service establishes a virtual circuit between source and destination, routing all related traffic along the pre-determined path. The document also discusses store-and-forward packet switching, where packets are stored until fully received before being forwarded, and services provided to the transport layer like uniform addressing.
Agreement Protocols, Distributed Resource Management: Issues in distributed File Systems, Mechanism for building distributed file systems, Design issues in Distributed Shared Memory, Algorithm for Implementation of Distributed Shared Memory.
Trends in distributed systems include the emergence of pervasive technology, ubiquitous and mobile computing, increasing demand for multimedia, and viewing distributed systems as a utility. These trends have led to modern networks consisting of interconnected wired and wireless devices that can connect from any location. Mobile and ubiquitous computing allow small portable devices to connect to distributed systems from different places. Distributed multimedia systems enable accessing content like live broadcasts from desktops and mobile devices. Distributed systems are also seen as a utility with physical and logical resources rented rather than owned, such as with cloud computing which provides internet-based applications and services on demand.
Distributed shared memory (DSM) is a memory architecture where physically separate memories can be addressed as a single logical address space. In a DSM system, data moves between nodes' main and secondary memories when a process accesses shared data. Each node has a memory mapping manager that maps the shared virtual memory to local physical memory. DSM provides advantages like shielding programmers from message passing, lower cost than multiprocessors, and large virtual address spaces, but disadvantages include potential performance penalties from remote data access and lack of programmer control over messaging.
Clock synchronization in distributed systemSunita Sahu
This document discusses several techniques for clock synchronization in distributed systems:
1. Time stamping events and messages with logical clocks to determine partial ordering without a global clock. Logical clocks assign monotonically increasing sequence numbers.
2. Clock synchronization algorithms like NTP that regularly adjust system clocks across the network to synchronize with a time server. NTP uses averaging to account for network delays.
3. Lamport's logical clocks algorithm that defines "happened before" relations and increments clocks between events to synchronize logical clocks across processes.
Mobile Transport Layer protocols aim to address challenges with TCP over mobile networks. Traditional TCP uses congestion control like slow start and fast retransmit/recovery that can reduce performance over mobile. Indirect TCP splits the connection at the access point to avoid wireless errors affecting the wired segment. Snooping TCP buffers packets at the access point and performs local retransmissions on errors. Mobile TCP splits the connection and uses an optimized TCP between the supervisory host and mobile host, choking the sender when the mobile is disconnected to avoid buffering large amounts of undelivered data.
The document discusses cloud computing models including infrastructure as a service (IaaS), platform as a service (PaaS), and software as a service (SaaS). IaaS provides basic computing resources, storage, and networking capabilities. PaaS provides development tools and environments for building applications. SaaS provides users access to applications via the internet without installation or maintenance of software.
The document discusses combiners and partitioners in MapReduce frameworks. It explains that combiners allow for local aggregation of map output key-value pairs before shuffling to reducers. This can significantly reduce the amount of data transferred between maps and reduces. For a combiner to be effective, the reduce operation must be commutative and associative so the local aggregations can be merged. The document provides examples of operations like sum() and max() that qualify for use as combiners. It also discusses factors like serialization overhead that should be considered when deciding whether a combiner will provide benefits for a given job.
File Replication : High availability is a desirable feature of a good distributed file system and file replication is the primary mechanism for improving file availability. Replication is a key strategy for improving reliability, fault tolerance and availability. Therefore duplicating files on multiple machines improves availability and performance.
Replicated file : A replicated file is a file that has multiple copies, with each copy located on a separate file server. Each copy of the set of copies that comprises a replicated file is referred to as replica of the replicated file.
Replication is often confused with caching, probably because they both deal with multiple copies of data. The two concepts has the following basic differences:
A replica is associated with server, whereas a cached copy is associated with a client.
The existence of cached copy is primarily dependent on the locality in file access patterns, whereas the existence of a replica normally depends on availability and performance requirements.
Satynarayanana [1992] distinguishes a replicated copy from a cached copy by calling the first-class replicas and second-class replicas respectively
Inter-Process Communication in distributed systemsAya Mahmoud
Inter-Process Communication is at the heart of all distributed systems, so we need to know the ways that processes can exchange information.
Communication in distributed systems is based on Low-level message passing as offered by the underlying network.
Replication in computing involves sharing information so as to ensure consistency between redundant resources, such as software or hardware components, to improve reliability, fault-tolerance, or accessibility.
Unit 4 -2 energy management in adhoc wireless networkdevika g
Unit 4 -2 energy management in adhoc wireless network unit 4-2 mobile computing ,classification of energy management transimmission power power management
Mobile IP is a protocol that allows mobile devices like phones and laptops to change location between networks while maintaining the same IP address. When a mobile node changes to a foreign network, its home agent intercepts any data packets and tunnels them to the mobile node's care-of address at its new location. The foreign agent then decapsulates the tunneled packets and delivers them locally to the mobile node. This allows the mobile node to seamlessly change networks without disrupting communications.
Sockets provide logical connections between endpoints for two-way communication over a network. A socket is used by both the client and server to establish a connection, with the server socket waiting for client connection requests and the client socket initiating requests to send and receive data from the server. Sockets use IP addresses to connect devices running IPv4 or IPv6 and transmit data between endpoints.
This Presentation provides a detailed insight about Collaborating Using Cloud Services Email Communication over the Cloud - CRM Management – Project Management-Event
Management - Task Management – Calendar - Schedules - Word Processing –
Presentation – Spreadsheet - Databases – Desktop - Social Networks and Groupware.
The document discusses data dissemination and synchronization in mobile computing. It covers key topics such as communications asymmetry, classification of data delivery mechanisms, and data synchronization.
Specifically, it describes how mobile communication is intrinsically asymmetric with downstream bandwidth from servers to devices being much larger than upstream bandwidth. It also classifies data delivery mechanisms into push-based (publish-subscribe), pull-based (on-demand), and hybrid models. Push-based mechanisms involve the server pushing data to devices by broadcasting, pull-based involves devices pulling data on demand, and hybrid combines both approaches.
1) The document discusses different mechanisms for data dissemination to mobile devices, including push-based (data is broadcast without requests), pull-based (data is sent on demand in response to requests), and hybrid approaches.
2) A key challenge is asymmetric communication bandwidth, with much higher bandwidth available for sending data to devices than for receiving data from them.
3) Push-based broadcasting allows data to be sent efficiently to multiple devices simultaneously but may disseminate unwanted information, while pull-based on-demand delivery only sends requested data but can overburden servers with many requests.
This document provides an overview of communication and computer networks. It begins with a brief history of communication methods such as smoke signals and drums. It then introduces computer networks, distinguishing between wide area networks that connect multiple locations over long distances, and local/metropolitan area networks that operate within a limited geographical scope. The document discusses how networks allocate and share resources among users. It also outlines some of the challenges in integrating different network services and maintaining security.
Computer networks allow interconnected devices to communicate. They have advantages like resource sharing and cost savings but also disadvantages such as reduced productivity if poorly managed or servers fail. Early networks included ARPANET in 1969 and NSFNET in the 1980s, leading to the modern Internet. Networks transmit data via circuits, packets, or messages using techniques like circuit switching, packet switching, and message switching. Components include nodes, servers, clients, hardware, software and communication channels. Networks can be LANs, MANs, WANs or PANs depending on their area of coverage. Wired networks use media like twisted pair, coaxial or fiber optic cables while wireless uses radio waves.
Distributed Systems - Information TechnologySagar Mehta
Distributed systems rely on underlying computer networks for communication. The performance, reliability, scalability, mobility, and quality of service of these networks impact distributed system design. Networks are built using transmission media and hardware like routers and switches. They operate using principles such as protocol layering, packet switching, routing, and data streaming. Different network types include personal area networks, local area networks, wide area networks, and wireless variants of these.
Introduction: Mobile Communications, Mobile Computing – Paradigm, Promises/Novel Applications and Impediments and Architecture; Mobile and Handheld Devices, Limitations of Mobile and Handheld Devices.
GSM – Services, System Architecture, Radio Interfaces, Protocols, Localization, Calling, Handover, Security, New Data Services, GPRS, CSHSD, DECT.
This document discusses different mechanisms for data dissemination to mobile devices. It describes push-based mechanisms where data is broadcast from servers to devices without requests. Pull-based mechanisms allow devices to request specific data from servers. Hybrid mechanisms combine push and pull. The document focuses on communication asymmetry in mobile networks and how this impacts efficient data dissemination. It provides examples and classifications of different data delivery approaches for wireless applications.
This document discusses different mechanisms for data dissemination to mobile devices. It describes push-based mechanisms where data is broadcast from servers to devices without requests. Pull-based mechanisms allow devices to request specific data from servers. Hybrid mechanisms combine push and pull. The document focuses on communication asymmetry in mobile networks and how this impacts efficient data dissemination. It provides examples and classifications of different data delivery approaches for wireless applications.
A computer network allows computers to share resources and exchange information. There are several types of networks including local area networks (LANs) within a building, metropolitan area networks (MANs) within a city, and wide area networks (WANs) that span large geographical areas. Networks provide benefits like resource sharing, reliability, reduced costs, and improved communication. They connect using various wired and wireless technologies and different network topologies.
This document discusses different types of internet connections, including leased circuits, dialup access, broadband access, and wireless access methods. It provides details on leased lines, T1 and T3 lines, DSL, cable broadband, dialup, wireless networks, Wi-Fi, WiMAX, and satellite internet. The types of connections are compared based on factors like speed, cost, and availability for different users ranging from homes to large businesses.
Hardware and Software requirements for Internet 2.pptxRbalasubramani
The Internet is the global system of interconnected computer networks that use the Internet protocol suite to link devices worldwide. The purpose of the internet is to communicate between computers that are interconnected with each other. Internet is accessible to every user all over the world.
Hardware and Software requirements for Internet 2.pptxlisbala
The Internet is the global system of interconnected computer networks that use the Internet protocol suite to link devices worldwide. The purpose of the internet is to communicate between computers that are interconnected with each other. Internet is accessible to every user all over the world.
The document provides information about an industrial training program in telecom networks delivered by Telcoma Technologies Pvt. Limited. It discusses the company profile and modules covered in the training, including an overview of cellular network generations from 1G to 4G. It also describes key components of cellular networks such as network towers, antennas, and channels. Additionally, it outlines the objectives and data collection process for a project on planning a telecom network for a new company in a particular area.
Computer Networks: Evolution of Computer Networks.pptxVishwaTej10
The document summarizes the evolution of computer networking from early networks like ARPANET in 1969 to the modern Internet. It discusses key concepts like distributed processing, network criteria of performance, reliability and security. It also covers network transmission technologies including unicast, broadcast and multicast. Different types of networks are defined, from local area networks (LANs) to wide area networks (WANs). Common network devices like hubs, switches and routers are also explained.
This document provides an overview of computer networks and the Internet. It defines a computer network as a collection of connected computing devices that share resources. The main advantages are sharing devices and files, communication capabilities, and centralized data backup. Challenges include high setup costs and risk of viruses or hacking. It describes common network models like client-server, and different types of networks by transmission range. The Internet is defined as a global network of networks using TCP/IP that links billions of devices worldwide. Key components that enable the Internet include backbone networks, ISPs, packet switching, and TCP and IP protocols.
4G cellular systems aim to provide broadband wireless access with peak data rates over 20 Mbps. Key challenges for 4G include limited coverage due to higher frequencies and capacity constraints of current air interfaces. 4G requires spectrum below 5 GHz for wide-area coverage given mobile device limitations. It will also utilize technologies like adaptive antennas and asymmetric data rates to boost coverage and capacity.
4G cellular systems aim to provide broadband wireless access with peak data rates over 20 Mbps. Key challenges for 4G include limited coverage due to higher frequencies, capacity constraints of current air interfaces, and availability of suitable spectrum below 5 GHz for wide-area coverage. 4G concepts involve small cell sizes, adaptive antennas, asymmetric data rates, and advanced air interfaces to improve coverage and capacity over 3G systems.
International Journal of Engineering Research and DevelopmentIJERD Editor
This document summarizes a research paper on data dissemination to mobile users. It presents a dynamic channel model and information push model to disseminate data to mobile users. The model captures mobility requirements like location-based filtering of information. It was implemented in a software framework called Ubidata. The paper also describes an adaptive framework called Update for information dissemination to mobile systems. It presents the development process for mobile applications that operate using an information dissemination model. Key aspects covered include dynamic channel allocation, data access methods, broadcast scheduling and evaluating data access efficiency.
Similar to Data Dissemination and Synchronization (20)
The Collections Framework (java.util)- Collections overview, Collection Interfaces, The Collection classes- Array List, Linked List, Hash Set, Tree Set, Priority Queue, Array Deque. Accessing a Collection via an Iterator, Using an Iterator, The For-Each alternative, Map Interfaces and Classes, Comparators, Collection algorithms, Arrays, The Legacy Classes and Interfaces- Dictionary, Hashtable ,Properties, Stack, Vector More Utility classes, String Tokenizer, Bit Set, Date, Calendar, Random, Formatter, Scanner
The document discusses Java programming concepts of exception handling and multithreading. It covers exception types, try/catch/throw/throws/finally clauses, creating custom exceptions, and the Java thread model for creating and synchronizing threads. The document also provides example code and discusses checked and unchecked exceptions, nested try blocks, and inter-thread communication in Java.
This document provides an overview of packages, interfaces, and stream-based I/O in Java. It defines a package, discusses access protection and importing packages. Interfaces are introduced as a way to achieve multiple inheritance in Java. Key characteristics of interfaces like not allowing implementation and only containing abstract methods are described. The relationship between interfaces and abstract classes is compared. Common interfaces like Comparable are explained. Finally, stream-based I/O concepts like character streams, reading/writing files and serialization are listed as topics to be covered. Universities questions on these topics are also provided.
Object-Oriented Thinking- A way of viewing world – Agents and Communities, messages and methods, Responsibilities, Classes and Instances, Class Hierarchies- Inheritance, Method binding, Overriding and Exceptions, Summary of Object-Oriented concepts. Java buzzwords, An Overview of Java, Data types, Variables and Arrays, operators, expressions, control statements, Introducing classes, Methods and Classes, String handling.
Inheritance– Inheritance concept, Inheritance basics, Member access, Constructors, Creating Multilevel hierarchy, super uses, using final with inheritance, Polymorphism-ad hoc polymorphism, pure polymorphism, method overriding, abstract classes, Object class, forms of inheritance specialization, specification, construction, extension, limitation, combination, benefits of inheritance, costs of inheritance
JSP
The Anatomy of a JSP Page, JSP Processing, Declarations, Directives, Expressions, Code Snippets, implicit objects, Using Beans in JSP Pages, Using Cookies and session for session tracking, connecting to database in JSP.
Servlet
Common Gateway Interface (CGI), Lifecycle of a Servlet, deploying a servlet, The Servlet API, Reading Servlet parameters, Reading Initialization parameters, Handling Http Request & Responses, Using Cookies and Sessions, connecting to a database using JDBC.
Introduction to XML, Defining XML tags, their attributes and values, Document Type Definition, XML Schemas, Document Object Model, XHTML Parsing XML Data - DOM and SAX Parsers in java.
Introduction to PHP: Declaring variables, data types, arrays, strings, operators, expressions, control structures, functions, Reading data from web form controls like text boxes, radio buttons, lists etc., Handling File Uploads, Connecting to database (MySQL as reference), executing simple queries, handling results, Handling sessions and cookies File Handling in PHP: File operations like opening, closing, reading, writing, appending, deleting etc. on text and binary files, listing directories
Machine-Independent Optimizations: The Principal Sources of Optimization, Introduction to Data-Flow Analysis, Foundations of Data-Flow Analysis, Constant Propagation, Partial Redundancy Elimination, Loops in Flow Graphs
Run-Time Environments: Storage organization, Stack Allocation of Space, Access to Nonlocal Data on the Stack, Heap Management, Introduction to Garbage Collection, Introduction to Trace-Based Collection. Code Generation: Issues in the Design of a Code Generator, The Target Language, Addresses in the Target Code, Basic Blocks and Flow Graphs, Optimization of Basic Blocks, A Simple Code Generator, Peephole Optimization, Register Allocation and Assignment, Dynamic Programming Code-Generation
Syntax-Directed Translation: Syntax-Directed Definitions, Evaluation Orders for SDD's, Applications of Syntax-Directed Translation, Syntax-Directed Translation Schemes, and Implementing L-Attributed SDD's. Intermediate-Code Generation: Variants of Syntax Trees, Three-Address Code, Types and Declarations, Type Checking, Control Flow, Back patching, Switch-Statements
This document provides an overview of syntax analysis in compiler design. It discusses context-free grammars, top-down parsing including recursive descent and LL(1) parsing, and bottom-up parsing including LR parsing. It describes the key concepts of context-free grammars, ambiguous and unambiguous grammars. It explains top-down parsing as constructing a parse tree from the root node down and bottom-up parsing as building the tree from the leaf nodes up. It discusses the closure and goto operations used in LR parsing and describes the differences between LR(0), SLR, CLR, and LALR parsing techniques.
Introduction: Language Processors, the structure of a compiler, the science of building a compiler, programming language basics.
Lexical Analysis: The Role of the Lexical Analyzer, Input Buffering, Recognition of Tokens, The Lexical-Analyzer Generator Lex, Finite Automata, From Regular Expressions to Automata, Design of a Lexical-Analyzer Generator, Optimization of DFA-Based Pattern Matchers
The Secure Inter-branch Payment Transactions case study describes the current electronic payment system used by General Bank of India to transfer funds between branches, which utilizes a central server but lacks strong security. Improvements are needed to add encryption, digital signatures for non-repudiation, and a public key infrastructure to securely distribute keys. Cryptographic toolkits and smart cards could also be incorporated into the system to enhance security of financial transactions transmitted over the private network.
This document provides an overview of a university course on Cryptography and Network Security. It begins with the course syllabus, which outlines topics like security concepts, cryptography concepts and techniques, and types of security attacks. It then discusses key security concepts such as security services, security mechanisms, security attacks, and models for network and access security. It provides examples of security services like authentication, access control, and data confidentiality. It also describes security mechanisms and different classes of security attacks. The document concludes by listing reference books, online videos, related courses, tutorials, and sample multiple choice and problems related to cryptography and network security.
More from Jyothishmathi Institute of Technology and Science Karimnagar (20)
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
A Comprehensive Guide to DeFi Development Services in 2024Intelisync
DeFi represents a paradigm shift in the financial industry. Instead of relying on traditional, centralized institutions like banks, DeFi leverages blockchain technology to create a decentralized network of financial services. This means that financial transactions can occur directly between parties, without intermediaries, using smart contracts on platforms like Ethereum.
In 2024, we are witnessing an explosion of new DeFi projects and protocols, each pushing the boundaries of what’s possible in finance.
In summary, DeFi in 2024 is not just a trend; it’s a revolution that democratizes finance, enhances security and transparency, and fosters continuous innovation. As we proceed through this presentation, we'll explore the various components and services of DeFi in detail, shedding light on how they are transforming the financial landscape.
At Intelisync, we specialize in providing comprehensive DeFi development services tailored to meet the unique needs of our clients. From smart contract development to dApp creation and security audits, we ensure that your DeFi project is built with innovation, security, and scalability in mind. Trust Intelisync to guide you through the intricate landscape of decentralized finance and unlock the full potential of blockchain technology.
Ready to take your DeFi project to the next level? Partner with Intelisync for expert DeFi development services today!
Letter and Document Automation for Bonterra Impact Management (fka Social Sol...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on automated letter generation for Bonterra Impact Management using Google Workspace or Microsoft 365.
Interested in deploying letter generation automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Fueling AI with Great Data with Airbyte WebinarZilliz
This talk will focus on how to collect data from a variety of sources, leveraging this data for RAG and other GenAI use cases, and finally charting your course to productionalization.
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
Taking AI to the Next Level in Manufacturing.pdfssuserfac0301
Read Taking AI to the Next Level in Manufacturing to gain insights on AI adoption in the manufacturing industry, such as:
1. How quickly AI is being implemented in manufacturing.
2. Which barriers stand in the way of AI adoption.
3. How data quality and governance form the backbone of AI.
4. Organizational processes and structures that may inhibit effective AI adoption.
6. Ideas and approaches to help build your organization's AI strategy.
Skybuffer AI: Advanced Conversational and Generative AI Solution on SAP Busin...Tatiana Kojar
Skybuffer AI, built on the robust SAP Business Technology Platform (SAP BTP), is the latest and most advanced version of our AI development, reaffirming our commitment to delivering top-tier AI solutions. Skybuffer AI harnesses all the innovative capabilities of the SAP BTP in the AI domain, from Conversational AI to cutting-edge Generative AI and Retrieval-Augmented Generation (RAG). It also helps SAP customers safeguard their investments into SAP Conversational AI and ensure a seamless, one-click transition to SAP Business AI.
With Skybuffer AI, various AI models can be integrated into a single communication channel such as Microsoft Teams. This integration empowers business users with insights drawn from SAP backend systems, enterprise documents, and the expansive knowledge of Generative AI. And the best part of it is that it is all managed through our intuitive no-code Action Server interface, requiring no extensive coding knowledge and making the advanced AI accessible to more users.
Monitoring and Managing Anomaly Detection on OpenShift.pdfTosin Akinosho
Monitoring and Managing Anomaly Detection on OpenShift
Overview
Dive into the world of anomaly detection on edge devices with our comprehensive hands-on tutorial. This SlideShare presentation will guide you through the entire process, from data collection and model training to edge deployment and real-time monitoring. Perfect for those looking to implement robust anomaly detection systems on resource-constrained IoT/edge devices.
Key Topics Covered
1. Introduction to Anomaly Detection
- Understand the fundamentals of anomaly detection and its importance in identifying unusual behavior or failures in systems.
2. Understanding Edge (IoT)
- Learn about edge computing and IoT, and how they enable real-time data processing and decision-making at the source.
3. What is ArgoCD?
- Discover ArgoCD, a declarative, GitOps continuous delivery tool for Kubernetes, and its role in deploying applications on edge devices.
4. Deployment Using ArgoCD for Edge Devices
- Step-by-step guide on deploying anomaly detection models on edge devices using ArgoCD.
5. Introduction to Apache Kafka and S3
- Explore Apache Kafka for real-time data streaming and Amazon S3 for scalable storage solutions.
6. Viewing Kafka Messages in the Data Lake
- Learn how to view and analyze Kafka messages stored in a data lake for better insights.
7. What is Prometheus?
- Get to know Prometheus, an open-source monitoring and alerting toolkit, and its application in monitoring edge devices.
8. Monitoring Application Metrics with Prometheus
- Detailed instructions on setting up Prometheus to monitor the performance and health of your anomaly detection system.
9. What is Camel K?
- Introduction to Camel K, a lightweight integration framework built on Apache Camel, designed for Kubernetes.
10. Configuring Camel K Integrations for Data Pipelines
- Learn how to configure Camel K for seamless data pipeline integrations in your anomaly detection workflow.
11. What is a Jupyter Notebook?
- Overview of Jupyter Notebooks, an open-source web application for creating and sharing documents with live code, equations, visualizations, and narrative text.
12. Jupyter Notebooks with Code Examples
- Hands-on examples and code snippets in Jupyter Notebooks to help you implement and test anomaly detection models.
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slackshyamraj55
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
Your One-Stop Shop for Python Success: Top 10 US Python Development Providersakankshawande
Simplify your search for a reliable Python development partner! This list presents the top 10 trusted US providers offering comprehensive Python development services, ensuring your project's success from conception to completion.
Trusted Execution Environment for Decentralized Process MiningLucaBarbaro3
Presentation of the paper "Trusted Execution Environment for Decentralized Process Mining" given during the CAiSE 2024 Conference in Cyprus on June 7, 2024.
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
2. Data Dissemination
• Ongoing advances in communications
including the proliferation of internet,
development of mobile and wireless
networks, high bandwidth availability to
homes have led to development of a wide
range of new-information centered
applications.
• Many of these applications involve data
dissemination, i.e. delivery of data from a
set of producers to a larger set of
consumers.
3. • Data dissemination entails distributing
and pushing data generated by a set of
computing systems or broadcasting data
from audio, video, and data services.
• The output data is sent to the mobile
devices. A mobile device can select, tune
and cache the required data items, which
can be used for application programs.
4. • Efficient utilization of wireless bandwidth and
battery power are two of the most important
problems facing software designed for mobile
computing.
• Broadcast channels are attractive in tackling
these two problems in wireless data
dissemination.
• Data disseminated through broadcast channels
can be simultaneously accessed by an arbitrary
number of mobile users, thus increasing the
efficiency of bandwidth usage.
5. Communications Asymmetry
• One key aspect of dissemination-based applications is
their inherent communications asymmetry.
• That is, the communication capacity or data volume in
the downstream direction (from servers-to-clients) is
much greater than that in the upstream direction (from
clients-to-servers).
• Content delivery is an asymmetric process regardless of
whether it is performed over a symmetric channel such
as the internet or over an asymmetric one, such as cable
television (CATV) network.
• Techniques and system architectures that can efficiently
support asymmetric applications will therefore be a
requirement for future use.
6. • Mobile communication between a mobile device and a static
computer system is intrinsically asymmetric. A device is allocated a
limited bandwidth.
• This is because a large number of devices access the network.
Bandwidth in the downstream from the server to the device is much
larger than the one in the upstream from the device to the server.
• This is because mobile devices have limited power resources and
also due to the fact that faster data transmission rates for long
intervals of time need greater power dissipation from the devices.
• In GSM networks data transmission rates go up to a maximum of
14.4 kbps for both uplink and downlink.
• The communication is symmetric and this symmetry can be
maintained because GSM is only used for voice communication.
7. Data Dissemination
Communication asymmetry in uplink and downlink and participation ofdevice
APIs and distributed computing systems when an application runs
The above figure shows communication asymmetry in uplink anddownlink
in a mobile network. The participation of deviceAPIs and distributed
computing systems in the running of an application is also shown.
8. Communication Asymmetry
• • Intrinsically asymmetric Mobile
• communication between the mobile
• device and static computer system
• • Device allocated a limited bandwidth
• • Because of a large number of devices
9. • • Bandwidth in the downstream from the
• server to device much larger than the
• one in the upstream from the device to
• server
• • Because mobile devices have limited
• power resources
• • Faster data transmission rates for long
• intervals of time need greater power
• dissipation from the devices
11. GSM networks data
transmission
• • Rates go up to a maximum of 14.4 kbps
• for both uplink and downlink
• • Symmetric communication
• • Only used for voice communication
12. i-mode for many applications
• • Used for voice, multimedia transmission,
• Internet access, voice communication
• • Base station provides downlink 384 kbps
• • Uplink from the devices restricted to 64
• kbps
• • Asymmetric communication
13. The characteristics in
wireless signals
• • Interference and time-dispersion
• • Signal distortion and transmission errors
• at the receiver end
• • Lead to path loss and signal fading,
• which cause data loss
• • Greater access latency compared to
• wired networks
14. The characteristics in
wireless signals
• • Data loss has to be taken care of by
• repeat transmissions
• • Transmission errors have to be corrected
• • Taken care of by appending additional
• bits, such as the forward error correction
• bits
15. The characteristics in Mobile
communication
• • Mobile devices also have low storage
• capacity (memory)
• • Cannot hoard large databases
• • Accessing the data online not only has a
• latency period (is not instantaneous) but
• also dissipates bandwidth resources of
• the device
16. Broadcasting
• • Corresponds to unidirectional (downlink
• from the server to the devices)
• • Unicast communication─ Unicast means
• the transmission of data packets in a
• computer network such that a single
• destination receives the packets
17. Broadcasting or application
distribution
service
• • This destination generally the one which
• has subscribed to the service
• • Mobile TV─ an example of unidirectional
• unicast mode of broadcasting
• • Each device receives broadcast data
• packets from the service provider‘s
• application– distribution system
20. Summary
•
• • GSM symmetric and voice only
• • Mobile communication asymmetric in
• general
• • Limited device capability
• • Device memory, energy and uplink and
• downlink bandwidths
• • Broadcast architecture
21. Classification of Data-Delivery
Mechanisms
• There are two fundamental information delivery methods for wireless
data applications: Point-to-Point access and Broadcast.
• Compared with Point-to-Point access, broadcast is a more attractive
method. A single broadcast of a data item can satisfy all the
outstanding requests for that item simultaneously.
• As such, broadcast can scale up to an arbitrary number of users.
There are three kinds of broadcast models, namely push-based
broadcast, On-demand (or pull-based) broadcast, and hybrid
broadcast.
• In push based broadcast, the server disseminates information using
a periodic/aperiodic broadcast program (generally without any
intervention of clients).
•
22. • In on demand broadcast, the server disseminates
information based on the outstanding requests submitted
by clients; In hybrid broadcast, push based broadcast
and on demand data deliveries are combined to
complement each other.
• In addition, mobile computers consume less battery
power on monitoring broadcast channels to receive data
than accessing data through point-to-point
communications.
• Data-delivery mechanisms can be classified into three
categories, namely, push-based mechanisms (publish-
subscribe mode), pull-based mechanisms (on-demand
mode), and hybrid mechanisms (hybrid mode).
24. Push-based Mechanisms
• The server pushes data records from a set of distributed computing
systems.
• Examples are advertisers or generators of traffic congestion,
weather reports, stock quotes, and news reports.
• The following figure shows a push-based data-delivery mechanism
in which a server or computing system pushes the data records from
a set of distributed computing systems.
• The data records are pushed to mobile devices by broadcasting
without any demand.
• The push mode is also known as publish-subscribe mode in
which the data is pushed as per the subscription for a push
service by a user.
• The subscribed query for a data record is taken as perpetual
query till the user unsubscribe to that service. Data can also be
pushed without user subscription.
26. Push-based mechanisms function in the
following manner:
• 1. A structure of data records to be pushed is selected. An algorithm
provides an adaptable multi-level mechanism that permits data
items to be pushed uniformly or non-uniformly after structuring them
according to their relative importance.
• 2. Data is pushed at selected time intervals using an adaptive
algorithm. Pushing only once saves bandwidth. However, pushing at
periodic intervals is important because it provides the devices that
were disconnected at the time of previous push with a chance to
cache the data when it is pushed again.
• 3. Bandwidths are adapted for downlink (for pushes) using an
algorithm. Usually higher bandwidth is allocated to records having
higher number of subscribers or to those with higher access
probabilities.
• 4. A mechanism is also adopted to stop pushes when a device is
handed over to another cell.
27. • Advantages of Push based mechanisms:
– Push-based mechanisms enable broadcast of data services t
o
multiple devices.
– The server is not interrupted frequently by requests from
mobile devices.
– These mechanisms also prevent server overload, which might
be caused by flooding of device requests
– Also, the user even gets the data he would have otherwise
ignored such as traffic congestion, forthcoming weather reports
etc
• Disadvantages:
– Push-based mechanisms disseminate of unsolicited,
irrelevant, or out-of-context data, which may cause
inconvenience to the user.
28. Pull based Mechanisms
• The user-device or computing system pulls the data records from
the service provider's application database server or from a set of
distributed computing systems.
• Examples are music album server, ring tones server, video clips
server, or bank account activity server.
• Records are pulled by the mobile devices on demand followed by
the selective response from the server.
• Selective response means that server transmits data packets as
response selectively, for example, after client-authentication,
verification, or subscription account check. The pull mode is also
known as the on-demand mode.
• The following figure shows a pull-based data-delivery mechanism in
which a device pulls (demands) from a server or computing system,
the data records generated by a set of distributed computing
systems.
29.
30. Pull-based mechanisms function in the
following manner:
– 1. The bandwidth used for the uplink channel
depends upon the number of pull requests.
– 2. A pull threshold is selected. This threshold limits
the number of pull requests in a given period of time.
This controls the number of server interruptions.
– 3. A mechanism is adopted to prevent the device from
pulling from a cell, which has handed over the
concerned device to another cell. On device handoff,
the subscription is cancelled or passed on to the new
service provider cell
• In pull-based mechanisms the user-device
receives data records sent by server on demand
only.
31. • Advantages of Pull based mechanisms:
– With pull-based mechanisms, no unsolicited or irrelevant data
arrives at the device and the relevant data is disseminated only
when the user asks for it.
– Pull-based mechanisms are the best option when the server
has very little contention and is able to respond to many device
requests within expected time intervals.
• Disadvantages:
– The server faces frequent interruptions and queues of
requests at the server may cause congestion in cases of sudden
rise in demand for certain data record.
– In on-demand mode, another disadvantage is the energy and
bandwidth required for sending the requests for hot items and
temporal records
32. Hybrid Mechanisms
• A hybrid data-delivery mechanism integrates pushes and pulls. The
hybrid mechanism is also known as interleaved-push-and-pull (IPP)
mechanism.
• The devices use the back channel to send pull requests for records,
which are not regularly pushed by the front channel.
• The front channel uses algorithms modeled as broadcast disks and
sends the generated interleaved responses to the pull requests.
• The user device or computing system pulls as well receives the
pushes of the data records from the service provider's application
server or database server or from a set of distributed computing
systems.
• Best example would be a system for advertising and selling music
albums. The advertisements are pushed and the mobile devices pull
for buying the album.
34. • The above figure shows a hybrid
interleaved, push-pull-based data-delivery
mechanism in which a device pulls
(demands) from a server and the server
interleaves the responses along with the
pushes of the data records generated by a
set of distributed computing systems.
35. Hybrid mechanisms function in the
following manner:
• 1. There are two channels, one for pushes by front channel and theother
for pulls by back channel.
• 2. Bandwidth is shared and adapted between the two channels depending
upon the number of active devices receiving data from the server and the
number of devices requesting data pulls from theserver.
• 3. An algorithm can adaptively chop the slowest level of the scheduled
pushes successively The data records at lower level where the records are
assigned lower priorities can have long push intervals in a broadcasting
model.
• Advantages of Hybrid mechanisms:
– The number of server interruptions and queued requests are significantly
reduced.
• Disadvantages:
– IPP does not eliminate the typical server problems of too many interruptions
and queued requests.
– Another disadvantage is that adaptive chopping of the slowest level of
scheduled pushes.
36. Selective Tuning and Indexing
Techniques
• The purpose of pushing and adapting to a broadcast
model is to push records of greater interest with greater
frequency in order to reduce access time or average
access latency.
• A mobile device does not have sufficient energy to
continuously cache the broadcast records and hoard
them in its memory.
• A device has to dissipate more power if it gets each
pushed item and caches it.
• Therefore, it should be activated for listening and
caching only when it is going to receive the selected data
records or buckets of interest.
• During remaining time intervals, that is, when the
broadcast data buckets or records are not of its interest,
it switches to idle or power down mode.
37. • Selective tuning is a process by which client device selects only the
required pushed buckets or records, tunes to them, and caches
them.
• Tuning means getting ready for caching at those instants and
intervals when a selected record of interest broadcasts. Broadcast
data has a structure and overhead.
• Data broadcast from server, which is organized into buckets, is
interleaved. The server prefixes a directory, hash parameter (from
which the device finds the key), or index to the buckets.
• These prefixes form the basis of different methods of selective
tuning. Access time (taccess) is the time interval between pull
request from device and reception of response from
broadcasting or data pushing or responding server. Two
important factors affect taccess –
– (i) number and size of the records to be broadcast and
– (ii) directory- or cache-miss factor (if there is a miss then the
response from the server can be received only in subsequent
broadcast cycle or subsequent repeat broadcast in the cycle).
38. Directory Method
• One of the methods for selective tuning involves
broadcasting a directory as overhead at the beginning of
each broadcast cycle.
• If the interval between the start of the broadcast cycles
is T, then directory is broadcast at each successive
intervals of T.
• A directory can be provided which specifies when a
specific record or data item appears in data being
broadcasted.
• For example, a directory (at header of the cycle) consists
of directory start sign, 10, 20, 52, directory end sign.
• It means that after the directory end sign, the 10th, 20th
and 52nd buckets contain the data items in response to
the device request. The device selectively tunes to these
buckets from the broadcast data.
39. • A device has to wait for directory consisting of start sign,
pointers for locating buckets or records, and end sign.
• Then it has to wait for the required bucket or record
before it can get tuned to it and, start caching it.
• Tuning time ttune is the time taken by the device for
selection of records.
• This includes the time lapse before the device starts
receiving data from the server. In other words, it is the
sum of three periods—time spent in listening to the
directory signs and pointers for the record in order to
select a bucket or record required by the device, waiting
for the buckets of interest while actively listening (getting
the incoming record wirelessly), and caching the
broadcast data record or bucket.
40. • The device selectively tunes to the broadcast
data to download the records of interest.
• When a directory is broadcast along with the
data records, it minimizes ttune and taccess.
• The device saves energy by remaining active
just for the periods of caching the directory and
the data buckets.
• For rest of the period (between directory end
sign and start of the required bucket), it remains
idle or performs application tasks. Without the
use of directory for tuning, ttune = taccess and
the device is not idle during any time interval.
41. Hash-Based Method
• Hash is a result of operations on a pair of key and record.
• Advantage of broadcasting a hash is that it contains a fewer bits
compared to key and record separately.
• The operations are done by a hashing function. From the server end
the hash is broadcasted and from the device end a key is extracted
by computations from the data in the record by operating the data
with a function called hash function (algorithm).
• This key is called hash key.
• Hash-based method entails that the hash for the hashing parameter
(hash key) is broadcasted.
• Each device receives it and tunes to the record as per the extracted
key.
• In this method, the records that are of interest to a device or those
required by it are cached from the broadcast cycle by first extracting
and identifying the hash key which provides the location of the
record.
42. • This helps in tuning of the device. Hash-based method can be
described as follows:
– 1. A separate directory is not broadcast as overhead with each
broadcast cycle.
– 2. Each broadcast cycle has hash bits for the hash function H, ashift
function S, and the data that it holds. The function S specifies the
location of the record or remaining part of the record relative to the
location of hash and, thus, the time interval for wait before the record
can be tuned and cached.
– 3. Assume that a broadcast cycle pushes the hashing parameters H(Rí)
[H and S] and record Rí. The functions H and S help in tuning to the
H(Rí) and hence to Rí as follows—H gives a key which in turn gives
the location of H(Rí) in the broadcast data. In case H generates a
key that does not provide the location of H(Rí) by itself, then the
device computes the location from S after the location of H(Rí).
That location has the sequential records Rí and the devices tunes
to the records from these locations.
– 4. In case the device misses the record in first cycle, it tunes and
caches that in next or some other cycle.
43. Index-Based Method
• Indexing is another method for selective tuning. Indexes
temporarily map the location of the buckets.
• At each location, besides the bits for the bucket in
record of interest data, an offset value may also be
specified there.
• While an index maps to the absolute location from the
beginning of a broadcast cycle, an offset index is a
number which maps to the relative location after the end
of present bucket of interest.
• Offset means a value to be used by the device along
with the present location and calculate the wait period for
tuning to the next bucket. All buckets have an offset to
the beginning of the next indexed bucket or item.
44. • Indexing is a technique in which each data
bucket, record, or record block of interest is
assigned an index at the previous data bucket,
record, or record block of interest to enable the
device to tune and cache the bucket after the
wait as per the offset value.
• The server transmits this index at the beginning
of a broadcast cycle as well as with each bucket
corresponding to data of interest to the device.
• A disadvantage of using index is that it extends
the broadcast cycle and hence increases
taccess.
45. • The index I has several offsets and the bucket type and flag information.A
typical index may consist of thefollowing:
– 1. Ioffset(1) which defines the offset to first bucket of nearest index.
– 2. Additional information about Tb, which is the time required for caching the
bucket bits in full after the device tunes to and starts caching the bucket.This
enables transmission of buckets of variable lengths.
– 3. Ioffset (next) which is the index offset of next bucket record of interest.
– 4. Ioffset(end) which is the index offset for the end of broadcast cycle and the start of
next cycle. This enables the device to look for next index I after the time interval
as per Ioffset(end). This also permits a broadcast cycle to consist of variable number
of buckets.
– 5. Itype, which provides the specification of the type of contents of next bucket to be
tuned, that is, whether it has an index value or data.
– 6. A flag called dirty flag which contains the information whether the indexed
buckets defined by Ioffset(1) and Ioffset(next) are dirty or not. An indexed bucket being
dirty means that it has been rewritten at the server with new values. Therefore,
the device should invalidate the previous caches of these buckets and update
them by tuning to and caching them.
46. Distributed Index Based
Method
• Distributed index-based method is an improvement on
the (I, m) method.
• In this method, there is no need to repeat the complete
index again and again.
• Instead of replicating the whole index m times, each
index segment in a bucket describes only the offset I' of
data items which immediately follow. Each index I is
partitioned into two parts—I' and I".
• I" consists of unrepeated k levels (sub-indexes), which
do not repeat and I' consists of top I repeated levels
(sub-indexes).
• Assume that a device misses I(includes I' and I' once)
transmitted at the beginning of the broadcast cycle. As I'
is repeated m - I times after this, it tunes to the pushes
by using I', The access latency is reduced as I' has
lesser levels.
47. Flexible Indexing Method
• Assume that a broadcast cycle has number of data segments with
each of the segments having a variable set of records. For example,
let n records, Ro to Rn-1, be present in four data segments, R() to
Ri-1, Ri to Rj-1 , Rj to Rj-1 and Rk to Rn-1.
• Some possible index parameters are (i) Iseg,having just 2 bits for
the offset, to specify the location of a segment in a broadcast cycle,
(ii) Irec, having just 6 bits for the offset, to specify the location of a
record of interest within a segment of the broadcast cycle, (iii) Ib,
having just 4 bits for the offset, to specify the location of a bucket of
interest within a record present in one of the segments of the
broadcast cycle.
• Flexible indexing method provides dual use of the parameters (e.g.,
use of Iseg or Irec in an index segment to tune to the record or
buckets of interest) or multi-parameter indexing (e.g., use of Iseg,
Irec, or Ib in an index segment to tune to the bucket of interest).
48. • Assume that broadcast cycle has m sets of
records (called segments). A set of binary bits
defines the index parameter Iseg,. A local index
is then assigned to the specific record (or
bucket). Only local index (Irec or Ib) is used in
(Iloc, m) based data tuning which corresponds to
the case of flexible indexing method being
discussed. The number of bits in a local index is
much smaller than that required when each
record is assigned an index. Therefore, the
flexible indexing method proves to be beneficial.