Poster Presentation

Download Report

Transcript Poster Presentation

MOBAGE – Mobile P2P Networking
Advisors: Prof. Asim Smailagic, Prof. Dan Siewiorek {asim,[email protected]}
Students: Joerg Claussen, Gesly George, Matt Hornyak, David Hsu, Harvey Vrsalovic
{claussen,ggeorge,matth,dfhsu,[email protected]}
System Architecture
Motivation
 A Peer-to-Peer (P2P) system for mobile devices to
allow for sharing of information within a community.
Application
User Interface
 Users may
Search
 Actively “chat” to share information
internal
Node List
Features
 Proactively: Chat and directed search
 Passively: Capturing others’ searched information
Chat
Search
updates
 Allow free roaming mobile device users to benefit from
each other’s information and ideas
 Local and remote light weight search
 Simultaneous multi-node remote search (p2p)
Cache
(hot data)
P2P Info Application P2PIA
 Handle user input
 Store/Answer Questions
 Manage received data
 Search
external
 Passively search or
Cache miss
Index
FS
 Chat
Chat Messages
External
Search
Query
 Global chat rooms (in the “visible” p2p network)
 Dynamic notification of available chat rooms
listen to all messages
P2PNL
 Persistent chats – allows remote search of chat info
 Built with mobile devices in mind
 small memory footprint
 user interface (UI) considers screen size/input type
 Tolerates erratic connections typical of current mobile
environments
 As powerful as the number of users “online”; desirable
scaling behavior
P2P Network Layer P2PNL
Network Layer
P2PIA
 Pass low-level messages
 Manage node-list
(known/connected)
 NID  physical address mapping
 Network layout is “unstructured mesh”
IPC Handler
App Message Processor
Callback
registry
NID / IP
tables
Input / Output
Queues
TCP/IP and 802.11
Connections
Why P2P?
P2P Network Processor
Socket Handler
 Peer-to-peer (P2P): A method of networking that
assumes all hosts are equal; each host both provides
and requests services from other hosts.
Network (TCP/IP)
 Advantages:
User Interface
 Scalability
 Fixed upper limit of simultaneous connections
 Basic assertions of the protocol
 Each node has a unique NID
 Minimal network state should be maintained due to
limited resources
 All NID  physical address mapping is handled
within the P2PNL
 Deployment on mobile systems
 PDAs
 Works without infrastructure
 Mobile Phones
 Benefits of deploying as P2P
 Low Cost Hardware (e.g. GameBoy)
 Technological:
 Network Scalability
 Requires no infrastructure; all that is required is
for users to be present.
 P2PNL is a rapid prototype. No optimizations have
been implemented, so network scales > 100 nodes
may cause slowdown
 System “capability” degrades gracefully with
users leaving.
 Search can be especially affected; Broadcasting
tends to have exponential impact w.r.t. network
size
 Sociological:
 People not always willing to actively monitor
forums, search online, write email, etc.
Node state /
Profile
 Any node may connect to any node
Future Work
 Fault-tolerance
 People are not always willing to ask strangers
for information, even when in a common
environment (school, work, etc.)
 Possibility for persistent queries
Home
Search Queries
Search Results
Chat
 Presentation of data in UI
 Different types of data or manners of searching will
have different popularities; adoption of UI might be
necessary