12.01.06
Posted in Paper reviews, congestion control at 8:01 pm by Paul Moceri
Streaming media applications such as real-time video and telephony continue to grow and become a large component of Internet traffic. Since such applications favor low delay over reliable transmission they often opt for the unreliable transport protocol UDP. However, UDP lacks built-in congestion control mechanisms leaving applications on their own to implement congestion control, if at all. The other alternative to UDP is TCP which provides congestion control along with reliable transmission. However, applications tend to avoid TCP because delivery guarantees can delay packets to the point that they are unusable to the application and better off dropped. Without proper congestion control, high-bandwidth streaming applications will create havoc on the Internet.
Read the rest of this entry »
Permalink
Posted in Paper reviews, congestion control at 8:00 pm by BrandonHeller
As a network application developer, you have only two realistic choices for your application’s transport layer. You could pick UDP (User Datagram Protocol), which provides unreliable, connectionless data transport, for applications where timeliness is the primary data-delivery concern. You’d be forced to implement congestion control yourself, and one bug could render the network unusable.
Read the rest of this entry »
Permalink
Posted in Paper reviews, congestion control at 7:59 pm by Michael Roche
This paper summarizes the design of Datagram Congestion Control Protocol (DCCP). DCCP is a congestion control protocol to be used with unreliable transfer protocols such as UDP. There are many applications such as streaming media or video conferencing that prefer timely data instead of reliable data. If these applications had the choice of either retransmitting a lost packet or transmitting a new packet, they would choose to transmit the new packet. By the time the old packet would arrive, it would be outdated and useless. In these cases, TCP is a poor choice because of its extra effort given to reliability.
Read the rest of this entry »
Permalink
11.25.06
Posted in Paper reviews, multicast/anycast at 9:17 am by mbecchi
Despite the fact that IP Multicast has been widely studied in the last fifteen years, none of the proposed infrastructures to implement this service model has been widely deployed and has been proven convincing. In fact, it is still under question whether the benefits implied by the introduction of IP Multicast would compensate and overreach the complexity of its deployment and management in the network level. However, the authors notice how several applications could largely benefit from an underlying multicast communication service, and how the spreading of such applications is dramatically increasing. It is the case, for instance, of multiplayer games, Internet TV technology, video conferencing, file sharing, software updates and more. Thus, the paper revisits IP multicast and proposed a novel approach, called Free Riding Multicast (FRM) for its deployment.
Read the rest of this entry »
Permalink
11.24.06
Posted in Paper reviews, multicast/anycast at 7:34 pm by Michael Roche
The authors revisit one of computer networking most studied ideas, IP Multicast. Multicast is one of the few ideas that many technical papers proposed ideas for implementation, but hardly any real world, wide-use protocols have been deployed. The complexity and scalability of the multicast idea is what has caused the difficulties. The authors argue that there are enough applications that would benefit from it and maybe we should take another look at multicast.
Read the rest of this entry »
Permalink
Posted in Paper reviews, multicast/anycast at 7:34 pm by Paul Moceri
This paper explores network anycast as an overlay system. When I typically think of anycast, I imagine IP level anycast. Traffic sent to a specific IP address is routed to the “best” of many possible hosts associated with that address. Best could mean closest or least loaded depending on the network. However, the OASIS system presented in this paper does not enable this sort of IP layer multicast. Instead, OASIS provides anycast at higher layers, in particular through the use of DNS and HTTP redirects. In this way, I was disappointed once start into the paper. OASIS, as it turns out, is more of a server selection service than IP anycast.
Read the rest of this entry »
Permalink
Posted in Paper reviews, multicast/anycast at 7:33 pm by traviskeshav
As people finally realize the threat of denial of service attacks, a trend towards distributed systems is appearing. For websites, services such as Akamai have become popular, even though they have a higher monetary cost than a company hosting their websites on their own. Services can be distributed across vast geographic areas, not only to assure that there is no one point of failure, but also to decrease latency, such that users can find replicas of services near them. OASIS implements this as a distributed anycast system, based upon geographic mapping, which also provides answers to problems inhibiting past anycast efforts.
Read the rest of this entry »
Permalink
11.20.06
Posted in Paper reviews, overlay networks at 8:33 am by jon.turner
Enabling Contribution Awareness in an Overlay Broadcasting System, by Yu-Wei Sung, Michael Bishop, and Sanjay Rao.
Presentation by Brandon Heller.
Permalink
11.17.06
Posted in Paper reviews, QoS at 10:55 pm by Sailesh Kumar
Internet QoS is one of the most comprehensively studied topics among the research community. One of the primary reasons that QoS has got such an attention is that the current Internet is unable to provide a wide range of QoS policies which are needed by several emerging real-time applications. For instance applications like VoIP, real time streaming media, etc require both bandwidth and delay guarantees. The performance of these applications can deteriorate considerably in face of bursty losses, and time varying network delays therefore it is important that the traffic from these applications are isolated from other traffic and from the time varying congestion in the network.
Read the rest of this entry »
Permalink
Posted in Paper reviews, QoS at 10:54 pm by Michael Roche
OverQoS is an overlay-based architecture for improving the best effort service of the current Internet with minimal cost. The paper describes the design, implementation, and evaluation of their architecture with very promising results. They use what they call a Controlled Loss Virtual Link (CLVL) to bind the loss rate. With this OverQoS architecture, it is able to smooth bursty packet losses, prioritize packets, and achieve loss and bandwidth guarantees. The authors demonstrate their architecture on two real-world applications, RealServer and Counterstrike.
Read the rest of this entry »
Permalink
Posted in Paper reviews, QoS at 10:54 pm by Michael Wilson
This paper describes an overlay-based architecture for providing quality of service (QoS) guarantees in the Internet. It demonstrates a prototype implementation and evaluates the prototype with real applications.
The authors correctly note that the reason why QoS schemes have failed to be adopted in the past is that they require all transit nodes along a network path to implement QoS mechanisms. This runs directly into our well-known “Internet Ossification” problem: you can’t coordinate an upgrade among all the diverse players. Therefore, the authors explore techniques for providing QoS without universal deployment by using an overlay. Effectively, they deploy a QoS scheme over some fraction of the nodes in the Internet.
Read the rest of this entry »
Permalink
Posted in Paper reviews, overlay networks at 10:54 pm by Paul Moceri
Overlay systems have become a popular means of broadcasting on the Internet. Without native support for multicast, overlays have filled the functionality gap in IP. However, as overlay broadcast systems become more popular, it is ever more clear that such systems are more and more characterized by heterogeneous clients with varying, asymmetric bandwidth. Traditional overlay broadcast systems break down under these conditions because they lack the mechanisms to cope with this varying levels of participation resulting in inefficient resource utilization and inequitable performance. This paper takes a look into extending popular overlay broadcast systems onto heterogeneous, mixed environments in a way that is both efficient and fair to users.
Read the rest of this entry »
Permalink
Posted in Paper reviews, QoS at 10:53 pm by harri
The paper proposes an overlay network using Forward Error Correction (FEC) along with retransmissions to reduce and / or shape packet losses, trading off bandwidth for lower loss rates. The intent is to improve QoS without requiring changes to existing routers, relying on overlay router nodes to implement the new functionality.
Read the rest of this entry »
Permalink
Posted in Paper reviews, overlay networks at 10:51 pm by nuzhet.atay
In this paper, the authors aim to develop a broadcasting system that can distribute content from a source to hosts while considering the heterogeneous capabilities of the hosts in the system. There are two main motivations for the paper. The first one is the requirement to handle heterogeneous properties of hosts, which is a result of the differences in the outgoing link capabilities of different hosts. The second one is the need to handle cases where not all hosts can get the content at full rate, because of the limitations on the bandwidth. For these purposes, the authors propose a system where hosts receive content at a rate in proportional to their contribution to the distribution of the content.
Read the rest of this entry »
Permalink
11.11.06
Posted in Paper reviews, routing at 9:01 am by Sailesh Kumar
Current Internet architecture has several limitations and to a large extent, these limitations stem from the structured addressing scheme used in the Internet. The Internet uses IP addresses to represent both the location as well as the identity of the nodes, and this design choice has been motivated partly by two reasons: i) when the Internet was developed, most of the participating nodes were static in location, therefore their location and identity were more or less the same, and ii) The hierarchical structured form of the IP addresses and the location information embedded within them, enables much scalable routing, and millions of addresses can be handled efficiently (the routing tables at each router remains small and easy to maintain).
Read the rest of this entry »
Permalink
11.10.06
Posted in Paper reviews, security at 9:10 pm by Michael Wilson
This paper attempts to address a specific problem in anonymous routing, that of node failure, which can lead to data loss, jitter, and even degradation attacks that reduce anonymity. This approach uses the standard technique for anonymous routing, where a path is randomly assigned by the sender through a series of overlay nodes, but substitutes a group of nodes for each single node in older approaches. This paper does not seek to improve substantially on the anonymity of prior work, but merely to provide increased resilience to network dynamics and node failures.
Read the rest of this entry »
Permalink
Posted in Paper reviews, routing at 9:10 pm by charlie.wiseman
It has been generally recognized that using IP addresses for both identity and location is not a good thing. Many proposals for separating the two exist, most often in the context of disruptive changes to the Internet. In this paper, the authors give a different view point on the problem. Instead of merely separating identity and location, they discard the notion of location entirely. More accurately, they propose a system where there is no explicit representation of location and routing is done on identity. Of course, in many ways this is similar to what is done with IP, as addresses are used for identity. The real departure from the current system is that the routing label is flat, i.e., there is no structure to the labels (identities). This challenges the long held belief that the structure of routing labels (in this case, IP addresses) allows the act of routing to be scalable, and that is really what this paper is all about.
Read the rest of this entry »
Permalink
Posted in Paper reviews, routing at 9:09 pm by traviskeshav
Rolling on the floor laughing. That’s what we normally think of when we consider the acronym ROFL. However, when we consider the current usage of IP address for both identity and location, it is no laughing matter. This current usage causes many issues, including difficulties with mobility and tenuous definitions of user identity. This paper provides a new scheme to fix this problem, entitled Routing on Flat Labels (ROFL). Location is removed entirely; instead, routing is based upon the unique, constant identifier of a user. This builds on top of DNS, requiring no new infrastructure, while making identity allocation and access controls easier to implement. The paper proceeds to demonstrate how not only is this new method beneficial, but also scalable to the Internet as a whole.
Read the rest of this entry »
Permalink
Posted in Paper reviews, security at 9:09 pm by Sailesh Kumar
This paper presents a new architecture called Cashmere, which enables anonymous routing, and provides both source anonymity and unlinkabality of source and destination. The key benefit of Cashmere overtraditional approaches is that it provides an increased resilience to node failures and node churns which generally degrades the performance of traditional anonymous routing protocols based on Chaum-Mixes. Traditionally Chaum-Mixes based routing protocols achieve anonymity by relaying the traffic through a sequence of nodes, such that any two nodes, which are not adjacent to each other along the path, are unable to identify each other. Thus, if the relayed path contains more than two nodes, then there is no way the destination can identify the source. More specifically, no downstream node can identify the upstream nodes.
Read the rest of this entry »
Permalink
Posted in Paper reviews, routing at 9:08 pm by nuzhet.atay
In the current Internet architecture, IP address is used to define both the identity and the location of a host. This causes problems in many applications including mobility, multihoming etc. The authors propose a new architecture to separate identity and location. This proposal suggests using flat labels for routing, which only defines identity. Location of a host, which defines the connection point of the host in the network, is discarded altogether. Labels are selected to be flat, meaning that they contain no semantic information. After explaining the reasons for selecting this way, the authors set their goal as designing a routing mechanism to show the feasibility of this approach.
Read the rest of this entry »
Permalink
11.09.06
Posted in Paper reviews, security at 11:27 pm by harri
The paper describes how the structure of prefix-routing DHT’s may be used to enable a source to securely send anonymous messages through a chain of intermediaries, such that each intermediary is in fact a group of nodes in the DHT. This redundancy ensures that the failure of intermediary nodes is unlikely to break an anonymity forwarding path, substantially increasing the expected lifetime of such paths, which improves reliability and performance.
Read the rest of this entry »
Permalink
11.07.06
Posted in Paper reviews, congestion control at 12:26 pm by jon.turner
Designing DCCP: Congestion Control Without Reliability, by Eddie Kohler, Mark Handley and Sally Floyd.
Permalink
Posted in Paper reviews, multicast/anycast at 12:24 pm by jon.turner
OASIS: Anycast for Any Service, by Michael J. Freedman, Karthik Lakshminarayanan and David Mazières.
Permalink
Posted in Paper reviews, multicast/anycast at 12:19 pm by jon.turner
Revisiting IP Multicast, by Sylvia Ratnasamy, Andrey Ermolinskiy and Scott Shenker.
Permalink
11.03.06
Posted in Paper reviews, network services at 11:07 pm by mbecchi
The Internet architecture was primarily intended to provide unicast communication between pairs of fixed endpoints. However, a high spectrum of applications could benefit from different communication services, like multicast and anycast, and from host mobility. The goal of this paper is to propose an overlay network introducing a level of indirection which allows an easy implementation of the above paradigms. This overlay, called i3 (Internet Indirection Infrastructure) provides a rendezvous-based communication abstraction which decouples senders from receivers.
Read the rest of this entry »
Permalink
Posted in Paper reviews, network services at 11:06 pm by BrandonHeller
Although proposals for IP mobility, multicast, and anycast have led to Internet standards, and even router implementations, these beneficial ideas have yet to see widespread deployment. These proposals prioritize application stability over network stability - reasoning that we should keep good old TCP,UDP, and everything on top of them unchanged, even if it means that we have to change every router on the internet. The distributed nature of the Internet means all ISPs, or at least a subset of the largest providers, must choose to deploy a proposal before anyone sees a benefit. Thus, deployment is the main obstacle of such proposals.
Read the rest of this entry »
Permalink
Posted in Paper reviews, naming/addressing at 11:06 pm by charlie.wiseman
The Domain Name System is yet another piece of the Internet that needs to be re-examined in the light of the current world. The design of DNS has allowed it to cope reasonably well with the massive growth of the Internet, but there are clearly problems that can’t easily be overcome just by tweaking the system. Recently, there have been a number of attempts to overcome these obstacles by designing replacements to the DNS, and this paper represents one of them. The Cooperative Domain Name System (CoDoNS) overcomes some of the problems with the legacy DNS while improving performance (latency) over DNS. It has been implemented on PlanetLab and is available for use as of this writing.
Read the rest of this entry »
Permalink
Posted in Paper reviews, network services at 11:05 pm by Niarcas
Today’s Internet was built on the architecture to provide unicast communication between stationary locations. This works great for e-mail, but what about massively-multiplayer online role-playing game like the popular World of Warcraft or broadcasting a live video to cell phones moving all over the world. Another big trend is the use of Voice Over IP on cell phones. This would require the cell phone to work as a server as well as a client. The current Internet architecture does not do a very good job at providing these anycast, multicast, broadcast and mobile services. The paper “Internet Indirection Infrastructure” proposes generalizing the Internet’s point-to-point communication in order to better provide multicast, anycast and mobility services.
Read the rest of this entry »
Permalink
Posted in Paper reviews, naming/addressing at 11:05 pm by AndrewWan
The Design and Implementation of a Next Generation Name Service for the Internet
Domain Name System (DNS) is an essential part of the Internet. The authors had come up with a new DNS architecture to reduce the problems of the legacy DNS. Even though the analysis had provided overall good reasons to demonstrate that the new architecture is better, I found some good and bad arguments from this paper.
The legacy DNS is slow by the authors’ claims, however the core functionality of DNS is for lookups and translations. In my opinion, as along as most of the popular and time sensitive websites are readily accessible through either Akamai technology or the decreasing routing time of the Internet, the slowness of the legacy DNS is well tolerable. Because the legacy DNS is like a dictionary, currently more static and we will normally use just a certain percentage of its information. With the same reason I will argue about the problem of implementation errors for the legacy DNS.
Read the rest of this entry »
Permalink
Posted in Paper reviews, naming/addressing at 11:04 pm by Michael Wilson
This paper examines the current Internet Name Service (DNS) and finds it lacking. They propose a replacement that they claim addresses the major problems, demonstrate a (currently running) implementation, and present an evaluation of it.
The current DNS architecture has long been a blemish on the Internet. In this, I whole-heartedly agree with the authors. As a general rule, any globally required, centrally deployed service is a bad idea in any system where scaling is practically unbounded. The current DNS architecture does fall into this category.
Read the rest of this entry »
Permalink
Posted in Paper reviews, network services at 11:03 pm by nuzhet.atay
This paper proposes an overlay-based Internet Indirection Infrastructure to support the communication methods including multicast, anycast and mobility other than the basic point-to-point communication abstraction. For this purpose, the authors introduce rendezvous-based communication abstraction, where packets are addressed using identifiers added at the application layer. These identifiers allow the receiver of a packet obtain it using the infrastructure (i3), while the basic IP structure is kept unmodified. Although there are several proposals aiming to provide multicast, anycast or mobility support as overlay services, this proposal stands out as it aims to provide a generic infrastructure where different services can be implemented without the need for deploying different overlay networks.
Read the rest of this entry »
Permalink
Posted in Paper reviews, naming/addressing at 11:03 pm by Michael Roche
The current Domain Name System (DNS) is extremely important to today’s Internet for the translation of hostnames to IP addresses. The authors present vulnerabilities and shortcomings with DNS and they provide the design and implementation of Cooperative Domain Name System (CoDoNS), which is a name service that is claimed to achieve higher performance and resilient to the vulnerabilities of legacy DNS. However, often the authors’ choice of wording suggests the problems with DNS are worse than reality.
Read the rest of this entry »
Permalink
10.27.06
Posted in Paper reviews, QoS, wireless/mobility at 8:35 pm by mbecchi
Quality of Service provisioning in mobile environments requires admission control and resource reservation schemes. Such mechanisms should be dynamic in order to adapt to frequent changes in user location and network cells load. In parallel, they must be scalable in the number of users and, in general, in the network size. The paper proposes a dynamic and scalable admission control scheme called Virtual Bottleneck Cell (VBC).
Read the rest of this entry »
Permalink
Posted in Paper reviews, QoS, wireless/mobility at 8:34 pm by Amy Freestone
Mobile devices are evolving to support applications for which the current best-effort packet delivery may not be sufficient. To ensure the sort of Quality-of-Service (QoS) some of these applications need, techniques not currently in use may be necessary, like admission control and resource reservation. Because scalability can be an issue with such techniques, the authors have developed a new admission control algorithm which provides scalable QoS control to mobile users.
Read the rest of this entry »
Permalink
Posted in Paper reviews, routing at 8:34 pm by BrandonHeller
In geographic routing, packets are forwarded to a neighbor node in the general physical direction of the destination, rather than forward based on an arbitrary address. This approach leads to routers whose required state scales linearly with the density of the network, independent of its size. Contrast this to most common network protocols, where an expanding network leads to an expanding amount of required state. This property has made geographic routing particularly attractive for emerging static sensor networks.
Read the rest of this entry »
Permalink
Posted in Paper reviews, routing at 8:33 pm by AndrewWan
This paper centered at the proposed Cross Link Detection Protocol (CLDP) and its practical application on static topologies. According to the authors there have been a lot research activities but no implementation in realistic environments on geographic routing. This paper presented the three kinds of pathologies of the authors’ implementation of the Greedy Perimeter Stateless Routing (GPSR) geographic routing algorithm [13]. The three pathologies are partitioned sub-graph, unidirectional link, and crossing link. By looking at the referenced paper [13] there seems to be some discrepancies in the results of these two papers (I will refer later the current paper as the CLDP paper and the referenced paper as GPSR paper). In GPSR paper within the simulation section, the authors claimed that the simulation environment offers high fidelity. The other important one is that in GPSR paper’s section 3.2 Packet Delivery Success Rate, “disconnection of a node is extremely rare in these simulations, as connectivity is dense”. However in the CLDP paper, the experiment (even though in simulation various nodes densities had been tested) had permanent delivery failures may actually be caused by less dense connectivity in addition to the reason of real radios routinely violating the unit graph assumption. In my opinion, the authors of this paper should have worked towards concluding that CLDP can be more robust for any situation and can be proved of success as well for static topologies. In Figure 21 of this paper, the drop of the success rate for GPSR was also caused by the lower probability of link connectivity.
Read the rest of this entry »
Permalink
Posted in Paper reviews, routing at 8:32 pm by nuzhet.atay
In most of the research papers on wireless ad hoc networks, fixed-radius cookie-cutter radio model for communication is assumed. This model requires that all nodes have a uniform circular communication area, and a node can send messages to another node only if that node is inside its communication region. This model is useful because it makes easy the analysis of the proposed methods. However, empirical studies have shown that the real radio model is very random and irregular which makes it considerably different than the ideal model. As a result, most proposals suffer from the ideal model assumption and cannot perform well enough with real radios to have practical applications. The authors notice that geographic routing algorithms for wireless ad hoc networks also suffer from this problem when they are implemented to use real radios, and propose a solution called CLDP that can handle irregularities imposed by real radios. They indicate that current geographic routing algorithms rely on unit graph assumption, and fail if this assumption is violated which is something almost guaranteed with real radios.
Read the rest of this entry »
Permalink
10.26.06
Posted in Paper reviews, routing at 8:02 pm by Michael Wilson
Geographic routing has long been a desirable goal in the wireless community. Unfortunately, most geographic routing schemes, while elegant in theory and simulation, don’t work in practice. Why? Because protocol designers in the wireless community persist in designing to overly simplified models of radio transmission that rely on the unit assumption. Every node has an equal transmission/reception range in a perfect sphere around the node; all links are therefore bidirectional. It just isn’t so! Obstacles, orientation, even minor radio irregularities create a situation that bears little resemblance to the ideal.
Read the rest of this entry »
Permalink
10.23.06
Posted in Paper reviews, QoS, overlay networks at 1:43 pm by jon.turner
OverQoS: An Overlay Based Architecture for Enhancing Internet QoS, by Lakshminarayanan Subramanian, Ion Stoica, Hari Balakrishnan and Randy Katz.
Presentation by Michela Becchi.
Permalink
Posted in Paper reviews, QoS at 1:37 pm by jon.turner
Quorum: Flexible Quality of Service for Internet Services, by Josep M. Blanquer, Antoni Batchelli, Klaus Schauser and Rich Wolski.
Permalink
Posted in Paper reviews, routing at 1:36 pm by jon.turner
ROFL: Routing on Flat Labels, by Matthew Caesar, Tyson Condie, Jayanthkumar Kannan, Karthik Lakshminarayanan, Ion Stoica and Scott Shenker.
Presentation by Andrew Wan.
Permalink
Posted in Paper reviews, security, routing at 1:35 pm by jon.turner
Cashmere: Resilient Anonymous Routing, by Li Zhuang, Feng Zhou, Ben Y. Zhao and Antony Rowstron.
Presentation by Travis Keshav.
Permalink
Posted in Paper reviews, network services at 1:31 pm by jon.turner
Internet Indirection Infrastructure by Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker and Sonesh Surana.
Presentation by Paul Moceri.
Permalink
10.20.06
Posted in Paper reviews, wireless/mobility at 10:20 pm by Niarcas
I’m a big proponent of moving decisions up the stack. I feel that if the decision can be made higher up the stack than it should. Why would you want to keep changing the base of your structure every time a new paradigm shift comes? You would just end up continuously changing and never move forward or you would just refuse to change because it’s too hard. There are many layers to the networking stack so that when new technologies become present a new layer can be added or top layers can be changed. This would ensure backwards compatibility, adaptability and robustness. Alex and Hari proposed this method when it came to the next wave of the Internet, the Mobile Internet.
Read the rest of this entry »
Permalink
Posted in Paper reviews, wireless/mobility at 10:19 pm by traviskeshav
As the evolution of technology continues, the size of the technology follows. Computers, originally preposterously large and fragile, have grown into desktop systems, practical for anyone at a home or office, and are now usable in laptop form, which permits their use literally anywhere. This progression has naturally proceeded through miniaturization. However, the same is not true with the Internet; original assumptions concerning mobility are no longer valid. Wireless technologies now permit users to access the Internet from far-ranging physical locations. Mobile IP was devised to allow users to move from one network to another, while maintaining their IP address; however, this assumes fixed hosts, and requires changes to the IP architecture, which is restrictive and undesirable. Consequently, a new end-to-end approach to host mobility is proposed, to permit relatively mobile hosts with improved performance, while requiring no changes to IP. This new method is flexible, additionally permitting layers such as TCP and HTTP to have information about user mobility, useful for such variables as window size. DNS is used to support dynamic updates to IP addresses, and TCP options are used to handle the process of disconnecting and reestablishing connections to hosts as users leave and join new networks.
Read the rest of this entry »
Permalink
Posted in Paper reviews, wireless/mobility at 10:18 pm by AndrewWan
This paper has provided a fairly detailed but still a higher level architecture overview of the BARWAN (Bay Area Research Wireless Access Network) project at Berkeley which had run from 1995 and 1998. I think it is an excellent job done even by today’s standard.
Read the rest of this entry »
Permalink
Posted in Paper reviews, wireless/mobility at 10:17 pm by Michael Roche
The authors Snoeren and Balakrishnan present a method for host mobility using updates to the Domain Name System (DNS) to track host location. They present an architecture as an alternative to Mobile IP in which they claim is more efficient and secure. They use a new set of TCP Migrate options in their implementation. They use modification of protocols and applications at the end host and do not have to modify the IP substrate as in Mobile IP.
Read the rest of this entry »
Permalink
10.14.06
Posted in Paper reviews, security at 8:09 am by Niarcas
Spam has been a problem since e-mail became a popular source of communication. Once people realized that they could spam many inboxes easily and get their message out about product xyz, they’ve been doing it non-stop. Many spam filters were created in the past that would filter based on content, but no one had looked at the behavior of spam at the network level. Anirudh and Nick at Georgia Tech both took on the task of looking at spam at the network level to see if the knowledge they gained could aid in bettering the spam filters of the future.
Read the rest of this entry »
Permalink
10.13.06
Posted in Paper reviews, security at 9:33 pm by BrandonHeller
The internet’s universal reachability is both a benefit… and a curse. Any host can contact any host, yet any host can attack any host. At first glance, the idea that each host must explicitly declare to the network any traffic it wishes to receive seems overly restrictive, and expensive in terms of router state. The authors of “Off by Default” do not argue that the default-off approach is optimal, but instead, attempt to understand the feasibility and costs of such an approach. Think of it as a distributed firewall, where the network, rather than just a privileged user-level program, moderates unwanted traffic.
Read the rest of this entry »
Permalink
« Previous entries ·