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.
Smart OSPF (S-OSPF), a load balancing, shortest-path-based routing scheme, was introduced to improve the routing performances of legacy networks running OSPF with known traffic demands. S-OSPF distributes traffic from a source node to neighbor nodes, and, after reaching the neighbor nodes, traffic is routed according to the OSPF protocol. However, in practice, exact traffic demands are difficult to...
Several studies have shown that the BGP protocol adopts a special routing policy such that the default BGP route is usually not the best choice in terms of path length or quality of service. In order to send the traffic through the shortest AS paths by overlay routing, we have to place overlay nodes at several critical points along such paths. Otherwise, these AS paths will never be available to end...
The stringent performance requirement for the high efficiency of routing protocols on the Internet can be satisfied by exploiting the threaded border gateway protocol (TBGP) on multi-cores, but the state-of-the-art TBGP performance is restricted by a mass of contentions when racing to access the routing table. To this end, the highly-efficient parallel access approach appears to be a promising solution...
The global routing table size has been increasing rapidly, outpacing the upgrade cycle of router hardware. Recently aggregating the Forwarding Information Base (FIB) emerges as a promising solution since it reduces FIB size significantly in the short term and it is compatible with any long-term architectural solutions.Because FIB entries change dynamically with routing updates, an important component...
Throughput maximization is one of the main challenges in cognitive radio ad hoc networks, where the availability of local spectrum resources may change from time to time and hop-by-hop. Cooperative transmission exploits spatial diversity without multiple antennas at each node to increase capacity with reliability guarantees. This idea is particularly attractive in wireless environments due to the...
The fine two-phase routing (F-TPR) scheme, an IP finely-distributed load-balanced routing scheme based on two-phase routing over shortest paths, was previously presented to improve routing performances. F-TPR distributes traffic from a source node to intermediate nodes simply by using IP tunnels. F-TPR provides comparable routing performance to the sophisticated traffic engineering (TE) scheme of...
While a variety of routing algorithms have been invented for overlay networks, only a few studies focus on the placement problem of overlay nodes. However, the performance of overlay routing always depends on the routing policy of the underlying Internet, such as BGP routing. According to the BGP routing policy, the result routing path heavily depends on the locations of the two end nodes. By placing...
The development of modern communication technologies fosters human networks (HUNETs)-an information dissemination platform comprised of human-carried wireless-enabled devices. These networks are promising applications of delay tolerant networks (DTNs). However, existing DTN routing protocols do not address unique problems in HUNETs and are unable to utilize the benefits of human mobility. In this...
Efficient utilization of Multi Channel - Multi Radio (MC-MR) Wireless Mesh Networks (WMNs) can be achieved only by intelligent Channel Assignment (CA) and Link Scheduling (LS). Due to the dynamic nature of traffic demand in WMNs, the CA has to be reconfigured whenever traffic demand changes, in order to achieve maximum throughput in the network. The reconfiguration of CA requires channel switching...
Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. With the recent interest in network virtualization, the ability to run multiple virtual router instances on a common physical router platform is essential. An important scaling issue is the number of virtual router instances that...
We propose a novel overlay routing infrastructure, namely Overlay-based Service Distribution Network(OSDN), which eliminates path inflation due to the inter-domain routing policy and could serve as a universal platform to convey various online services more efficiently. Its basic idea is to deploy overlay nodes at critical locations in the Internet such that the service provider and its customers...
The stringent requirement for the high efficiency of routing protocol on Internet will be satisfied by exploiting the threaded border gateway protocol (TBGP) on multi-cores. Since the TBGP performance is restricted by a mass of contentions when racing to access the routing table, a highly-efficient parallel access approach is originally proposed to achieve the ultra-high route processing speed. In...
We present Starburst, a routing-based protocol designed to efficiently disseminate data items to small subsets within a sensor network. Starburst constructs a routing hierarchy to enable fast, efficient and reliable dissemination to nodes in a sensor network that satisfy data-specific predicates. The protocol is based on the idea that when only a few nodes need an update, it is more efficient and...
SIP based VoIP is a key enabling technology for the migration of circuit-switched PSTN architecture to packet-based networks. But the real world did not choose to implement and deploy SIP as initially envisioned by their inventors. The reason is ascribed to SIP spam and accounting problems. The root of this problem is SIP is an Email like protocol, no trust relationship between SIP communication partners...
Recently, the significantly increased IPv6 address length has posed a greater challenge on wire-speed router for IP lookup. As a result, even the most efficient IPv4 lookup scheme can not meet the demand in IPv6. In this paper, we make a thorough observation on the characteristic of IPv4/IPv6 routing table and propose a novel division technique for routing table, with which the traditional LPM (longest...
Controlled-flooding algorithms are widely used in unstructured networks. Expanding ring (ER) achieves low response delay, while its traffic cost is huge; dynamic querying (DQ) is known for its desirable behavior in traffic control, but it achieves lower search cost at the price of an undesirable latency performance; Enhanced dynamic querying (DQ+) can reduce the search latency too, while it is hard...
Network routing may be required, under certain applications, to avoid certain areas (or nodes). These areas can be of potential security threat, possess poor quality or have other undesired characteristics. Thus, protocols that can perform area avoidance routing can be beneficial for many objectives. Such routing is particularly challenging in distance-vector networks, where only the shortest-distance...
The study of peer-to-peer network and mobile ad hoc network (MANET) are currently two hotspots in distributed computing and mobile communication researching domain. By building up a P2P overlay network on top of MANET's physical infrastructure, we effectively integrated P2P network's advantage on sustaining highly dynamic network into the design of MANET routing protocol. By deploying passive MANET...
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.