| 1. |
- Margasinski, Igor, et al.
(författare)
-
Low-latency parallel transport in anonymous peer-to-peer overlays
- 2008
-
Ingår i: IP operations and management / Lecture notes in computer science. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 0302-9743 .- 1611-3349. - 9783540873563 ; 5275, s. 127-141
-
Konferensbidrag (refereegranskat)abstract
- The paper presents a design and discusses configuration aspects of an overlay transport protocol based on an idea of the peer-to-peer direct and anonymous distribution overlay (P2PRIV). We estimate a secure configuration of the protocol and examine a correlation between the P2PRIV’s anonymous path lengths and latency. An increase of the path lengths speaks strongly in favor of the parallel solution’s anonymity, as in classical cascade networks. In the paper we evaluate the new protocol in a scope of a trade-off between anonymity and traffic performance and show that the presented solution allows effectively increasing anonymity with relatively low impact on anonymous transport latency.
|
|
| 2. |
- Pioro, Michal, et al.
(författare)
-
On efficient max-min fair routing algorithms
- 2003
-
Ingår i: Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003. - Antalya : IEEE conference proceedings. - 076951961X ; , s. 365-372
-
Konferensbidrag (refereegranskat)abstract
- In the paper, we consider the problem of routing and bandwidth allocation in networks that support elastic traffic. We assume that the bandwidth demand between each source-destination (S-D) pair is specified in terms of a minimum and maximum value, and a set of flows between each S-D pair is allowed to realize these demands. (We say that a set of flows realizes the demand associated with an S-D pair, if the sum of the bandwidths allocated to these flows is greater than the minimum value assumed for the demand of that S-D pair). In this setting, we show that routing and bandwidth allocation can be formulated as an optimization problem, where network utilization is to be maximized under capacity and the widely used max-min fairness constraints. We describe three different algorithms to solve variants of this problem. The most important one, an efficient, original algorithm assuming multipath routing is studied in detail and illustrated with a numerical example
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
- Ahlfors, Ulf, et al.
(författare)
-
Towards Efficient Call Admission Control Criterion for State-Dependent Routing in Multirate Networks
- 1999
-
Ingår i: Proceedings of the 1999 IEEE International Conference on Control Applications, (2):1607-1613, Hawaii, USA, August 1999. - 078035446X ; 2, s. 1607-1613
-
Konferensbidrag (refereegranskat)abstract
- We consider a link serving multiple service classes. We evaluate the properties of the link admission control policies that are obtained from an efficient scheme proposed by Krishnan and Hubner (1997). The Krishnan and Hubner approach suggests efficient calculations of state-dependent routing criteria for multi-rate networks through state-space aggregation. Through simple examples we show that it is possible that the approximations made in the approach might lead to degraded performance, instead of the expected improvement. We outline and discuss a possible extension to the Krishnan and Hubner approach in an effort to address this problem
|
|
| 6. |
- Alvizu, Rodolfo, et al.
(författare)
-
Differential delay constrained multipath routing for SDN and optical networks
- 2016
-
Ingår i: Electronic Notes in Discrete Mathematics. - : Elsevier BV. - 1571-0653. ; 52, s. 277-284
-
Tidskriftsartikel (refereegranskat)abstract
- In multipath routing, maximization of the cardinality K of the disjoint-path set for a given source and destination assuming an upper bound on the differential delay D is one of the key factors enabling its practical applications. In the paper we study such an optimization problem for multipath routing involving maximization of K under the D constraint as the primary objective, and then minimization of the average end-to-end transfer delay for the fixed (maximum) K under the same D constraint. The optimization approach is iterative, based on solving an inner mixed-integer programming subproblem to minimize the delay for a given value of K and D. In order to increase the solution space, we consider the strategy of allowing controlled routing loops. Such a technique is implementable in software defined networks and optical networks. We present numerical results illustrating the gain achieved by using controlled loops in comparison with the traditional loop-free approach.
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
- Dzida, Mateusz, et al.
(författare)
-
Design of mixed MPLS/OSPF routing in IP networks
- 2006
-
Ingår i: Systems Science. - 0137-1223. ; 32:3, s. 55-59
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, we address some Internet core network optimization issues related to a combination of Open Shortest Path First (OSPF) and Multi Protocol Label Switching (MPLS) routing protocols. Since MPLS can be combined with any routing protocol there has appeared an idea of coupling IP streams routed via the OSPF protocol and MPLS Label Switched Paths (LSPs) in the same network. One expected advantage behind such a combined routing is to adjust the design stage by allowing some flows to be routed via OSPF while others to be transmitted via MPLS LSPs. In the paper we discuss two routing optimization problems. In the first case, OSPF routing protocol works over logical network with generalized IP links. These links are either standard IP links or IP links established as MPLS LSPs. In the second case, we distinguish two types of demands depending on whether OSPF routing is used or packets are switched by MPLS Label Switch Routers (LSR). We present both problem formulations and discuss the question on how to effectively solve these problems.
|
|
| 10. |
- Dzida, M, et al.
(författare)
-
Optimization of the shortest-path routing with equal-cost multi-path load balancing
- 2006
-
Ingår i: 2006 International Conference on Transparent Optical Networks. - 1424402352 ; 3, s. 9-12
-
Konferensbidrag (refereegranskat)abstract
- In this paper we address the problem of routing optimization in IP networks. We assume that traffic is routed along the shortest paths computed with respect to administrative link metrics. Metrics are distributed in a network by open shortest path first (OSPF) or a similar routing protocol. If it happens that the shortest path is not unique then equal-cost multi-path (ECMP) load balancing principle is applied. It means that the demand traffic destined to specific node is split among all the shortest paths to that node. The problem considered here is to determine the shortest-path routing pattern satisfying traffic demands, and to find appropriate link metrics while link capacities are not exceeded. Besides that many traffic engineering criterias can be used as objective function of the problem, we assume that the residual capacity volume is maximized. In this paper we formulate the problem as a mixed integer programme (MIP) and propose some combinatorial separation cuts for the problem and give an effective method for deriving such cuts
|
|
