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.
Flexibility and extendibility of Software Defined Networks allows development of diverse network management and flow monitoring techniques. Yet, there are inherent tradeoffs between the quality of flow monitoring and the required network resources. In particular, collecting flow statistics, at the level of specific source-destination addresses (and, moreover, specific protocols and ports), requires...
The backpressure algorithm has been widely used as a distributed solution to the problem of joint rate control and routing in multi-hop data networks. By controlling a parameter V in the algorithm, the backpressure algorithm can achieve an arbitrarily small utility optimality gap. However, this in turn brings in a large queue length at each node and hence causes large network delay. This phenomenon...
In this paper, we study how to perform traffic engineering at an extremely-small time scale with segment routing, addressing a critical need for modern wide area networks. Prior work has shown that segment routing enables to better engineer traffic, thanks to its ability to program detours in forwarding paths, at scale. Two main approaches have been explored for traffic engineering with segment routing,...
Nowadays, there is a fast-paced shift from legacy telecommunication systems to novel Software Defined Network (SDN) architectures that can support on-the-fly network reconfiguration, therefore, empowering advanced traffic engineering mechanisms. Despite this momentum, migration to SDN cannot be realized at once especially in high-end cost networks of Internet Service Providers (ISPs). It is expected...
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...
Natural load-bearing structures, such as trees, have had to strive for survival in harsh environmental conditions. Over time, these structures have evolved, and are able now to optimize their shapes. Behind this optimization is a simple yet powerful rule called the axiom of uniform stress, which has successfully been applied to topology optimization in various engineering fields. Similar to physical...
In this work we tackle the bus stop selection step for the School Bus Routing Problem (SBRP). Our goal is to minimize the number of bus stops in order to assign all students to a bus stop respecting a home-to-bus-stop walking distance constraint. Our strategy creates a large number of possible bus stops points in a road network and uses a pseudo-random constructive heuristic algorithm to assign students...
Spectrum sensing is one of the most mandatory mechanisms of Cognitive Radio (CR) to find the unused Spectrum. Spectrum sensing has renewed on a very active scrutiny area over recent years. As it is one of the most important tasks performed using cognitive radio and the implementation of the other functions of the cognitive radio is based on the spectrum sensing. So it is mandatory for cognitive radio...
This paper proposes a distributed algorithm that aims for congestion control in Software Defined Networking with distributed controllers by exploiting loop structures in a network and coloring. Our algorithm dissects a network into loop units called tie-sets and updates flows on edges by enclosed calculation in each controller, which is in charge of one of loop units. Additionally, the deployment...
Placement is the one of the important step in the Field Programmable Gate Array (FPGA) design flow. A successful placement provides complete and optimal routing for the circuit that is to be configured on the FPGA. In this paper an efficient placement algorithm based on Particle Swarm Optimization (PSO), PSO_Placer, is proposed. The proposed PSO based Placement algorithm focuses on minimizing the...
Even in the absence of a physical network infrastructure, it is important that mobile devices can take advantage of the opportunities presented to them to maintain communication. Opportunistic networks are a class of mobile networks that must rely on unscheduled sporadic meetings between nodes to achieve communication. The main challenge in these networks is to route messages towards a destination...
Large service providers (SP) who own their computing, storage, and networking resources have the potential to jointly manage their resources to achieve better quality of service and lower cost. Information-centric networking (ICN) exploits in-network caching resource, by unique identification of content objects. Orchestrating cache and networking resources in a coordinated way is the key to the success...
We have solved a problem of finding the shortest node-disjoint pair of paths that can share resilient arcs. It is assumed that a network consists of a set of nodes and a set of arcs. Moreover, a number of available arcs are resilient. Our goal is to find the shortest pair of paths such that they share only those nodes that are incident to shared resilient arcs. Furthermore, we assume that the resulting...
This paper studies optimization issues related to a proposed traffic protection strategy referred to as flow-thinning strategy (FTS). FTS is an extension of the well known protection concept, called path diversity, to the case of partial multiple link failures. Path diversity assumes that when a certain subset of links fail, then their capacity is entirely lost and the nominal path-flows that are...
In this paper, we describe an improved model Kad-D based on Kademlia[1]. The networks based on Kademlia are not stabilized at all times, for all kinds of nodes in the networks connected to the networks can be cut out of networks frequently. And in mobile environments that are made of intermittent connections and unsettled networks bandwidths, the Kademlia has good performance but the hops, delay and...
In this paper, we propose a methodology for optimal image transmission over a VSNs (Visual Sensor Networks) via cross-layer optimization. Toward this goal, we control the compression ratio of a captured image and network parameters such as source rate, flow rate and routing path. In particular, since this scheme is based on distributed optimization, we can avoid energy concentration in a specific...
This paper analyses two techniques that mitigate the routing misbehavior in wireless ad hoc network, watchdog & pathrater. By reconstructing the watchdog, we eliminate the collision problem which tends to be the weakness of this mechanism and make this algorithm have an better performance in mitigating routing misbehavior in wireless ad hoc network.
Multipath Transport Protocols like Stream Control Transmission Protocol (SCTP) and Multipath TCP (MPTCP) support concurrent usage of multiple paths between the end users. In this paper we investigate the flow division at the source among multiple paths as an optimization problem. We also introduce link-by-link error recovery scheme and compare the system performance when the traditional end-to-end...
Due to the Internet's commercialized ISP structure, inter-domain routing is perceived as more of a commercial service (and market decision) instead of an optimization problem subject to purely technical criteria. In this perspective, routing could be defined as a service which matches perishable resources to requested level of service demands. This diversity in demanded services and proliferation...
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.