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.
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...
In this paper, we present a novel routing algorithm for multi-channel cognitive radio networks(CRNs). Our algorithm based on smallest transmission delay, which is named as SDCR (smallest delay cognitive routing). By calculating the transmission delay of given packets on every link(let this delay as the weight of link), and then using classic Dijkstra algorithm to find the smallest transmission delay...
It is well known that TCP shows performance degradation over wired/wireless networks since TCP regards packet loss as network congestion. TCP Veno has successfully addressed this fundamental problem by proposing an end-to-end loss differentiation algorithm, which distinguishes the cause of packet loss by the number of packets in the router buffer. Unfortunately, Veno's algorithm shows very low accuracy...
Router-assisted congestion control protocols, also known as explicit rate notification (ERN) protocols, implement complex algorithms inside a router in order to provide both high link utilization and high fairness. Thus, router-assisted approaches overcome most of the end-to-end protocols problems in large bandwidth-delay product networks. Today, router-assisted protocols cannot be deployed in heterogeneous...
This paper describes a new path computation model in Multi-protocol Label Switching (MPLS) and Generalized MPLS (GMPLS) networks. It introduces a path computation element (PCE), which is functionally separate from label switching routers (LSRs). The Path Computation Element (PCE) is an entity that is capable of computing a network path or route based on a network graph, and applying computational...
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.