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.
In this paper, we propose a proactive recovery method against multiple network failures for large-scale packet switching networks. The proposed method exploits the overlay networking technique. Specifically, it constructs multiple logical network topologies from the original overlay network topology by assuming various failure patterns. When a failure is detected, our method selects one topology....
Congestion control in networks is a well-studied problem. In this paper, we propose a distributed congestion control scheme for connectionless networks which tries to attain high delivery ratio, possibly at the cost of higher delay. In situations where the entire network is not congested, this scheme attempts to spread the packets headed towards congestion to uncongested areas, where they can be rerouted...
Modeling the Internet is vital for network researches. Recent measurement studies on the Internet topology show that the degree distribution obeys the power-law distribution. However, only the degree distribution does not determine the performance of network control methods. As previous studies have shown, one of important factors to characterize the performance of network control methods in the Internet...
Network virtualization can diversify the future Internet architecture into separate virtual networks according to different applications and requirements. Telecom operators adopt network virtualization technologies to design virtual networks to meet users' requirements and achieve high efficiency, low cost, controllability, etc. Previous researches focus on virtual networks construction based on restriction...
The multi-source and single-sink (MSSS) topology is defined as the network topology in wireless sensor networks (WSNs), where all of nodes can gather, receive and transmit data to the sink. We consider the problem of finding the joint optimal scheme with consideration of physical, medium access control (MAC), and network layers to maximize the network lifetime (NL) for the MSSS topology in the energy-constrained...
The current Internet infrastructure is facing a number of limitations that is not suitable to meet the growing number of services and users. In particular, one aspect that requires enhancement is routing, where original routing concepts were designed for static traffic patterns with minimal variations and supporting mainly low throughput traffic (e.g. Data). As the number of users as well as services...
In this paper, we approach new problems of resource dimensioning and routing for multi-domain networks supporting future user-driven dynamic traffic. Three basic dimensioning approaches-independent, global, and normalized-are studied in conjunction with the appropriate routing schemes that match each dimensioning policy based on how much information is shared across domains. We quantify the performance...
This paper reports on a probabilistic method for traffic engineering (specifically routing and resource allocation) in backbone networks, where the transport is the main service and robustness to the unexpected changes in network parameters is required. We analyze the network using the probabilistic betweenness of the network nodes (or links). The theoretical results lead to the definition of "criticality"...
Future force networks such as FCS and WIN-T are anticipated to support a wide spectrum of applications with stringent and diverse quality of service (QoS) constraints. While many QoS control mechanisms are being designed, judicious multi-metric QoS route selection mechanisms are often put forth as a key means to help provide QoS assurances. QoS routing based on multiple metrics can potentially provide...
This paper proposed a dynamic fuzzy clustering scheme with adaptive fuzzy threshold to the hierarchical topology optimization in overlay multicast. The scheme firstly normalized the two routing metrics - overlay path delay and overlay node access bandwidth-- to comprise the clustering feature vector, and then calculated the Euclidean distance within each pair of overlay nodes to construct the fuzzy...
Data gathering in a wireless sensor network works in a way that a sink collects data from a large number of sensor nodes. Traditionally, the hop-by-hop transmission is used in this many-to-one communication. In this communication pattern, the closer a sensor node is to the sink, the sooner its energy is exhausted. The nodes close to the sink need to route data packets for farther nodes and thus the...
Routing is a problem domain with an infinite number of end-solutions. One possible approach is to solve such problems using of graph theory. This paper presents a mathematical analysis for a routing problem, based on circular graphs, where the focus is on searching for the shortest path on a circular graph. The theoretical section will be argued by an example where we look for the fastest path and...
Wireless sensor networks are generally deployed in hostile environment so the security service is the essential part of wireless sensor networks. To achieve the security service, key management is the fundamental one. Many key management schemes have been proposed considering the characteristics of sensor nodes. Despite the advances of key management techniques, wireless sensor networks still have...
Opportunistic routing (OR) schemes, such as ExOR, have been shown to provide significant throughput gains over traditional best-path routing schemes for wireless networks. Though the performance of OR schemes depend on the bit-rate, they currently use a fixed rate for transmitting packets. While several schemes have been proposed for selecting bit-rate for unicast transmission to a single receiver,...
Wireless network coding has been shown to reduce the number of transmissions by exploiting the broadcast nature of the wireless medium. Multiple packets may be encoded into a single packet when their respective next hops have enough information to decode them. Previous research has shown that packets belonging to different flows may be encoded (interflow coding) when they are passing through a common...
Finding the optimum path or routing always is an important and difficult issue in a practical dynamic network. In this paper, a new routing approach that due to multiple requirements in the reconfigurable network is briefly discussed. In order to obtain the optimum path between two nodes, we use the ant algorithm with which the problem can be attached to select the path. Simulation results shows that,...
In this paper, it is discussed how to do routing in disruptive tolerant networks (DTN) in order to minimize the packet loss. In DTN there is no guarantee of path existence between the source and the destination. For such networks, the usual networking protocols do not work properly and cannot deliver the packets between nodes in the network. However there are cases where the connectivity between 2...
We consider the problem of estimating steady-state blocking probability for circuit-switched networks that allow alternate routing with particular emphasis on networks protected by trunk reservation. We use a recently proposed blocking probability estimate, the Overflow Priority Classification Approximation (OPCA) as an alternative to the currently used Erlang's Fixed-Point Approximation (EFPA). We...
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.