Web Protocols - IT Library : ZDNet Asia

Case Studies

Vendor Webcast

Show all content

Title Date Added Company

IPv6 Usage With Various Operating Systems 2007-09-01 Dell

In a nutshell, IPv6 (Internet Protocol version 6) is the successor to the most common Internet Protocol today (IPv4). This is largely driven by the fact that IPv4's 32-bit address is quickly being consumed by the ever-expanding sites and products on the internet. IPv6's 128-bit address space should not have this problem for the foreseeable future. Additionally, the industry expects the US Federal government to start requiring IPsec (IP security) as part of the IPv6 requirements after June 30th 2008 in their RFQs for most products.

Route Fragility: A Novel Metric for Route Selection in Mobile Ad Hoc Networks 0000-00-00 Rensselaer Polytechnic Institute

A key factor deciding the performance of a routing protocol in mobile ad hoc networks is the manner in which it adapts to route changes caused by mobility. Exploiting the intuition that a less dynamic route lasts longer, this paper proposes a new metric, the Route Fragility Coefficient (RFC), to compare routes. RFC estimates the rate at which a given route expands or contracts. Expansion refers to adjacent nodes moving apart, while contraction refers to their moving closer. RFC combines the individual link contraction or expansion behavior to present a unified picture of the route dynamics. The paper demonstrates that lower the value of RFC, more static (less fragile) the route.

Tags: Software Engineering,

Self-Configurable Key Pre-Distribution in Mobile Ad Hoc Networks 0000-00-00 University of California

This paper presents two new schemes that, in the absence of a centralized support, allow a pair of nodes of a mobile ad hoc network to compute a shared key without communicating. Such a service is important to secure routing protocols. The schemes are built using the well-known technique of threshold secret sharing and are secure against a collusion of up to a certain number of nodes. The paper evaluates and compares the performance of both the schemes in terms of the node admission and pairwise key establishment costs.

Tags:

COCOON: An Alternative Approach to End-Point Congestion Management 2006-12-13 01:00:24 Alcatel-Lucent

This paper proposes an alternate endpoint congestion management scheme, called COordinated COngestion cONtrol (COCOON). The basic idea is to identify and group connections that may traverse the same backbone link, to enable them to share congestion information, and to coordinate among them all the congestion avoidance/control activities. The size of a COCOON group can be dynamically adjusted so as to magnify the benefits of end-host congestion management. COCOON also allows a new connection to commerce with a congestion window that is large enough to catch up with other connections while not inducing congestion. Finally, COCOON takes into account non-responsive UDP connections and "Bundles" them into a virtual connection that is subject to TCP-like congestion control.

Authenticity by Typing for Security Protocols 2006-12-09 01:00:18 Microsoft

This paper proposes a new method to check authenticity properties of cryptographic protocols. First, code up the protocol in the spi-calculus of Abadi and Gordon. Second, specify authenticity properties by annotating the code with correspondence assertions in the style of Woo and Lam. Third, figure out types for the keys, nonces, and messages of the protocol. Fourth, check that the spi-calculus code is well-typed according to a novel type and effect system presented in this paper. The main theorem guarantees that any well-typed protocol is robustly safe, that is, its correspondence assertions are true in the presence of any opponent expressible in spi.

Types and Effects for Asymmetric Cryptographic Protocols 2006-12-09 01:00:18 Microsoft

This paper presents the first type and effect system for proving authenticity properties of security protocols based on asymmetric cryptography. The most significant new features of the type system are - a separation of public types (for data possibly sent to the opponent) from tainted types (for data possibly received from the opponent) via a subtype relation; trust effects, to guarantee that tainted data does not, in fact, originate from the opponent; and challenge/ response types to support a variety of idioms used to guarantee message freshness. The paper illustrates the applicability of the system via protocol examples.

Timed Spi-Calculus With Types for Secrecy and Authenticity 2006-12-07 01:00:20 Alcatel-Lucent

