10.30.06
Posted in Essays, security at 8:11 am by Paul Moceri
The openness of networks and the Internet has undoubtedly led to the success and growth of public networks. New applications and features have flourished out of the lack of strict security requirements and the anonymity offered by public networks. However, this openness has also been arguably the single greatest enabler of annoyance and malicious use of networks and the Internet. Spam, denial-of-service attacks, address spoofing, routing attacks, and a myriad of other malicious uses are, at least partially, the result of allowing unauthenticated network traffic. This leaves network applications and protocols on their own to implementing security and attack prevention. In this essay, I will argue that we need to take at a different approach: strong authentication for network traffic. Network traffic authentication will enable security and protection from applications that demand it while still allowing for innovation in network applications.
Read the rest of this entry »
Permalink
Posted in Essays, security at 8:11 am by charlie.wiseman
The ability to spoof addresses is held by many to be one of the worst problems in the current Internet. Indeed, it is often said that if only address spoofing weren’t possible then the Internet would be a better place because there would be no spam, and denial of service attacks would be easier to deal with. That is not necessarily true. Moreover, there are some legitimate ways that address spoofing is used today. In this essay, I’ll argue that the potential gain from removing the ability to spoof addresses is not enough to justify that removal.
Read the rest of this entry »
Permalink
Posted in Essays, security at 8:10 am by harri
The Internet, as we all know, was born into a friendlier world than the one it now inhabits. The merry band of academics nurturing it through its early childhood years knew and trusted one another and this spirit of sharing and openness was reflected in the Internet’s architecture. At any rate, worrying about things like authentication and abusive or malfeasant users might have distracted from more important pursuits, like getting the thing to work in the first place and perform well.
Read the rest of this entry »
Permalink
Posted in Essays, security at 8:10 am by Michael Wilson
The Security Role of Authentication
Let’s go back to security basics for a moment. Authentication is part of a system’s AAA: Authentication, Authorization, and Accountability. Think about logging on to a server: you Identify yourself by typing your user name. Then you Authenticate yourself by providing a password, proving your identity. The system Authorizes you to have access to services, such as your shell, your files, and system resources. Finally, it logs your access, to provide Accountability.
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 Essays at 4:03 pm by Niarcas
The Internet was built with the thought that the endpoints would always be static. Computers sitting on desks anywhere in the world would be able to communicate with other computers sitting on desks anywhere else in the world. With the birth of technologies, such as voice over internet protocol (VOIP), personal digital assistants (PDAs), and web-enabled cell phones it is obvious that the endpoints of the future won’t be static at all. These devices are just the beginnings of using the Internet as a core part of their functionality. In years and decades to come many more devices will hit store shelves that will use the Internet to better the lives of people everywhere by increasing information flow from and to anywhere in the world. To enable these devices to work as smoothly as possible, a lot of research is going into how to retool the Internet Protocol Suite to better allow mobile devices to send and receive data. In this paper I will look at the Internet Protocol Suite and how it is used in the current mobile solution, implemented that better facilitates dynamic end points.
Read the rest of this entry »
Permalink
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
Posted in Essays at 10:34 am by mbecchi
Wireless networks can be classified into two types: infrastructure networks and ad-hoc networks. The formers are characterized by the presence of special nodes, called access points (APs), able to communicate with mobile nodes as well as with existing wired networks. Mobile nodes, also known as mobile stations (STAs), interact in this case by communicating with the APs. On the opposite, ad hoc networks do not rely on any fixed infrastructure. Instead, nodes directly interact with each other by acting as transmitting/receiving hosts as well as network routers.
Read the rest of this entry »
Permalink
Posted in Essays at 10:33 am by BrandonHeller
The sales and capabilities of portable devices, including laptops, PDAs, and cellphones, have been steadily growing in recent years. Especially with laptops, users now desire the same resource access and quality of service as on their home network, regardless of current location. For example, a worker may want to spool a document to a printer a work. They may want access to employer-provided resources that verify identity by IP address, such as IEEE Xplore or ACM Portal. The user may want to continue downloading a video to their smartphone while walking to the local coffee shop. This user should expect a high level of security during these operations, and shouldn’t need to buy new any applications.
Read the rest of this entry »
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.15.06
Posted in Essays, security at 8:45 pm by traviskeshav
It is a general principle that the whole is more than the sum of its parts. Unfortunately, the Internet provides an apt example of where this rule holds true in an unpleasant manner; while one computer attempting to overwhelm a target with traffic may be effectively insignificant, the combination of these small burdens can mount into an overwhelming flood, causing this Distributed Denial of Service (DDoS) attack to succeed, and rendering the victim unable to service legitimate traffic. To combat such attacks, much research has been done concerning in-network defenses, leading to many new protocols and systems; however, none of these can end the DDoS threat. In fact, all of this research ignores one point – if end-systems can be secured, then attackers cannot subvert other computers to aid in their attacks, and DDoS is avoided. This should be the goal of networking specialists, rather than simply trying to create more and more intricate shells of defense. However, securing end-systems, while a theoretically simple task, proves to be quite difficult in the real world. Consequently, further possibilities and solutions must be examined, although such methods as tracebacks and CAPTCHAs prove of limited use.
Read the rest of this entry »
Permalink
Posted in Essays, security at 8:45 pm by Sailesh Kumar
ABSTRACT – Today, denial of service (DoS) attack is one of the most serious threats to the Internet. In a DoS attack, a single or a collection of attacker floods a system with more packets than it can handle, thus overloading the system and preventing the legitimate users from using it. While a naïve DoS attack may require a large number of attack hosts to bring down a system, an intelligent attacker can exploit the known vulnerabilities of a system and a network, and therefore poses a much more serious threat. DoS attacks are fundamentally difficult to defend against, as it is often difficult to discriminate a legitimate user from an attacker. Moreover, the Internet has been designed with the “open and free for all” philosophy in mind, therefore, any host connected to the Internet becomes vulnerable to misuse by any other connected host. Recently, several novel ideas have been proposed to combat DoS attacks, and in this essay I will cover some of the well known proposals.
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
Posted in Paper reviews, security at 9:33 pm by Michael Wilson
Spam, or unsolicited commercial email, is the bane of all of our mailboxes. Most current filtering technologies are based on analyzing the content, with a few based on identifying persistent sources of spam. Other research has focused on ways to address spam at the source, by creating negative incentives (E.g., micropayment systems for a “per email” cost). No previous work has undertaken a serious analysis of the network behavior of spammers.
Read the rest of this entry »
Permalink
Posted in Paper reviews, security at 9:32 pm by Sailesh Kumar
This paper suggests an interesting strategy to combat the mounting security concerns, specifically the denial of service, DoS attacks. Authors argue that the “default-on” model of the Internet provides an unparalleled flexibility and openness to the application developers and users, who can use the Internet in a wide variety of ways. However, this openness, at the same time, leaves the hosts vulnerable to unwanted and malicious traffic and therefore is the principal cause of the widespread security violations, and misuse.
Read the rest of this entry »
Permalink
Posted in Paper reviews, security at 9:32 pm by charlie.wiseman
Security is undoubtedly one of the most discussed topics in the networking field today. Primarily, this stems from the fact that many of the shortcomings of the current Internet revolve around the (lack of) security built in to the system. One of the often debated issues is the transparency of the Internet, i.e., that any host can send traffic to any destination. While it is recognized that network transparency is one of the foundations that the current success of the Internet is built on, it also opens the door for many types of attacks. In this paper, the authors argue that a change in the reachability model is needed. In particular, they propose to modify the default behavior such that the network is opaque. Then, a protocol is discussed (at a high level) that would allow hosts to tune their reachability by notifing the network of which other hosts are allowed to communicate to it. In other words, they are advocating controlled transparency on a host-by-host basis.
Read the rest of this entry »
Permalink
Posted in Paper reviews, security at 9:31 pm by Paul Moceri
Unsolicited email, or spam, continues to be a nuisance and hindrance to email users. As filtering and blocking technology progresses to mitigate spam so does the sophistication of spammers themselves. The most popular mitigation techniques in use today rely on analysis of email content and sender IP address blacklists to determine whether or not email is spam. These techniques experience mixed success in mitigating spam. They are fundamentally limited because they work as reactions to spam; spam filters learn to identify spam over time as several pieces are analyzed and tagged as spam. As a result, even the best filters experience delay in adapting to new sources and types of spam.
Read the rest of this entry »
Permalink
Posted in Paper reviews, security at 9:30 pm by harri
The Internet’s capacity for allowing any node to communicate with any other node without prior engagement is very flexible, enabling diverse modes of communication and innovation in application architectures. The corollary, though, is that any node is open for attack from any other node, enabling innovation in attack modes such as Distributed Denial of Service (DDoS), where an attacker corrals a large number of compromised nodes to attack a single node or network.This paper considers an “extreme design point” where only those packets explicitly allowed by a node are routed to it, instead of the current convention where any node can forward a packet to any other node without prior permission. The authors take great pains to explain that the paper is more of a “feasibility analysis” than a complete solution and that future interbreeding with other proposed DDoS solutions is likely.
Read the rest of this entry »
Permalink
10.08.06
Posted in Essays at 9:30 pm by BrandonHeller
An overlay network is simply one network built on top of another [1]. For example, dial-up internet is considered an overlay over the original telephone system. In recent years, a variety of applications, built as overlay networks, have gained both widespread usage and notoriety. Peer-to-peer (P2P) applications, commercial content distribution networks, research testbeds, and other systems all add custom routing functions on top of the original Internet. Overlay networks can be divided into two types, structured and unstructured, differentiated by their data-placement strategies. In structured overlays (SOs), placement of data is based on knowledge of topology, while in unstructured overlays (UOs), no knowledge of topology affects data placement.
Read the rest of this entry »
Permalink
Posted in Essays at 9:30 pm by Amy Freestone
The Internet as provided by IP allows for a reasonable amount of flexibility on the parts of applications where it provides functionality, but there are a number of functions which applications might like which are not provided by IP. Just because IP does not provide all the tools that application develops might want is no reason to completely abandon it when the additional abilities can merely be built on top of it.
Read the rest of this entry »
Permalink
Posted in Essays at 9:29 pm by nuzhet.atay
In general terms, an overlay network is a network that is built on another network. Following this definition, the Internet itself is an overlay network developed on the telephone system. Today, overlay network term is generally used to define networks working on top of the Internet and using the basic Internet infrastructure. The main motivation for introducing overlay networks is the need to obtain improved services from the Internet. These services can be provided by modifying the current Internet infrastructure, but the cost and the need for coordination of the Internet service providers all over the world make this update infeasible [1]. Moreover, new architecture proposals such as NewArch [2] do not address all of these problems. For example at NewArch, the new Internet architecture is still optimized for non-mobile end-systems, and mobility is considered as a special case. As a result, overlay networks present an alternative solution to overcome the limitations of the Internet without costly modifications. Indeed, although the lack of extensibility and flexibility of the Internet can be thought of the problems resulted from poor design choices, with the introduction of overlay networks, current architecture can be seen as the solid structure that the new generation Internet services can be built on.
Read the rest of this entry »
Permalink
10.07.06
Posted in Paper reviews, security at 7:52 am by Sailesh Kumar
Denial of Service (DoS) is an attempt to bring down a system by flooding it with requests that require a large amount of bandwidth and/or computing. In networking context, DoS is one of the most serious threats, which can overload a system and prevent legitimate users from using it. For instance, an attacker can flood a web server with many more packets than it can handle, thus overloading the server and its network link and limiting access to it. An intelligent attacker may exploit existing weaknesses in the networking protocols. For instance, the earlier generation servers had limited buffer space to handle the TCP SYN packets, which made them vulnerable to the SYN attack, in which an attacker rapidly initiates several TCP connections by sending SYN packets and later failing to respond to the reply.
Read the rest of this entry »
Permalink
Posted in Paper reviews, security at 7:51 am by Michael Wilson
This paper presents an argument against network capabilities. They note that capabilities require a means of requesting them, and that the capability request communication is vulnerable to DoS attacks. Any means of protecting the capability request communication channel could equally well protect the original traffic. Thus, capabilities are insufficient (and unnecessary) to protect against DoS attacks.
Read the rest of this entry »
Permalink
Posted in Paper reviews, security at 7:51 am by charlie.wiseman
Network capabilities have been proposed as a possible solution to denial-of-service (DoS) attacks in the Internet. The authors of this paper argue that network capabilities are, in fact, not sufficient for protecting against such attacks. The argument is essentially that the capability granting mechanisms are themselves susceptible to DoS attacks that are not preventable via capabilities (it’s a boot-strapping problem). More importantly, any mechanisms developed to hinder this type of denial-of-capability attack could be used to also defend against DoS attacks of any kind. Thus, they authors contend, capabilities are not needed. I, for one, don’t buy it.
Read the rest of this entry »
Permalink
10.06.06
Posted in Paper reviews, security at 9:39 pm by jon.turner
Understanding the Network Level Behavior of Spammers, by Anirudh Ramachandran and Nick Feamster.
Presentation by Nuzhet Atay.
Permalink
Posted in Paper reviews, routing at 8:38 pm by jon.turner
Geographic Routing Made Practical, by Young-Jin Kim, Ramesh Govindan, Brad Karp and Scott Shenker.
Presentation by Charlie Wiseman
Permalink
Posted in Paper reviews, wireless/mobility at 8:35 pm by jon.turner
A Network Architecture for Heterogeneous Mobile Computing, by Eric A. Brewer, Randy H. Katz, Elan Amir, Hari Balakrishnan, Yatin Chawathe, Armando Fox, Steven D. Gribble, Todd Hodes, Giao Nguyen, Venkata N. Padmanabhan, Mark Stemm, Srinivasan Seshan and Tom Henderson.
Presentation by Michael Roche.
Permalink
Posted in Paper reviews, wireless/mobility at 8:33 pm by jon.turner
An End-to-End Approach to Host Mobility, by
Alex C. Snoeren and Hari Balakrishnan.
Presentation by Amy Freestone.
Permalink
Posted in Paper reviews, security at 8:31 pm by jon.turner
Off by Default! by Hitesh Ballani, Yatin Chawathe, Sylvia Ratnasamy, Timothy Roscoe and Scott Shenker.
Presentation by Michela Becchi.
Permalink
Posted in Paper reviews, security at 6:40 pm by mbecchi
A sybil attack is characterized by a malicious user taking on multiple identities and pretending to be multiple nodes. Sybil attacks may therefore undermine the operation of collaborative tasks on peer-to-peer systems and other distributed systems based on the concept of majority voting (e.g.: Byzantine fault tolerance, voting schemes, etc.).
Read the rest of this entry »
Permalink
Posted in Paper reviews, security at 6:40 pm by harri
This paper describes a fully decentralized way of limiting the number of fake identities an adversary can assume in a distributed, decentralized systems. The method exploits the limited connectivity one would expect in a user-trust graph between real users and the hordes of fake identities, enabling users to establish with a high certaintiy whether other users are fake or not.
Read the rest of this entry »
Permalink
Posted in Paper reviews, security at 6:40 pm by traviskeshav
In today’s world, many users simply will not let operation of networks proceed as desired. One example of malicious behavior is sybil attacks. These sybil attacks are comprised of two steps; first, the attacker gains control of a small number of computers, while using a method such as IP address harvesting to create the appearance of a large number of nodes existing under their control. Next, the attacker uses the influence of all of these nodes to alter traffic patterns, cause data failures, and effectively do everything possible to undermine the network. Consequently, this paper being reviewed proposes a protocol called SybilGuard, where these sybil attacks can be prevented, by using the framework of real-life social networks and examining the relationships of nodes within the network. Even without knowing which nodes are malicious in advance, SybilGuard causes these nodes to be cut off from the remainder of the network, preventing further attack edges. This review will further explain methods and design principles of SybilGuard, while also briefly discussing results of evaluation, as well as discussing multiple issues and concerns I had with this paper.
Read the rest of this entry »
Permalink
10.01.06
Posted in Essays at 9:03 pm by AndrewWan
1. Abstract
Peer-to-peer and ad hoc nets have an important representation in current Internet world [1]. Their success is undeniable; however network insecurity will always remain the Achilles heel of this type of networks. Here the peer-to-peer networks will be discussed first, and briefly the focus will shift to ad hoc networks.
Read the rest of this entry »
Permalink
Posted in Essays at 9:03 pm by Paul Moceri
Internet and network users are becoming used to an on-demand lifestyle. They can already read, listen to and watch the media they want, when they want, where they want. The next step for this on-demand lifestyle will be the ability for users to be anywhere they want, whenever they want, from anywhere they want. This ability to be present and interact in a location, real or virtual, different from one’s physical location is called telepresence.
Read the rest of this entry »
Permalink