Results 251 to 260 of about 179,047 (302)
Some of the next articles are maybe not open access.
Proceedings of the 2012 ACM conference on Computer and communications security, 2012
Populated IP addresses (PIP) -- IP addresses that are associated with a large number of user requests are important for online service providers to efficiently allocate resources and to detect attacks. While some PIPs serve legitimate users, many others are heavily abused by attackers to conduct malicious activities such as scams, phishing, and malware
Chi-Yao Hong, Fang Yu 0002, Yinglian Xie
openaire +1 more source
Populated IP addresses (PIP) -- IP addresses that are associated with a large number of user requests are important for online service providers to efficiently allocate resources and to detect attacks. While some PIPs serve legitimate users, many others are heavily abused by attackers to conduct malicious activities such as scams, phishing, and malware
Chi-Yao Hong, Fang Yu 0002, Yinglian Xie
openaire +1 more source
Proceedings. 2006 31st IEEE Conference on Local Computer Networks, 2006
We propose a viral address assignment scheme for wire-less ad hoc networks. In this scheme, a node has multiple addresses and each address of the node corresponds to a logical location of the node in the network. Further, addresses are allocated in a contagious fashion to mimic a viral growth. We study some of the issues in such a scheme.
Sivaram Cheekiralla, Daniel W. Engels
openaire +1 more source
We propose a viral address assignment scheme for wire-less ad hoc networks. In this scheme, a node has multiple addresses and each address of the node corresponds to a logical location of the node in the network. Further, addresses are allocated in a contagious fashion to mimic a viral growth. We study some of the issues in such a scheme.
Sivaram Cheekiralla, Daniel W. Engels
openaire +1 more source
Improving the routing and addressing of IP
IEEE Network, 1993Simple mechanisms for introducing hierarchy into the interdomain routing system, making it practical to route a truly large Internet, are described. It is shown that addresses need to be assigned along network topological lines to maximise the reduction in routing overhead.
Peter Ford +2 more
openaire +1 more source
Automatic IP address configuration in VANETs
Proceedings of the 3rd international workshop on Vehicular ad hoc networks, 2006Cars' high mobility and density impede the direct utilization of traditional networking techniques and protocols in vehicular networks. In this context, automatic IP address configuration is a challenging and yet unexplored issue. We propose a novel scheme that exploits the topology of Vehicular Ad-hoc Networks (VANETs) and an enhanced Dynamic Host ...
Maria Fazio +3 more
openaire +3 more sources
Observed Structure of Addresses in IP Traffic
IEEE/ACM Transactions on Networking, 2002This paper investigates the structure of addresses contained in IP traffic. Specifically, we analyze the structural characteristics of destination IP addresses seen on Interuet links, considered as a subset of the address space. These characteristics may have implications for algorithms that deal with IP address aggregates, such as routing lookups and ...
Eddie Kohler +3 more
openaire +2 more sources
BCube-IP: BCube with IP Address Hierarchy
2014BCube and DCell propose data transfer using source routing for data center networks (DCNs). One potential problem with their approach is the use of two different address spaces, one for identifying end hosts and another for routing. In this paper, we propose a variant of BCube called BCube-IP based on an IP address hierarchy.
A. R. Ashok Kumar +2 more
openaire +1 more source
IP addresses considered harmful
ACM SIGCOMM Computer Communication Review, 2014This note describes how the Internet has got itself into deep trouble by over-reliance on IP addresses and discusses some possible ways forward.
openaire +1 more source
Approaches for resolving dynamic IP addressing
Internet Research, 1997Knowledge of the Internet Protocol (IP) address is essential for connection establishment in certain classes of synchronous distributed applications, such as Internet telephony and video‐conferencing systems. A problem of dynamic IP addressing arises when the connection to the Internet is through an Internet service provider, since the IP address is ...
Schubert Foo +3 more
openaire +1 more source
Priority Tries for IP Address Lookup
IEEE Transactions on Computers, 2010High-speed IP address lookup is essential to achieve wire speed packet forwarding in Internet routers. The longest prefix matching for IP address lookup is more complex than exact matching because it involves dual dimensions: length and value. This paper presents a new formulation for IP address lookup problem using range representation of prefixes and
Hyesook Lim +2 more
openaire +1 more source
An On-Chip IP Address Lookup Algorithm
IEEE Transactions on Computers, 2005This paper proposes a new data compression algorithm to store the routing table in a tree structure using very little memory. This data structure is tailored to a hardware design reference model presented in this paper. By exploiting the low memory access latency and high bandwidth of on-chip memory, high-speed packet forwarding can be achieved using ...
Xuehong Sun, Yiqiang Q. Zhao
openaire +1 more source