This paper presents a discretely timed spi-calculus. A primitive for key compromise allows to model key compromise attacks, thus going beyond the standard Dolev-Yao attacker model. A primitive for reading a global clock allows the authors to express protocols based on timestamps, which are common in practice. The authors accompany the timed spi-calculus with a type system, prove that well-typed protocols are robustly safe for secrecy and authenticity and present examples of well-typed protocols as well as an example where failure to typecheck reveals a (well-known) flaw.

How Does Ping Really Work? 2006-10-01 Global Knowledge

Ping is an Internet program that most of us use daily, but do you know how it really works? Gain an understanding of the cycle of processing associated with ping.

Domain Name System Client Behavior in Windows Vista 2006-12-06 01:00:24 Microsoft

Microsoft Windows Vista includes both Internet Protocol version 4 (IPv4) and Internet Protocol version 6 (IPv6) protocol stacks that are installed and enabled by default. Domain Name System (DNS) name queries and registrations can now involve both IPv4 address records (A records) and IPv6 address records (AAAA records). This paper describes the behavior of the DNS Client service in Windows Vista for DNS queries and registrations and the possible impact on DNS traffic.

Multi-path Routing Protocols in Wireless Mobile Ad Hoc Networks: A Quantitative Comparison 2006-09-18 Springer Science+Business Media

Multi-path routing represents a promising routing method for wireless mobile ad hoc networks. Multi-path routing achieves load balancing and is more resilient to route failures. Recently, numerous multi-path routing protocols have been proposed for wireless mobile ad hoc networks. Performance evaluations of these protocols showed that they achieve lower routing overhead, lower end-to-end delay and alleviate congestion in comparison with single path routing protocols. However, a quantitative comparison of multi-path routing protocols has not yet been conducted. This paper presents the results of a detailed simulation study of three multi-path routing protocols (SMR, AOMDV and AODV_Multipath) obtained with the ns-2 simulator.

Tags:

Jump to [1] 2 3 4 5

