1 / 9

Gnutella-Based Architecture for CS179i: Using Python and Intelligent Routing

Explore an innovative architecture for CS179i utilizing Gnutella and Python. Discover advanced components like Gnutella Server, customized FTP/HTTP tools, and efficient data structures like Neighbor Table and Routing History for seamless connectivity and file-sharing. Keep pace with the latest advancements in the field on www.cs.ucr.edu/~yhe/cs179i.

krisalyn-rojas
Télécharger la présentation

Gnutella-Based Architecture for CS179i: Using Python and Intelligent Routing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An Example Architecture for CS179ibased on Gnutella and Python Yihua He

  2. Sources • Gnutella Protocol v0.4 • Norman Matloff’s “Introduction to Threads Programming with Python” • Gnutella Developer’s Forum (GDF) • Sources available online at www.cs.ucr.edu/~yhe/cs179i • Trying to keep updated

  3. Basic Components • A Gnutella Server • Setup and maintain connection with neighbors • Routing Pings/Pongs and Querys/QueryHits • A local searching mechanism • A Gnutella Client • Customized FTP/HTTP server and client for retrieving target files.

  4. Data Structures – Neighbor Table • NeighborTable • Fields: IP, TimeStamp • Keep track of current active neighbors. Neighbors are supposed to send pings periodically in order to keep themselves active. Timeout neighbors will be deleted from NeighborTable. • RoutingHistory • FileSharingTable

  5. Data Structures – Neighbor Table • NeighborTable • Fields: IP, TimeStamp • Keep track of current active neighbors. Neighbors are supposed to send pings periodically in order to keep themselves active. Timeout neighbors will be deleted from NeighborTable. • RoutingHistory • FileSharingTable

  6. Data Structures –RoutingHistory • NeighborTable • RoutingHistory • Fields: DescriptionID, MsgType, SourceIP, Timestamp • Pong/QueryHit descriptors may only be sent back along the same path that carried the orginal Ping/Query descriptors. • To limit the size of RoutingHistory Table, entries will be deleted after a certain period of time (timeout –Soft state) • FileSharingTable

  7. Data Structures—FileSharing Table • NeighborTable • RoutingHistory • FileSharingTable • Fields: FileID, FileName, FilePath, MetaDescription, FileSize, Date and so on • Includes the files a node willing to share • In “QueryHit”, a node only sends out FileID to its peer. The peer opens a customized FTP/HTTP connection to the node and retrieve target files by FileID

  8. Main Loop Listen for new connection request“GNUTELLA CONNECT/0.4\n\n” If neighbor table full N Spawn a new thread to handle connection Y Send “GNUTELLA NOT OK\n\n”Close connection

  9. Maintain and Routing • Process descriptions accordingly: • Ping: Response with a Pong withnode’s information. Update routinghistory table, TTL-=1 and forwardPing to all neighbors if TTL>0 • Pong: Check with routing historytable and if it is in, then TTL-=1 and forward to its destination; else discard • Query: Search local file (File Sharing Table), if hit, send Query/Hit with FileID and otherinfo. Update routing history table,TTL-=1 and forward Queryto all neighbors if TTL>0 • QueryHit: Check with routinghistory table and if it is in, thenTTL-=1 and forward to itsdestination; else discard Re-check if neighbor table full Put a new entry in NeighborTable Send “GNUTELLA OK\n\n” N Y Send “GNUTELLA NOT OK\n\n”Close connectionThread ends Listen for Description Head (23 bytes) At any stage, if it timeouts or any unexpected strings are received, the entry in NeighborTable will be deleted, connection will be closed and the thread ends

More Related