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.
It is difficult to discover Walkable Path for a doctor going to the targeted patient basis in the confused calamity spot. Applying a sensor network to an emergency lifesaving system called triage which makes a lifesaving order decision is an active area of research. Although research which saves the energy and the traffic in the case of the information gathering to a sink node is done, they do not...
In the highly connected Internet most of domains have more than one interconnection link to different providers. In such a multi-homed scenario destinations for inter-domain traffic may be reachable through multiple egress routers with different offered cost and path performance. In this paper, we address the problem of route selection in a multi-homed stub network to optimize transit costs and paths...
To create future bandwidth abundant and cost-effective networks, we need to not only optimize photonic technologies but also strengthen their coordination with electrical technologies. The presentation first identifies the requirements of future networks and elucidates the best combination of electrical and optical technologies that will cost-effectively satisfy the requirements. The importance of...
Seamless mobility across heterogeneous wireless networks requires a certain level of Quality of Service (QoS) to be assured as it determines the packet loss and delay during handoff procedure. Selecting the target network in an appropriate time plays a crucial role towards achieving ubiquitous networks. This paper proposes a network discovery and selection method called Improved Access Router Discovery...
This paper demonstrates the usage of novel cognitive methods that improve the throughput of a WIMAX network by minimizing packet loss. The effects of the ant colony and fastest path routing algorithms on the throughput are investigated. a combination of Time Division Multiple Access (TDMA) and Orthogonal Frequency Division Multiple Access (OFDMA) spectrum sharing techniques is used. Data packet loss...
We consider wireless mesh networks where some of the wireless routers also play a role of gateways to the internet. The assumed cognitive ability of the routers' radios is a cost efficient manner to increase available bandwidth but requires an adaptive bandwidth management mechanism to deal with dynamics of primary users' activities. To cope with this issue we propose an economic framework for adaptation...
Estimation of traffic demand is a major requirement in numerous telecommunication network applications. As traffic level typically varies with time, online applications such as dynamic routing and dynamic capacity allocation need to accurately estimate traffic in real time to optimize network operations. While optimizing network capacity, the effect of estimation error on Grade of Service must also...
Overlay routing is an application-level routing mechanism and existing research has revealed that overlay routing can improve user-perceived performance. On the other hand, overlay routing may harm the ISPs' cost structure because of the policy mismatch between IP routing and overlay routing. In a previous study, we proposed a method to reduce inter-ISP transit cost caused by overlay routing while...
The unifying network architecture has contributed to a wave of work on layered network evolution. The undertaking of this paper is twofold: This paper's first-of-its-kind examination of the problems of logical link mapping and traffic flow routing unveils that backhaul traffic, a flow loop that occurs at any lower link layer below the traffic layer except its own, could happen in the traffic flow...
Counter to previous works on router bypass, that assume protection bandwidth in routers is independent of the amount of bypass, we show that more bypass implies more IP protection bandwidth to cope with reduced likelihood of sharing.
Our proposed information-diffusion-based routing (IDBR) is implemented on Tsinghua University's large-scale ASON test-bed. The procedure of IDBR is validated together with RSVP-TE signaling in the experiment. Results show that the IDBR is fast converged and has low bandwidth consumption.
The dynamic nature of mobile ad-hoc networks (MANETs) can easily lead to data being inaccessible due to constant route changes and network partitions. One method often used for increasing reliability and availability of data is replication. However, replication comes with costs, those of transferring and storing data and keeping track of consistency between replicas. For that reason, we have identified...
IPTV is defined as multimedia services delivered over IP based networks. This can be performed using the PIM-SM multicast routing architecture which enable IP multicast routing on existing IP networks. The RP is required for network running PIM-SM, and the RP location changes the efficiency of multicast data packets. In general, the PIM-SM is consisted of a shared tree for keep-alive packets and a...
Analyzed the features of router-level topology simulation, and proposed an algorithm HRSA facing router-level network topology simulation based on Dijkstra algorithm aiming at actual Internet stratified topology structure. By the way of adding the shortest routing table on the core router, the time of searching the shortest path in router-level topology simulation has been reduced effectively. The...
A new multi-paths routing algorithm has been proposed in this paper, which can solve the problem of congestion caused by overloads of links and provide a better environment compared with the traditional networking technologies. This methodology will call the routing mechanism when the links appear overloads, and it can adopt alternative path or multi-paths to complete data transmission to reduce congestion...
So far, large computing clusters consisting of several thousand machines have been constructed by connecting nodes together using interconnect technologies as e.g. Ethernet, Infiniband or Myrinet. We propose an entirely new architecture called Tightly Coupled Cluster (TCCluster) that instead uses the native host interface of the processors as a direct network interconnect. This approach offers higher...
This paper proposes a new ring structure of network coding (RSNC) based on existing network coding topology, enlarging the field of application and reducing the complexity of coding. On the basis of real-time monitoring and dynamic allocation for network bandwidth, RSNC is applied to the CERNET backbone network. The route of the packet is decided by the source node when it sends data packet and it...
For future internet, network virtualization provides the feasibility of running multiple routing architectures on a shared physical infrastructure. This paper presents the design and evaluation of a bandwidth allocation algorithm based on multi-commodity flow problem solver which integrated with a traffic predictor. The basic idea of our design is that some failure in the MFP computation implies that...
Overlay networks are becoming prevalent in today's networking environment. We consider scenarios where substrate resources are primarily consumed by many overlay networks placed on top of the substrate. We focus on the fair and efficient allocation of substrate link bandwidth among competing overlays. We adapt various existing fairness definitions to this scenario and define a metric to evaluate the...
Data center networks (DCNs) usually have a regular topology providing high bandwidth and low latency with multi-paths. In a data-intensive application on DCNs, it is important to be able to use all the available bandwidth. However, this is not easy to achieve because of the locality of congestion information. In this paper, we propose a reactive reroute strategy to incorporate with IEEE 802.1Qau standards...
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.