Title	Date Added	Company
IPv6 Usage With Various Operating Systems	2007-09-01	Dell
In a nutshell, IPv6 (Internet Protocol version 6) is the successor to the most common Internet Protocol today (IPv4). This is largely driven by the fact that IPv4's 32-bit address is quickly being consumed by the ever-expanding sites and products on the internet. IPv6's 128-bit address space should not have this problem for the foreseeable future. Additionally, the industry expects the US Federal government to start requiring IPsec (IP security) as part of the IPv6 requirements after June 30th 2008 in their RFQs for most products.
Route Fragility: A Novel Metric for Route Selection in Mobile Ad Hoc Networks	0000-00-00	Rensselaer Polytechnic Institute
A key factor deciding the performance of a routing protocol in mobile ad hoc networks is the manner in which it adapts to route changes caused by mobility. Exploiting the intuition that a less dynamic route lasts longer, this paper proposes a new metric, the Route Fragility Coefficient (RFC), to compare routes. RFC estimates the rate at which a given route expands or contracts. Expansion refers to adjacent nodes moving apart, while contraction refers to their moving closer. RFC combines the individual link contraction or expansion behavior to present a unified picture of the route dynamics. The paper demonstrates that lower the value of RFC, more static (less fragile) the route. Tags: Software Engineering,
Self-Configurable Key Pre-Distribution in Mobile Ad Hoc Networks	0000-00-00	University of California
This paper presents two new schemes that, in the absence of a centralized support, allow a pair of nodes of a mobile ad hoc network to compute a shared key without communicating. Such a service is important to secure routing protocols. The schemes are built using the well-known technique of threshold secret sharing and are secure against a collusion of up to a certain number of nodes. The paper evaluates and compares the performance of both the schemes in terms of the node admission and pairwise key establishment costs. Tags:
COCOON: An Alternative Approach to End-Point Congestion Management	2006-12-13 01:00:24	Alcatel-Lucent
This paper proposes an alternate endpoint congestion management scheme, called COordinated COngestion cONtrol (COCOON). The basic idea is to identify and group connections that may traverse the same backbone link, to enable them to share congestion information, and to coordinate among them all the congestion avoidance/control activities. The size of a COCOON group can be dynamically adjusted so as to magnify the benefits of end-host congestion management. COCOON also allows a new connection to commerce with a congestion window that is large enough to catch up with other connections while not inducing congestion. Finally, COCOON takes into account non-responsive UDP connections and "Bundles" them into a virtual connection that is subject to TCP-like congestion control.
Authenticity by Typing for Security Protocols	2006-12-09 01:00:18	Microsoft
This paper proposes a new method to check authenticity properties of cryptographic protocols. First, code up the protocol in the spi-calculus of Abadi and Gordon. Second, specify authenticity properties by annotating the code with correspondence assertions in the style of Woo and Lam. Third, figure out types for the keys, nonces, and messages of the protocol. Fourth, check that the spi-calculus code is well-typed according to a novel type and effect system presented in this paper. The main theorem guarantees that any well-typed protocol is robustly safe, that is, its correspondence assertions are true in the presence of any opponent expressible in spi.
Types and Effects for Asymmetric Cryptographic Protocols	2006-12-09 01:00:18	Microsoft
This paper presents the first type and effect system for proving authenticity properties of security protocols based on asymmetric cryptography. The most significant new features of the type system are - a separation of public types (for data possibly sent to the opponent) from tainted types (for data possibly received from the opponent) via a subtype relation; trust effects, to guarantee that tainted data does not, in fact, originate from the opponent; and challenge/ response types to support a variety of idioms used to guarantee message freshness. The paper illustrates the applicability of the system via protocol examples.
Timed Spi-Calculus With Types for Secrecy and Authenticity	2006-12-07 01:00:20	Alcatel-Lucent
This paper presents a discretely timed spi-calculus. A primitive for key compromise allows to model key compromise attacks, thus going beyond the standard Dolev-Yao attacker model. A primitive for reading a global clock allows the authors to express protocols based on timestamps, which are common in practice. The authors accompany the timed spi-calculus with a type system, prove that well-typed protocols are robustly safe for secrecy and authenticity and present examples of well-typed protocols as well as an example where failure to typecheck reveals a (well-known) flaw.
How Does Ping Really Work?	2006-10-01	Global Knowledge
Ping is an Internet program that most of us use daily, but do you know how it really works? Gain an understanding of the cycle of processing associated with ping.
Domain Name System Client Behavior in Windows Vista	2006-12-06 01:00:24	Microsoft
Microsoft Windows Vista includes both Internet Protocol version 4 (IPv4) and Internet Protocol version 6 (IPv6) protocol stacks that are installed and enabled by default. Domain Name System (DNS) name queries and registrations can now involve both IPv4 address records (A records) and IPv6 address records (AAAA records). This paper describes the behavior of the DNS Client service in Windows Vista for DNS queries and registrations and the possible impact on DNS traffic.
Multi-path Routing Protocols in Wireless Mobile Ad Hoc Networks: A Quantitative Comparison	2006-09-18	Springer Science+Business Media
Multi-path routing represents a promising routing method for wireless mobile ad hoc networks. Multi-path routing achieves load balancing and is more resilient to route failures. Recently, numerous multi-path routing protocols have been proposed for wireless mobile ad hoc networks. Performance evaluations of these protocols showed that they achieve lower routing overhead, lower end-to-end delay and alleviate congestion in comparison with single path routing protocols. However, a quantitative comparison of multi-path routing protocols has not yet been conducted. This paper presents the results of a detailed simulation study of three multi-path routing protocols (SMR, AOMDV and AODV_Multipath) obtained with the ns-2 simulator. Tags: