The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Balancing the load in content addressing schemes for route-restricted networks represents a challenge with a wide range of applications. Solutions based on greedy embeddings maintain minimal state information and enable efficient routing, but any such solutions currently result in either imbalanced content addressing, overloading individual nodes, or are unable to efficiently account for network dynamics...
We introduce structural transformations that allow simplifying a given network while preserving its original “bandwidth” and “routing” capabilities, transparently to specific allocations. We minimize a certain objective such as the aggregate capacity of network links, number of nodes, or number of links, in such a way that all the bandwidth that could be routed in the original network can also be...
Wireless devices such as sensors have increasingly more processing, storage, and networking capabilities, making wireless sensor networks (WSNs) get lots of attentions in recent years. In addition, the cost of sensors is constantly decreasing making it possible to use large quantities of these sensors in a wide variety of important applications in environmental, military, commercial, health care,...
In this poster, we consider software-defined wireless sensor networks (SDWSNs) and present a lightweight flow management to reconfigure flow entries in flow-table when link fault occurs in the data plane of SDWSNs.
In this article, we consider software-defined wireless sensor networks (SDWSNs) and propose a scheme for sleep scheduling with low control overhead-based flow-entry in flow-table to overcome the limitation of control traffic in SDWSNs.
The overlay network has been widely developed in recent years. There may be various overlays that co-exist with each other upon the same underlying network. These overlays have heterogeneous performance goals, and they will compete for the physical resources, so that a sub-optimal performance of the overlays may be achieved. Moreover, the heterogeneity of the overlays makes them difficult to coordinate...
Interconnects play a critical role in various networking environments including data center networks, high performance computing systems, networks-on-chip, etc. An important design concern of interconnects is the hardware cost, especially when the scale increases. In order to achieve lower hardware cost, a lot of previous work leverages a tradeoff between the cost and the performance. In this paper,...
The Internet consists of a large number of interconnected heterogeneous ASs (Autonomous Systems), each owned and administered by an autonomous organization. Traffic in each AS is forwarded by routers that maintain a coherent picture of the network topology using an intra-AS routing protocol. The most popular intra-AS routing protocols are link-state protocols, such as OSPF and IS-IS. An attacker who...
Named-Data Networking (NDN) is a promising architecture for future Internet. However, routers and content providers in NDN can be targets for a new DDoS attack called the Interest Flooding Attack (IFA). As a consequence, affected routers drop legitimate interest packets. We argue that IFA can be defended effectively when it is detected and mitigated, at early stage, based on timely and aggregated...
In this paper, we present the Context-Aware Opportunistic Resource-Based Routing Protocol (CORB) for intermittently-connected stationary wireless sensor networks. This protocol targets domains such as ambiance control in smart buildings. Unlike existing context-aware routing approaches which consider node mobility as the main source of disconnection, CORB only considers the nodes' limited resources...
While the threats in Internet are still increasing and evolving (like intra multi-tenant data center attacks), protection and detection mechanisms are not fully accurate. Therefore, forensics is vital for recovering from an attack but also to identify the responsible entities. Therefore, this paper focuses on tracing back to the sources of an anomaly in the network. In this paper, we propose a method...
Security is a major challenge in Opportunistic Networks (OppNets) due to its characteristics of being an open medium with dynamic topology, there is neither a centralized management nor clear lines of defence. A packet dropping attack is one of the major security threats in OppNets as neither source nodes nor destination nodes have any knowledge of when or where a packet will be dropped. In this paper,...
This paper has analyzed routing selection errors in the process of two-way redistribution among different routing protocols in the large network architecture. The network device simulation software is used to state routing selection errors in the redistribution process between the protocol of RIP and OSPF. It also predicts the possible problems. Through the access control list, we will obtain the...
Simultaneously providing flexibility, evolvability and correctness of routing is one of the basic and still unsolved problems in networking. Route redistribution provides a tool, used in many enterprise networks, to either partition a network into multiple routing domains or merge previously independent networks. However, no general technique exists for changing a live network's route redistribution...
Handling link failures is the fundamental task of routing schemes. Routing protocols based on link state (e.g., OSPF) require a global state advertisement and re-computation when link failure happens, and will cause inevitable delivery failures. To improve the routing resilience without introducing significant extra overhead, we propose a new routing approach, Keep Forwarding (KF) to achieve k-link...
As chip density increases rapidly with every process generation, the use of Network-on-Chip (NoC) has become the prevalent architecture for SoC, MPSoC, and, large scale CMP (Chip Multi Processor) based designs. Diverse NoC solutions have been proposed by the researchers to meet the enhanced on-chip communication requirements. Here, underlying network interconnection architecture (topology), router...
A prior layer-2 routing algorithm-D2ENDIST demonstrates advantages in throughput improvement, reroute period and failure recovery. Moreover, with the invention of software-defined networking (SDN), a revolutionary networking concept, dynamic routing protocols can embrace more flexible policy on per-flow basis. However, due to runtime complexity of dynamic routing, many issues on the practicality emerge...
Network-on-chip (NoC) is emerging as an effective architecture which address the shortcomings of traditional bus-based System-on-chip (SoC). Since its better properties, such as the lower power consumption, smaller size and higher scalability, mesh is often regarded as an effective topology for NoC design. In this paper, we propose a double-layer sparse honeycomb topology as a terrific design option...
Information Centric Networking (ICN) paradigms aim at optimizing computer networks for information distribution. Named Data Networking (NDN) and its implementation CCNx propose a promising globally implementable ICN. Routing on names, however, may result in extremely large global routing tables. In this paper, we propose to confine the global routing table size by decoupling context-related names,...
Optimized Link State Routing is a routing protocol that has been extensively studied for mobile ad-hoc networks. Link spoofing, which disturbs the routing service, is one of the critical security problems related to the OLSR protocol. Existing approaches against link spoofing attack have several drawbacks. In this paper, we propose an LT-OLSR protocol that broadcasts Hello messages to neighbors within...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.