Discovery and Routing in the HEN Heterogeneous Peer-to-Peer Network

Size: px
Start display at page:

Download "Discovery and Routing in the HEN Heterogeneous Peer-to-Peer Network"

Transcription

1 Discovery and Routing in the HEN Heterogeneous Peer-to-Peer Network Tim Schattkowsky Paderborn University, C-LAB, D Paderborn, Germany Abstract. Network infrastructures are nowadays getting more and more complex as security considerations and technical needs like network address translation are blocking traffic and protocols in IP-based networks. Applications in such networks should transparently overcome these limitations. Examples for such applications range from simple chat clients to collaborative work environments spanning different enterprises with different heterogeneous network infrastructure and different security policies, e.g., different firewalls with different configurations. Overlay networks are a convenient way to overcome this problem. In many cases, diverse barriers like multiple facing firewalls would require significant user knowledge to establish a connection. Self-organizing peer-to-peer networks appear to be a convenient solution, but contemporary systems still have limitations in overcoming connectivity problems in heterogeneous networks. Thus, we introduce a self-organizing peer-to-peer infrastructure that overcomes these issues by transparently interconnecting networks with different protocols and address schemes. 1 Introduction The Internet led the way to new distance-spanning applications enabling communication and collaboration between distant computers and individuals. However, when trying to interconnect applications and their users in heterogeneous networks, e.g., between protected Intranets, connectivity problems arise. These problems are often caused by different network technologies and security measures. The same problem also applies to many typical end user network applications. Many interesting new applications like IP telephony clients and instant messengers suffer from the same problems (e.g., when two DSL users with routers try to interact). Current overlay networks including peer-to-peer networks cannot resolve the problem in many of the outlined scenarios, especially not when routing over multiple intermediate nodes is required. In order to overcome these problems, we introduce HEN as a self-organizing peer-to-peer network infrastructure that transparently overcomes communication barriers when possible. It establishes a peer-to-peer network interconnecting nodes in different physical networks using different transport protocols. It includes support for features like routing, relay, polling, tunnelling to overcome connectivity problems between heterogeneous networks like those caused P. Lorenz and P. Dini (Eds.): ICN 2005, LNCS 3421, pp , Springer-Verlag Berlin Heidelberg 2005

2 654 T. Schattkowsky by firewalls and network address translations. It is designed with the goal to allow the transmission of single data packets from one Node in the network to another while dealing transparently with the involved obstacles like routing and relay. The remainder of this paper is structured as follows. The next section discusses related works in the field of peer-to-peer based systems. Section 3 introduces the HEN network model. The EGG protocol used for network discovery and routing is described in section 4 before section 5 closes with conclusions and future work. 2 Related Work Many peer-to-peer systems like Napster and Gnutella seem to explicitly focus on sharing data. These networks usually are bound to an IP protocol and do not deal with heterogeneity in the underlying networks. Centralized networks like Napster overcome some of the connectivity problems by the use of centralized servers or relaying supernodes (e.g, FastTrack), but this does not solve the general problem. Other approaches like FreeNet [1] focus on anonymity at the cost of performance. Pastry [6] and Tapestry [10] are peer-to-peer architectures that both use dynamically assigned random unique identifiers to identify network nodes. Thus, named nodes are not supported at this level. Routing is performed by forwarding a message to a known node having a node identifier sharing a longer prefix with the target node identifier than the current hop. This mechanism is originally inspired by Paxton et al. (PRR) [4] [2] and is to some extent similar to RFC1518 [5]. The join protocol presented in [3] illustrates how several nodes can concurrently join such a network. As it seems that both Pastry and Tapestry target towards homogeneous IP networks without communication barriers, the routing actually introduces a significant overhead by most messages through O(log 2 #nodes) nodes where an initial discovery using the routing mechanism could also enable direct communication on the underlying network. This also generally avoids the effects of latency differences in an overlay network that is elaborated in [9]. Tapestry uses the same mechanism to locate named objects. The object identifiers in Tapestry are syntactically equal to node identifiers. For a particular object, the node with the most similar node identifier stores a reference to the node containing the object. Thus, the routing to the node can be used to discover the actual object. The root node is the root of a tree that is dynamically created by back-propagation of the object reference once messages for the object arrive at the root node. The reference will be propagated back the path to the original sender. Each node on that path will later redirect messages for the object to the actual node containing the object. However, the messages are still subject to the original routing mechanism. Other approaches like Chord [8] introduce centralized lookup services for object discovery that could be used to discover a named node. However, this does not resolve the routing problem and introduces a single point of failure. In previous work, we have introduced ANTS [7] as a peer-to-peer infrastructure for interconnecting Web Services across heterogeneous networks. However, ANTS had serious limitations in scalability. All communication was SOAP-based and thus required an application server. Furthermore, fixed relay nodes where needed. While this was sufficient for small-scale collaborative workspaces, it is not sufficient as a

3 Discovery and Routing in the HEN Heterogeneous Peer-to-Peer Network 655 general-purpose platform for network applications. Thus, we decided to completely separate the transport from the actual services and significantly extend its capabilities to a general purpose self-organzing peer-to-peer architecture for heterogeneous networks, which we called the HEterogenous Network (HEN). 3 The HEN Network Model The network model underlying HEN is shown in Figure 1. In our model, a computer in the network is a Node. Each Node is identified by a fixed location-independent NodeID. This NodeID is used by the Node when connecting to the HEN network. A real-world network enabling direct bi-directional communication between all the nodes in that network is a Network in our model. Thus, Nodes in the same Network must support exactly the same Protocol. Both are again identified by a GUID. For the Internet, these protocols are derived from the IP. In our notion, Nodes in the Internet supporting HEN Connections using the TCP Protocol form a Network among many others. It is important to notice that the same nodes may be part of other Networks as well, e.g., just by supporting an additional Protocol like HTTP. We aim at creating an overlay peer-to-peer network that contains Nodes from several different Networks. Nodes within the same Network as a Node and Nodes in Networks directly connectable by the Node are said to be local Nodes. cd Logical Model Node + NodeID: GUID + doesrelay: boolean +RelayNode * +PickupNode * * Connector + Address: String * 1 + NetworkID: GUID * 1 * directly connected * to Protocol + ProtocolID: GUID Fig. 1. Basic Network Model The ability to use certain protocols in certain real-world networks may differ from Node to Node. Thus, each Node is connected to each of these Networks using a Connector exposing its identity in that network. This Connector is a piece of software implementing the Network Protocol (e.g., TCP for the Internet). A Node residing in two networks is called a Gateway between these Networks. These Gateways are essential to routing in the HEN. Furthermore, a network maybe directly connected to another network. This implies that nodes of the originating network can act as nodes from the target network without being reachable in the target network. In practice, this means usually that these nodes are behind a router or firewall. However, this indicates also the need to establish a relay to enable direct communication between the networks. This situation is actually detected by nodes

4 656 T. Schattkowsky joining the source network and detecting a missing relay connection. These nodes act as a PickupNode by establishing a connection to a RelayNode node from the target network to enable direct communication between the networks. The node thus becomes a full member of the target Network. However, it is important to notice that it is assumed here that established connections in the underlying network are bidirectional, which is essential to both the relay mechanism and network discovery. Figure 2 shows an example model showing the communication path from A to C. This example corresponds to Figure 4, which is elaborated later in this paper. It describes how Node A can connect to Node C because it is in a protected sub-network of the Internet, use C and D as intermediate Node to have E forwarding its messages picked up from a direct connection to D to the final destination Node B. A :Node EnterpriseATCP : InternetTCP : B :Node C :Node TCP :Protocol HTTP :Protocol EnterpriseBTCP : Network EnterpriseBHTTP : InternetHTTP : E :Node +PickupNode +RelayNode D :Node Fig. 2. Communication Model Example - (Path from A to B highlighted) 4 The EGG Network Protocol The EGG protocol for network discovery and transport is responsible for all data exchange in the network. It is based on these messages: PACKET(NodeID,(byte)*) sends a packet to a local Node. The packet may be subject to routing there to reach its final destination Node. DROPPED(NodeID,Number) indicates packets dropped at a distant node.

5 Discovery and Routing in the HEN Heterogeneous Peer-to-Peer Network 657 DISCOVER(NodeID,[NetworkID,Address,timestamp](Network ID)*)to discover a certain Node. If NetworkID and Address of the Node are believed to be known, these are included. The message contains a history to avoid loops. ROUTE(NodeID,(NodeID,NetworkID,Address,timestamp)*) returns routing information to a discovering node. All Nodes in the message will share this information to enable packet transport through these Nodes. PING(id,timestamp)causes the destination node to respond with a PONG(id,timestamp)message containing the local time. This is also used to coordinate the time between nodes. DO_PING(NodeID)ask a remote Node to ping the given node results in a DO_PING_RESULT(responsetime)message containing the response time for the PING message. NEW_GATEWAY(NetworkID,NodeID,Stamp,Address)indicates the presence of a new local Gateway to the given Network. GET_GATEWAYS()causes the remote node to respond with a GATEWAYS((NetworkID,NodeID,Stamp)*)message containing a list of all known local Gateways. All messages additionally contain the NodeID of the originating Node. These messages are sent directly through the Connectors of a Node without being subject to routing. Messages may be either data packets contained in PACKET messages that are subject to routing or protocol messages. Messages are limited to a total size of 64k. During runtime, each HEN Node holds four tables that are essential for routing packets in the network. The Networks Table contains an entry for each Network ever discovered. Such an entry consists of three items, a Network and a Protocol identifier as well as a time stamp. Both identifiers are GUIDs identifying the network and the protocol to be used in the network respectively. While Protocol identifiers are most likely to be taken from the set of pre-defined identifiers including identifiers for TCP, HTTP, HTTPS and SMTP/POP3, the network identifiers are likely to be randomly created except for the Internet, which has a pre-defined identifier. The Nodes Table contains an entry for each Node in every Network ever discovered. Each entry consists of five items. The first two items are an UID for the Node and the Network. Thus, the table may contain different entries for the same Node in different Networks. The third item indicates whether the node is believed to be active or down. The remaining two items are a time stamp for the entry and a string containing the actual protocol-address of the Node in the Network. The Gateways Table stores time-stamped pairs of Network identifiers. Such a pair indicates that the first network contains a direct gateway to the second network enabling data transport from the first network to the second network. It is important to notice that the Gateways Table cannot be derived from the Nodes Table as certain Nodes may refuse to gate traffic for other Nodes although it is technically possible. The Forward Table contains pairs of NodeIDs indicating that packets send to the first Node have to be routed over the second Node.

6 658 T. Schattkowsky The time stamps in the tables are 64 bit numbers indicating the coordinated time at which the original information was created. Thus, time stamps from different nodes are comparable. By including a tolerance (i.e., a minute), time differences between the nodes can be largely ignored and items from different nodes become comparable. 4.1 Joining the Network When a Node starts up, it has to discover the existing network. Initially, it has to connect to the network at all. This is done by using a stored Nodes Table. This Nodes Tables is either initially provided somewhere (for a new node) or has been persistently stored from the when the Node was last connected. A Node has to determine its current Network if the physical address of a Node has changed since its last connection to the HEN network, the Node connects to the HEN network for the first time or it obviously has trouble to connect any Node in its current Network. The last situation indicates that the node has trouble using its underlying network connection, which may be caused by a failure or configuration change. However, to actually determine the current Network, a Node attempts to contact some of the most recently known Nodes of each Network from its Node Table that uses a protocol compatible the Node s capabilities. The order in which the Networks are tested is determined by a history of Networks the Node has been in. The Node will first attempt to locate itself in these networks, trying the most recent one first. However, later it will attempt to test all known Networks including the Internet. If the Node detects the ability to connect to a certain network, it is still necessary to test if Nodes from that Network can access the current node or are blocked (e.g., by NAT or a firewall). The Node will send a DO_PING message containing its NodeID, the currently used ProtocolID and the Node address. The remote address will attempt send a PING message to the node to test the connection and finally indicate a successful attempt where a PONG response has been received by responding with a DO_PING_RESULT message with a positive result. This indicates that the current Node is in the remote Node s Network. Otherwise, the current Node is not, but can access that network. Thus, the Node can establish a connection between these Networks. However, first the test for the current network will be completed. If the Node is not located in any of the known networks, it will use a random NetworkID. 4.2 Gateways When a Node identifies itself as a potential Gateway between Networks because it resides in both Networks, the node should publish itself as a Gateway by sending a NEW_GATEWAY message containing the NetworkID of the remote Network to some other Nodes in the same Network from its Node Table unless this is prohibited by its configuration. Upon reception of such a message, a Node will check its Gateway and Node Tables and update it with the new information. If the Gateway was already known, the message is discarded, otherwise it will be forwarded to other local Nodes. However, each Node must use the GET_GATEWAYS message first to ask a local Node if there are already enough such Gateways published. Currently, HEN Nodes only publish themselves as a Gateway when less then 16 other Gateways to the same Network are known. This avoids useless traffic in situations where actually are Nodes

7 Discovery and Routing in the HEN Heterogeneous Peer-to-Peer Network 659 in one Network could establish a Relay-Connection (e.g., this is the case for the firewall scenario). Anyway, this mechanism still currently holds back the approach as it has scalability issues especially for large networks connected to many very small networks (i.e., the internet connected to a lot of NAT users). For Sub-Networks, each Node is its own Gateway to the parent Network, but does not publish this information as this is a property of the sub-network. However, each of these nodes needs to open a persistent connection to the parent network to enable bidirectional communication. The relay node will start acting as a proxy for the original Node. Thus, no Gateway announcement is necessary as the Node is now effectively a member of the parent network. This actually avoids the broadcast problem for most real life configurations. 4.3 Discovery and Routing Routing in the HEN network is based on finding a route to the destination node based on the Nodes and Gateways Tables. These tables must contain a path to the destination Node where each hop is a Network. If no such path exists or the destination node is unknown, the HEN node will start a discovery to find such a path. Fig. 3. Discovery of a path (ACDEB) from 1234 to 8765 Discovery of a Node in a Network starts by attempting to locate that node using a variant of the PRR approach. Thus, the discovery is based on sending a DISCOVERY message that traverses the local network by moving from each Node to a Node sharing a longer prefix with the requested Node than the current Node does. If a Node has an entry for the destination Node in its Nodes Table and this entry is newer than the information contained in the DISCOVERY message (if any), it replaces this information. If the message addresses a Node in a Network containing the Node currently processing the message, it will attempt to forward the message to that Node. If this fails, all information in the DISCOVERY message is cleared. If no more Networks are reachable via Gateways, the message is discarded. Once the message arrives at the desired destination node, the node responds with a ROUTE message containing all networks passed as in the DISCOVERY message. This message travels back the path along the Gateways from the DISCOVERY messages and updates the forward table of each of the Gateways accordingly. At each Node, when a packet has to be sent its final destination address is examined. A route to this address is computed from the Nodes and Networks Tables. The next hop on this route is a Network because otherwise the message would have been delivered directly to a local Node. This Network ID is used to determine a Gateway to the Network which will be used as the next hop and the message will be transmitted. If this fails, the Gateway will be marked as down and another Gateway

8 660 T. Schattkowsky will be used. This next hop NodeID and NetworkID are cached to be directly available when the next packet for that node arrives. Figure 3 shows example with simplified NodeIDs where Node A (1234) attempts to discover Node B (8765). Node A is in an Enterprise Network with unlimited access to the Internet (i.e., NAT). All nodes within this network have established relay connection and proxies. These are not shown here, as the proxies are only involved in receiving a message, as shown for Node E which has Internet access using an HTTP proxy while Node B is in a protected enterprise network. This Node uses Node D as a relay and proxy for E, which is a Gateway like Node C. Discovery starts by moving to Node 8444 and 8721 sharing an increasing part of the destination NodeID. However, no Nodes with a longer prefix exist. Thus, the search moves through a Gateway (8721 itself) into the Internet and ends again at Here the search moves to Node D as a Getaway into EnterpriseNetB(HTTP) and end continues on E. As E is also in EnterpriseNetB(TCP), it initates the search there which finally leads to B. Node B responds by sending a ROUTE message the same path back resulting in all Nodes along the path to receive the necessary updates Fig. 4. Resulting Path from A to B for their tables to directly transport packets to B as needed. The resulting path consists of all Gateways taken and is shown in Figure 4. This situation is modelled in the communication model in Figure 2. 5 Conclusions and Future Work We have introduced HEN as a self-organizing de-centralized peer-to-peer network spanning heterogeneous networks with communication barriers. HEN demonstrates how the concept of self-organizing networks can be extended to support heterogeneous networks with multiple protocols, relay and routing. HEN has been implemented in JAVA and successfully applied to interconnect Web services in a collaborative engineering environment. Future work will include a layer 3 transport protocol implementation and detailed simulation work on the network behavior. References [1] Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In Proc. of the ICSI Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, [2] Hildrum, K., Kubiatowicz, J. D., Rao, S., Zhao, B. Y.: Distributed object location in a dynamic network. In Proc. SPAA, August 2002.

9 Discovery and Routing in the HEN Heterogeneous Peer-to-Peer Network 661 [3] Liu, H., Lam, S. S.: Consistency-preserving neighbor table optimization for p2p networks. TR-04-01, Dept. of CS, Univ. of Texas at Austin, January [4] Plaxton, C. G., Rajaraman, R., Richa, A. W. : Accessing nearby copies of replicated objects in a distributed environment. In Proc. of ACM SPAA [5] Rekhter, Y.: An architecture for IP address allocation with CIDR. RFC 1518, [6] Rowstron, A. I. T., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-topeer systems. In Proc. Middleware 2001, [7] Schattkowsky, T., Loeser, C., Müller, W.: Peer-To-Peer Technology for Interconnecting Web Services in Heterogeneous Networks. In Proc. 18th International Conference on Advanced Information Networking and Applications (AINA 2004), April [8] Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. TR-819, MIT, March [9] Zhang, H.. Goel, A., Govindan, R.: Incrementally improving lookup latency in distributed hash table systems. In Proc. of SIGMETRICS, June [10] Zhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., Kubiatowicz, J. D.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, Vol.22(No.1), January 2004.

Varalakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam

Varalakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam A Survey on P2P File Sharing Systems Using Proximity-aware interest Clustering Varalakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam

More information

A P2P SERVICE DISCOVERY STRATEGY BASED ON CONTENT

A P2P SERVICE DISCOVERY STRATEGY BASED ON CONTENT A P2P SERVICE DISCOVERY STRATEGY BASED ON CONTENT CATALOGUES Lican Huang Institute of Network & Distributed Computing, Zhejiang Sci-Tech University, No.5, St.2, Xiasha Higher Education Zone, Hangzhou,

More information

A PROXIMITY-AWARE INTEREST-CLUSTERED P2P FILE SHARING SYSTEM

A PROXIMITY-AWARE INTEREST-CLUSTERED P2P FILE SHARING SYSTEM A PROXIMITY-AWARE INTEREST-CLUSTERED P2P FILE SHARING SYSTEM Dr.S. DHANALAKSHMI 1, R. ANUPRIYA 2 1 Prof & Head, 2 Research Scholar Computer Science and Applications, Vivekanandha College of Arts and Sciences

More information

IPTV AND VOD NETWORK ARCHITECTURES. Diogo Miguel Mateus Farinha

IPTV AND VOD NETWORK ARCHITECTURES. Diogo Miguel Mateus Farinha IPTV AND VOD NETWORK ARCHITECTURES Diogo Miguel Mateus Farinha Instituto Superior Técnico Av. Rovisco Pais, 1049-001 Lisboa, Portugal E-mail: diogo.farinha@ist.utl.pt ABSTRACT IPTV and Video on Demand

More information

GISP: Global Information Sharing Protocol a distributed index for peer-to-peer systems

GISP: Global Information Sharing Protocol a distributed index for peer-to-peer systems GISP: Global Information Sharing Protocol a distributed index for peer-to-peer systems Daishi Kato Computer Science Department, Stanford University Visiting from NEC Corporation Abstract This paper proposes

More information

Decentralized Peer-to-Peer Network Architecture: Gnutella and Freenet

Decentralized Peer-to-Peer Network Architecture: Gnutella and Freenet Decentralized Peer-to-Peer Network Architecture: Gnutella and Freenet AUTHOR: Jem E. Berkes umberkes@cc.umanitoba.ca University of Manitoba Winnipeg, Manitoba Canada April 9, 2003 Introduction Although

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 349 ISSN 2229-5518

International Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 349 ISSN 2229-5518 International Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 349 Load Balancing Heterogeneous Request in DHT-based P2P Systems Mrs. Yogita A. Dalvi Dr. R. Shankar Mr. Atesh

More information

LOOKING UP DATA IN P2P SYSTEMS

LOOKING UP DATA IN P2P SYSTEMS LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica MIT Laboratory for Computer Science 1. Introduction The recent success of some widely deployed

More information

New Structured P2P Network with Dynamic Load Balancing Scheme

New Structured P2P Network with Dynamic Load Balancing Scheme New Structured P2P Network with Dynamic Load Balancing Scheme Atushi TAKEDA, Takuma OIDE and Akiko TAKAHASHI Department of Information Science, Tohoku Gakuin University Department of Information Engineering,

More information

Peer-VM: A Peer-to-Peer Network of Virtual Machines for Grid Computing

Peer-VM: A Peer-to-Peer Network of Virtual Machines for Grid Computing Peer-VM: A Peer-to-Peer Network of Virtual Machines for Grid Computing (Research Proposal) Abhishek Agrawal (aagrawal@acis.ufl.edu) Abstract This proposal discusses details about Peer-VM which is a peer-to-peer

More information

Peer-to-Peer Replication

Peer-to-Peer Replication Peer-to-Peer Replication Matthieu Weber September 13, 2002 Contents 1 Introduction 1 2 Database Replication 2 2.1 Synchronous Replication..................... 2 2.2 Asynchronous Replication....................

More information

A Self-Managing SIP-based IP Telephony System based on a P2P approach using Kademlia

A Self-Managing SIP-based IP Telephony System based on a P2P approach using Kademlia A Self-Managing SIP-based IP Telephony System based on a P2P approach using Kademlia Felipe de Castro Louback Rocha 1, Linnyer Beatriz 1 Programa de Pós Graduação em Engenharia Elétrica, Universidade Federal

More information

Distributed Hash Tables in P2P Systems - A literary survey

Distributed Hash Tables in P2P Systems - A literary survey Distributed Hash Tables in P2P Systems - A literary survey Timo Tanner Helsinki University of Technology tstanner@cc.hut.fi Abstract Distributed Hash Tables (DHT) are algorithms used in modern peer-to-peer

More information

Scaling 10Gb/s Clustering at Wire-Speed

Scaling 10Gb/s Clustering at Wire-Speed Scaling 10Gb/s Clustering at Wire-Speed InfiniBand offers cost-effective wire-speed scaling with deterministic performance Mellanox Technologies Inc. 2900 Stender Way, Santa Clara, CA 95054 Tel: 408-970-3400

More information

Object Request Reduction in Home Nodes and Load Balancing of Object Request in Hybrid Decentralized Web Caching

Object Request Reduction in Home Nodes and Load Balancing of Object Request in Hybrid Decentralized Web Caching 2012 2 nd International Conference on Information Communication and Management (ICICM 2012) IPCSIT vol. 55 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V55.5 Object Request Reduction

More information

Interoperability of Peer-To-Peer File Sharing Protocols

Interoperability of Peer-To-Peer File Sharing Protocols Interoperability of -To- File Sharing Protocols Siu Man Lui and Sai Ho Kwok -to- (P2P) file sharing software has brought a hot discussion on P2P file sharing among all businesses. Freenet, Gnutella, and

More information

Middleware and Distributed Systems. Peer-to-Peer Systems. Martin v. Löwis. Montag, 30. Januar 12

Middleware and Distributed Systems. Peer-to-Peer Systems. Martin v. Löwis. Montag, 30. Januar 12 Middleware and Distributed Systems Peer-to-Peer Systems Martin v. Löwis Peer-to-Peer Systems (P2P) Concept of a decentralized large-scale distributed system Large number of networked computers (peers)

More information

Tornado: A Capability-Aware Peer-to-Peer Storage Network

Tornado: A Capability-Aware Peer-to-Peer Storage Network Tornado: A Capability-Aware Peer-to-Peer Storage Network Hung-Chang Hsiao hsiao@pads1.cs.nthu.edu.tw Chung-Ta King* king@cs.nthu.edu.tw Department of Computer Science National Tsing Hua University Hsinchu,

More information

Network Level Multihoming and BGP Challenges

Network Level Multihoming and BGP Challenges Network Level Multihoming and BGP Challenges Li Jia Helsinki University of Technology jili@cc.hut.fi Abstract Multihoming has been traditionally employed by enterprises and ISPs to improve network connectivity.

More information

DUP: Dynamic-tree Based Update Propagation in Peer-to-Peer Networks

DUP: Dynamic-tree Based Update Propagation in Peer-to-Peer Networks : Dynamic-tree Based Update Propagation in Peer-to-Peer Networks Liangzhong Yin and Guohong Cao Department of Computer Science & Engineering The Pennsylvania State University University Park, PA 16802

More information

8 Conclusion and Future Work

8 Conclusion and Future Work 8 Conclusion and Future Work This chapter concludes this thesis and provides an outlook on future work in the area of mobile ad hoc networks and peer-to-peer overlay networks 8.1 Conclusion Due to the

More information

Decentralized supplementary services for Voice-over-IP telephony

Decentralized supplementary services for Voice-over-IP telephony Decentralized supplementary services for Voice-over-IP telephony Christoph Spleiß and Gerald Kunzmann Technische Universität München 80333 Munich, Germany {christoph.spleiss,gerald.kunzmann}@tum.de Abstract.

More information

Acknowledgements. Peer to Peer File Storage Systems. Target Uses. P2P File Systems CS 699. Serving data with inexpensive hosts:

Acknowledgements. Peer to Peer File Storage Systems. Target Uses. P2P File Systems CS 699. Serving data with inexpensive hosts: Acknowledgements Peer to Peer File Storage Systems CS 699 Some of the followings slides are borrowed from a talk by Robert Morris (MIT) 1 2 P2P File Systems Target Uses File Sharing is one of the most

More information

Are Virtualized Overlay Networks Too Much of a Good Thing?

Are Virtualized Overlay Networks Too Much of a Good Thing? Are Virtualized Overlay Networks Too Much of a Good Thing? Pete Keleher, Bobby Bhattacharjee, Bujor Silaghi Department of Computer Science University of Maryland, College Park keleher@cs.umd.edu 1 Introduction

More information

Improving Availability with Adaptive Roaming Replicas in Presence of Determined DoS Attacks

Improving Availability with Adaptive Roaming Replicas in Presence of Determined DoS Attacks Improving Availability with Adaptive Roaming Replicas in Presence of Determined DoS Attacks Chin-Tser Huang, Prasanth Kalakota, Alexander B. Alexandrov Department of Computer Science and Engineering University

More information

Research on P2P-SIP based VoIP system enhanced by UPnP technology

Research on P2P-SIP based VoIP system enhanced by UPnP technology December 2010, 17(Suppl. 2): 36 40 www.sciencedirect.com/science/journal/10058885 The Journal of China Universities of Posts and Telecommunications http://www.jcupt.com Research on P2P-SIP based VoIP system

More information

Performance Issues of P2P File Sharing Over Asymmetric and Wireless Networks

Performance Issues of P2P File Sharing Over Asymmetric and Wireless Networks Performance Issues of P2P File Sharing Over Asymmetric and Wireless Networks Yao-Nan Lien Computer Science Department National Chengchi University Taipei, Taiwan lien@cs.nccu.edu.tw Abstract Some Peer-to-Peer

More information

Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities

Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities Kavitha Ranganathan, Adriana Iamnitchi, Ian Foster Department of Computer Science, The University

More information

Calto: A Self Sufficient Presence System for Autonomous Networks

Calto: A Self Sufficient Presence System for Autonomous Networks Calto: A Self Sufficient Presence System for Autonomous Networks Abstract In recent years much attention has been paid to spontaneously formed Ad Hoc networks. These networks can be formed without central

More information

Department of Computer Science Institute for System Architecture, Chair for Computer Networks. File Sharing

Department of Computer Science Institute for System Architecture, Chair for Computer Networks. File Sharing Department of Computer Science Institute for System Architecture, Chair for Computer Networks File Sharing What is file sharing? File sharing is the practice of making files available for other users to

More information

Definition. A Historical Example

Definition. A Historical Example Overlay Networks This lecture contains slides created by Ion Stoica (UC Berkeley). Slides used with permission from author. All rights remain with author. Definition Network defines addressing, routing,

More information

A Topology-Aware Relay Lookup Scheme for P2P VoIP System

A Topology-Aware Relay Lookup Scheme for P2P VoIP System Int. J. Communications, Network and System Sciences, 2010, 3, 119-125 doi:10.4236/ijcns.2010.32018 Published Online February 2010 (http://www.scirp.org/journal/ijcns/). A Topology-Aware Relay Lookup Scheme

More information

Krunal Patel Department of Information Technology A.D.I.T. Engineering College (G.T.U.) India. Fig. 1 P2P Network

Krunal Patel Department of Information Technology A.D.I.T. Engineering College (G.T.U.) India. Fig. 1 P2P Network Volume 3, Issue 7, July 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Secure Peer-to-Peer

More information

Exploring the Design Space of Distributed and Peer-to-Peer Systems: Comparing the Web, TRIAD, and Chord/CFS

Exploring the Design Space of Distributed and Peer-to-Peer Systems: Comparing the Web, TRIAD, and Chord/CFS Exploring the Design Space of Distributed and Peer-to-Peer Systems: Comparing the Web, TRIAD, and Chord/CFS Stefan Saroiu, P. Krishna Gummadi, Steven D. Gribble University of Washington Abstract: Despite

More information

A Network Monitoring System with a Peer-to-Peer Architecture

A Network Monitoring System with a Peer-to-Peer Architecture A Network Monitoring System with a Peer-to-Peer Architecture Paulo Salvador, Rui Valadas University of Aveiro / Institute of Telecommunications Aveiro E-mail: salvador@av.it.pt; rv@det.ua.pt Abstract The

More information

Experimental Comparison of Routing and Middleware Solutions for Mobile Ad Hoc Networks: Legacy vs Cross-Layer Approach

Experimental Comparison of Routing and Middleware Solutions for Mobile Ad Hoc Networks: Legacy vs Cross-Layer Approach Experimental Comparison of Routing and Middleware Solutions for Mobile Ad Hoc Networks: Legacy vs Cross-Layer Approach E. Borgia, M. Conti, F.Delmastro, and E. Gregori Pervasive Computing & Networking

More information

From the previous lecture

From the previous lecture CS 640: Introduction to Computer Networks Aditya Akella Lecture 7 - IP: Addressing and Forwarding From the previous lecture We will cover spanning tree from the last lecture 2 Spanning Tree Bridges More

More information

File sharing using IP-Multicast

File sharing using IP-Multicast File sharing using IP-Multicast Kai Trojahner, Peter Sobe University of Luebeck, Germany Institute of Computer Engineering email: sobe@iti.uni-luebeck.de Abstract: File sharing systems cause a huge portion

More information

P2P Storage Systems. Prof. Chun-Hsin Wu Dept. Computer Science & Info. Eng. National University of Kaohsiung

P2P Storage Systems. Prof. Chun-Hsin Wu Dept. Computer Science & Info. Eng. National University of Kaohsiung P2P Storage Systems Prof. Chun-Hsin Wu Dept. Computer Science & Info. Eng. National University of Kaohsiung Outline Introduction Distributed file systems P2P file-swapping systems P2P storage systems Strengths

More information

Tomás P. de Miguel DIT-UPM. dit UPM

Tomás P. de Miguel DIT-UPM. dit UPM Tomás P. de Miguel DIT- 15 12 Internet Mobile Market Phone.com 15 12 in Millions 9 6 3 9 6 3 0 1996 1997 1998 1999 2000 2001 0 Wireless Internet E-mail subscribers 2 (January 2001) Mobility The ability

More information

Communications and Networking

Communications and Networking Communications and Networking History and Background telephone system local area networks Internet architecture: what the pieces are and how they fit together names and addresses: what's your name and

More information

Identity Theft Protection in Structured Overlays

Identity Theft Protection in Structured Overlays Identity Theft Protection in Structured Overlays Lakshmi Ganesh and Ben Y. Zhao Computer Science Department, U. C. Santa Barbara {lakshmi, ravenben}@cs.ucsb.edu Abstract Structured peer-to-peer (P2P) overlays

More information

Applying ID-Based Encryption to Anonymous Communication

Applying ID-Based Encryption to Anonymous Communication ID 466-8555 DHT ID Applying ID-Based Encryption to Anonymous Communication Hiroyuki Tanaka Shoichi Saito Hiroshi Matsuo Nagoya Institute of Technology Gokiso-cho Showa-ku Nagoya-shi Aichi 466-8555 Japan

More information

A Performance Comparison of Native IP Multicast and IP Multicast Tunneled through a Peer-to-Peer Overlay Network

A Performance Comparison of Native IP Multicast and IP Multicast Tunneled through a Peer-to-Peer Overlay Network A Performance Comparison of Native IP Multicast and IP Multicast Tunneled through a Peer-to-Peer Overlay Network Marc Brogle, Dragan Milic, Luca Bettosini, Torsten Braun Institute for Computer Science

More information

Object Tracking System for Mobile Terminals: Architecture, Protocol and Its Evaluation

Object Tracking System for Mobile Terminals: Architecture, Protocol and Its Evaluation Object Tracking System for Mobile Terminals: Architecture, Protocol and Its Evaluation Location Tracking System Architecture Sensor System Object Tracking System for Mobile Terminals: Architecture, Protocol

More information

Wireless Sensor Networks Chapter 3: Network architecture

Wireless Sensor Networks Chapter 3: Network architecture Wireless Sensor Networks Chapter 3: Network architecture António Grilo Courtesy: Holger Karl, UPB Goals of this chapter Having looked at the individual nodes in the previous chapter, we look at general

More information

Identity Theft Protection in Structured Overlays

Identity Theft Protection in Structured Overlays Appears in Proceedings of the 1st Workshop on Secure Network Protocols (NPSec 5) Identity Theft Protection in Structured Overlays Lakshmi Ganesh and Ben Y. Zhao Computer Science Department, U. C. Santa

More information

2. IP Networks, IP Hosts and IP Ports

2. IP Networks, IP Hosts and IP Ports 1. Introduction to IP... 1 2. IP Networks, IP Hosts and IP Ports... 1 3. IP Packet Structure... 2 4. IP Address Structure... 2 Network Portion... 2 Host Portion... 3 Global vs. Private IP Addresses...3

More information

P.Brighten Godfrey, Scott Shenker, and Ion Stoica. Computer Science Division. -Anjali Sridhar CS598 Brighten Godfrey

P.Brighten Godfrey, Scott Shenker, and Ion Stoica. Computer Science Division. -Anjali Sridhar CS598 Brighten Godfrey P.Brighten Godfrey, Scott Shenker, and Ion Stoica UC Berkeley Computer Science Division -Anjali Sridhar CS598 Brighten Godfrey Peer to Peer Networks Churn and Overlay Networks Motivation to reduce churn

More information

Quality of Service Routing Network and Performance Evaluation*

Quality of Service Routing Network and Performance Evaluation* Quality of Service Routing Network and Performance Evaluation* Shen Lin, Cui Yong, Xu Ming-wei, and Xu Ke Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 {shenlin, cy, xmw,

More information

Multicast vs. P2P for content distribution

Multicast vs. P2P for content distribution Multicast vs. P2P for content distribution Abstract Many different service architectures, ranging from centralized client-server to fully distributed are available in today s world for Content Distribution

More information

An Introduction to Peer-to-Peer Networks

An Introduction to Peer-to-Peer Networks An Introduction to Peer-to-Peer Networks Presentation for MIE456 - Information Systems Infrastructure II Vinod Muthusamy October 30, 2003 Agenda Overview of P2P Characteristics Benefits Unstructured P2P

More information

William Stallings Data and Computer Communications. Chapter 15 Internetwork Protocols

William Stallings Data and Computer Communications. Chapter 15 Internetwork Protocols William Stallings Data and Computer Communications Chapter 15 Internetwork Protocols Internetworking Terms (1) Communications Network Facility that provides data transfer service An internet Collection

More information

LOAD BALANCING FOR OPTIMAL SHARING OF NETWORK BANDWIDTH

LOAD BALANCING FOR OPTIMAL SHARING OF NETWORK BANDWIDTH LOAD BALANCING FOR OPTIMAL SHARING OF NETWORK BANDWIDTH S.Hilda Thabitha 1, S.Pallavi 2, P.Jesu Jayarin 3 1 PG Scholar,,Dept of CSE,Jeppiaar Engineering College,Chennai, 2 Research Scholar,Sathyabama University,Chennai-119.

More information

Best Practices for Controlling Skype within the Enterprise. Whitepaper

Best Practices for Controlling Skype within the Enterprise. Whitepaper Best Practices for Controlling Skype within the Enterprise Whitepaper INTRODUCTION Skype (rhymes with ripe ) is a proprietary peer-to-peer (P2P) voice over Internet protocol (VoIP) network, founded by

More information

Computer Networking Networks

Computer Networking Networks Page 1 of 8 Computer Networking Networks 9.1 Local area network A local area network (LAN) is a network that connects computers and devices in a limited geographical area such as a home, school, office

More information

David R. McIntyre CS Department, Cleveland State University Cleveland, Ohio 44101

David R. McIntyre CS Department, Cleveland State University Cleveland, Ohio 44101 Data Distribution in a Wireless Environment with Migrating Nodes David A. Johnston EECS Department, Case Western Reserve University Cleveland, Ohio 44106 David R. McIntyre CS Department, Cleveland State

More information

Quantitative Analysis of 2-tier P2P- SIP Architecture with ID-based Signature

Quantitative Analysis of 2-tier P2P- SIP Architecture with ID-based Signature A Thesis for the degree of Master Quantitative Analysis of 2-tier P2P- SIP Architecture with ID-based Signature Chang-Hwan Lee School of Engineering Information and Communications University 2008 i Quantitative

More information

Join and Leave in Peer-to-Peer Systems: The DASIS Approach

Join and Leave in Peer-to-Peer Systems: The DASIS Approach Join and Leave in Peer-to-Peer Systems: The DASIS Approach Keno Albrecht, Ruedi Arnold, Michael Gähwiler, Roger Wattenhofer {kenoa@inf, rarnold@inf, mgaehwil@student, wattenhofer@inf}.ethz.ch Department

More information

Proxy Server, Network Address Translator, Firewall. Proxy Server

Proxy Server, Network Address Translator, Firewall. Proxy Server Proxy Server, Network Address Translator, Firewall 1 Proxy Server 2 1 Introduction What is a proxy server? Acts on behalf of other clients, and presents requests from other clients to a server. Acts as

More information

Load Balancing in Structured P2P Systems

Load Balancing in Structured P2P Systems 1 Load Balancing in Structured P2P Systems Ananth Rao Karthik Lakshminarayanan Sonesh Surana Richard Karp Ion Stoica ananthar, karthik, sonesh, karp, istoica @cs.berkeley.edu Abstract Most P2P systems

More information

A NOVEL RESOURCE EFFICIENT DMMS APPROACH

A NOVEL RESOURCE EFFICIENT DMMS APPROACH A NOVEL RESOURCE EFFICIENT DMMS APPROACH FOR NETWORK MONITORING AND CONTROLLING FUNCTIONS Golam R. Khan 1, Sharmistha Khan 2, Dhadesugoor R. Vaman 3, and Suxia Cui 4 Department of Electrical and Computer

More information

PAST: A large-scale, persistent peer-to-peer storage utility

PAST: A large-scale, persistent peer-to-peer storage utility PAST: A large-scale, persistent peer-to-peer storage utility Peter Druschel Rice University, Houston, TX 77005, USA druschel@cs.rice.edu Antony Rowstron Microsoft Research, Cambridge, CB2 3NH, UK antr@microsoft.com

More information

Efficient Distributed Reputation Scheme for Peer-to-Peer Systems

Efficient Distributed Reputation Scheme for Peer-to-Peer Systems Efficient Distributed Reputation Scheme for Peer-to-Peer Systems Chu Yee Liau, Xuan Zhou, Stéphane Bressan, and Kian-Lee Tan Department of Computer Science, National University of Singapore {liaucy,zhouxuan,steph,tankl}@comp.nus.edu.sg

More information

The Role and uses of Peer-to-Peer in file-sharing. Computer Communication & Distributed Systems EDA 390

The Role and uses of Peer-to-Peer in file-sharing. Computer Communication & Distributed Systems EDA 390 The Role and uses of Peer-to-Peer in file-sharing Computer Communication & Distributed Systems EDA 390 Jenny Bengtsson Prarthanaa Khokar jenben@dtek.chalmers.se prarthan@dtek.chalmers.se Gothenburg, May

More information

Introduction to IP v6

Introduction to IP v6 IP v 1-3: defined and replaced Introduction to IP v6 IP v4 - current version; 20 years old IP v5 - streams protocol IP v6 - replacement for IP v4 During developments it was called IPng - Next Generation

More information

VXLAN: Scaling Data Center Capacity. White Paper

VXLAN: Scaling Data Center Capacity. White Paper VXLAN: Scaling Data Center Capacity White Paper Virtual Extensible LAN (VXLAN) Overview This document provides an overview of how VXLAN works. It also provides criteria to help determine when and where

More information

Mobile File-Sharing over P2P Networks

Mobile File-Sharing over P2P Networks Category: P2P obile File-Sharing over P2P Networks Lu Yan Åbo Akademi, Finland INTRODUCTION Peer-to-peer (P2P) computing is a networking and distributed computing paradigm which allows the sharing of computing

More information

Anonymous Communication in Peer-to-Peer Networks for Providing more Privacy and Security

Anonymous Communication in Peer-to-Peer Networks for Providing more Privacy and Security Anonymous Communication in Peer-to-Peer Networks for Providing more Privacy and Security Ehsan Saboori and Shahriar Mohammadi Abstract One of the most important issues in peer-to-peer networks is anonymity.

More information

Superior Disaster Recovery with Radware s Global Server Load Balancing (GSLB) Solution

Superior Disaster Recovery with Radware s Global Server Load Balancing (GSLB) Solution Superior Disaster Recovery with Radware s Global Server Load Balancing (GSLB) Solution White Paper January 2012 Radware GSLB Solution White Paper Page 1 Table of Contents 1. EXECUTIVE SUMMARY... 3 2. GLOBAL

More information

Load Balancing in Structured Overlay Networks. Tallat M. Shafaat tallat(@)kth.se

Load Balancing in Structured Overlay Networks. Tallat M. Shafaat tallat(@)kth.se Load Balancing in Structured Overlay Networks Tallat M. Shafaat tallat(@)kth.se Overview Background The problem : load imbalance Causes of load imbalance Solutions But first, some slides from previous

More information

Borg: a Hybrid Protocol for Scalable Application-level Multicast in Peer-to-Peer Networks

Borg: a Hybrid Protocol for Scalable Application-level Multicast in Peer-to-Peer Networks Borg: a Hybrid Protocol for Scalable Application-level Multicast in Peer-to-Peer Networks Rongmei Zhang and Y. Charlie Hu School of Electrical and Computer Engineering Purdue University West Lafayette,

More information

Towards a scalable ad hoc network infrastructure

Towards a scalable ad hoc network infrastructure Towards a scalable ad hoc network infrastructure Ansley Post abpost@rice.edu Rice University, Houston, TX, USA Abstract As wirelessly networked devices become more pervasive, large scale mobile ad hoc

More information

Availability Digest. www.availabilitydigest.com. Redundant Load Balancing for High Availability July 2013

Availability Digest. www.availabilitydigest.com. Redundant Load Balancing for High Availability July 2013 the Availability Digest Redundant Load Balancing for High Availability July 2013 A large data center can comprise hundreds or thousands of servers. These servers must not only be interconnected, but they

More information

A Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks

A Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks 1 A Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks Hasan Sözer, Metin Tekkalmaz, and İbrahim Körpeoğlu Abstract File sharing in wireless ad-hoc networks in a peerto-peer manner imposes many

More information

architecture: what the pieces are and how they fit together names and addresses: what's your name and number?

architecture: what the pieces are and how they fit together names and addresses: what's your name and number? Communications and networking history and background telephone system local area networks Internet architecture: what the pieces are and how they fit together names and addresses: what's your name and

More information

Skype characteristics

Skype characteristics Advanced Networking Skype Renato Lo Cigno Credits for part of the original material to Saverio Niccolini NEC Heidelberg Skype characteristics Skype is a well known P2P program for real time communications

More information

A Catechistic Method for Traffic Pattern Discovery in MANET

A Catechistic Method for Traffic Pattern Discovery in MANET A Catechistic Method for Traffic Pattern Discovery in MANET R. Saranya 1, R. Santhosh 2 1 PG Scholar, Computer Science and Engineering, Karpagam University, Coimbatore. 2 Assistant Professor, Computer

More information

Mobility (and philosophical questions about names and identity) David Andersen CMU CS 15-744. The problem

Mobility (and philosophical questions about names and identity) David Andersen CMU CS 15-744. The problem Mobility (and philosophical questions about names and identity) David Andersen CMU CS 15-744 The problem How to support mobile users What do we mean by support? Make it easy and convenient to effectively

More information

PEER-TO-PEER DISTRIBUTED LOOKUP SERVICES

PEER-TO-PEER DISTRIBUTED LOOKUP SERVICES PEER-TO-PEER DISTRIBUTED LOOKUP SERVICES ABSTRACT As we are living in the era of technology innovation, the need of sharing information is becoming more important than ever. Peer-to-peer applications were

More information

8.2 The Internet Protocol

8.2 The Internet Protocol TCP/IP Protocol Suite HTTP SMTP DNS RTP Distributed applications Reliable stream service TCP UDP User datagram service Best-effort connectionless packet transfer Network Interface 1 IP Network Interface

More information

SCALABLE RANGE QUERY PROCESSING FOR LARGE-SCALE DISTRIBUTED DATABASE APPLICATIONS *

SCALABLE RANGE QUERY PROCESSING FOR LARGE-SCALE DISTRIBUTED DATABASE APPLICATIONS * SCALABLE RANGE QUERY PROCESSING FOR LARGE-SCALE DISTRIBUTED DATABASE APPLICATIONS * Maha Abdallah LIP6, Université Paris 6, rue du Capitaine Scott 75015 Paris, France Maha.Abdallah@lip6.fr Hung Cuong Le

More information

Chapter 7. Address Translation

Chapter 7. Address Translation Chapter 7. Address Translation This chapter describes NetDefendOS address translation capabilities. Dynamic Network Address Translation, page 204 NAT Pools, page 207 Static Address Translation, page 210

More information

Motivation for peer-to-peer

Motivation for peer-to-peer Peer-to-peer systems INF 5040 autumn 2007 lecturer: Roman Vitenberg INF5040, Frank Eliassen & Roman Vitenberg 1 Motivation for peer-to-peer Inherent restrictions of the standard client/server model Centralised

More information

Enterprise VoIP Services over Mobile Ad-Hoc Technologies

Enterprise VoIP Services over Mobile Ad-Hoc Technologies Enterprise VoIP Services over Mobile Ad-Hoc Technologies 1 System Architecture Figure 1 illustrates the system architecture. We can divide it into 2 parts. One is the Mobile VoIP Box (MVB) node and the

More information

Single Pass Load Balancing with Session Persistence in IPv6 Network. C. J. (Charlie) Liu Network Operations Charter Communications

Single Pass Load Balancing with Session Persistence in IPv6 Network. C. J. (Charlie) Liu Network Operations Charter Communications Single Pass Load Balancing with Session Persistence in IPv6 Network C. J. (Charlie) Liu Network Operations Charter Communications Load Balancer Today o Load balancing is still in use today. It is now considered

More information

Internetworking. Problem: There is more than one network (heterogeneity & scale)

Internetworking. Problem: There is more than one network (heterogeneity & scale) Internetworking Problem: There is more than one network (heterogeneity & scale) Hongwei Zhang http://www.cs.wayne.edu/~hzhang Internetworking: Internet Protocol (IP) Routing and scalability Group Communication

More information

OVERLAYING VIRTUALIZED LAYER 2 NETWORKS OVER LAYER 3 NETWORKS

OVERLAYING VIRTUALIZED LAYER 2 NETWORKS OVER LAYER 3 NETWORKS OVERLAYING VIRTUALIZED LAYER 2 NETWORKS OVER LAYER 3 NETWORKS Matt Eclavea (meclavea@brocade.com) Senior Solutions Architect, Brocade Communications Inc. Jim Allen (jallen@llnw.com) Senior Architect, Limelight

More information

Attacks Against Peer-to-peer Networks and Countermeasures

Attacks Against Peer-to-peer Networks and Countermeasures Attacks Against Peer-to-peer Networks and Countermeasures Lin Wang Helsinki University of Technology lwang@cc.hut.fi Abstract Peer-to-peer (P2P) networks have many distinct aspects that are different from

More information

A NEW FULLY DECENTRALIZED SCALABLE PEER-TO-PEER GIS ARCHITECTURE

A NEW FULLY DECENTRALIZED SCALABLE PEER-TO-PEER GIS ARCHITECTURE A NEW FULLY DECENTRALIZED SCALABLE PEER-TO-PEER GIS ARCHITECTURE S.H.L. Liang Department of Geomatics Engineering, University of Calgary, Calgary, Alberta, CANADA T2N 1N4 steve.liang@ucalgary.ca Commission

More information

How To Understand and Configure Your Network for IntraVUE

How To Understand and Configure Your Network for IntraVUE How To Understand and Configure Your Network for IntraVUE Summary This document attempts to standardize the methods used to configure Intrauve in situations where there is little or no understanding of

More information

Hybrid Overlay Multicast Framework draft-irtf-sam-hybrid-overlay-framework-01.txt. John Buford, Avaya Labs Research

Hybrid Overlay Multicast Framework draft-irtf-sam-hybrid-overlay-framework-01.txt. John Buford, Avaya Labs Research Hybrid Overlay Multicast Framework draft-irtf-sam-hybrid-overlay-framework-01.txt John Buford, Avaya Labs Research Topics SAM Charter Recap and Problem Statement AMT(Automatic Multicast Tunneling) Overview

More information

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks David B. Johnson David A. Maltz Josh Broch Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213-3891

More information

Locality-Aware Randomized Load Balancing Algorithms for DHT Networks

Locality-Aware Randomized Load Balancing Algorithms for DHT Networks Locality-Aware ized Load Balancing Algorithms for DHT Networks Haiying Shen and Cheng-Zhong Xu Department of Electrical & Computer Engineering Wayne State University, Detroit, MI 4822 {shy,czxu}@ece.eng.wayne.edu

More information

Stability of QOS. Avinash Varadarajan, Subhransu Maji {avinash,smaji}@cs.berkeley.edu

Stability of QOS. Avinash Varadarajan, Subhransu Maji {avinash,smaji}@cs.berkeley.edu Stability of QOS Avinash Varadarajan, Subhransu Maji {avinash,smaji}@cs.berkeley.edu Abstract Given a choice between two services, rest of the things being equal, it is natural to prefer the one with more

More information

Chord - A Distributed Hash Table

Chord - A Distributed Hash Table Kurt Tutschku Vertretung - Professur Rechnernetze und verteilte Systeme Chord - A Distributed Hash Table Outline Lookup problem in Peer-to-Peer systems and Solutions Chord Algorithm Consistent Hashing

More information

Deploying IPv6, Now. Christian Huitema. Architect Windows Networking & Communications Microsoft Corporation

Deploying IPv6, Now. Christian Huitema. Architect Windows Networking & Communications Microsoft Corporation Deploying IPv6, Now Christian Huitema Architect Windows Networking & Communications Microsoft Corporation Agenda The Opportunity Key Problems The Promise of IPv6 What is Microsoft doing Call to Action

More information

Oracle Net Services for Oracle10g. An Oracle White Paper May 2005

Oracle Net Services for Oracle10g. An Oracle White Paper May 2005 Oracle Net Services for Oracle10g An Oracle White Paper May 2005 Oracle Net Services INTRODUCTION Oracle Database 10g is the first database designed for enterprise grid computing, the most flexible and

More information

Efficient Search in Gnutella-like Small-World Peerto-Peer

Efficient Search in Gnutella-like Small-World Peerto-Peer Efficient Search in Gnutella-like Small-World Peerto-Peer Systems * Dongsheng Li, Xicheng Lu, Yijie Wang, Nong Xiao School of Computer, National University of Defense Technology, 410073 Changsha, China

More information

Approximate Object Location and Spam Filtering on Peer-to-Peer Systems

Approximate Object Location and Spam Filtering on Peer-to-Peer Systems Approximate Object Location and Spam Filtering on Peer-to-Peer Systems Feng Zhou, Li Zhuang, Ben Y. Zhao, Ling Huang, Anthony D. Joseph and John D. Kubiatowicz University of California, Berkeley The Problem

More information