Network routing with path vector protocols: theory and applications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Providing quality of service in the internet
Providing quality of service in the internet
IEEE/ACM Transactions on Networking (TON)
Path selection methods with multiple constraints in service-guaranteed WDM networks
IEEE/ACM Transactions on Networking (TON)
A Study of BGP Path Vector Route Looping Behavior
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Adaptive control algorithms for decentralized optimal traffic engineering in the internet
IEEE/ACM Transactions on Networking (TON)
Using adaptive routing to achieve quality of service
Performance Evaluation
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Algorithms for computing QoS paths with restoration
IEEE/ACM Transactions on Networking (TON)
Conditions that impact the complexity of QoS routing
IEEE/ACM Transactions on Networking (TON)
An algebraic theory of dynamic network routing
IEEE/ACM Transactions on Networking (TON)
How to lease the internet in your spare time
ACM SIGCOMM Computer Communication Review
Hop-by-hop Routing Convergence Analysis Based on Paths Algebra
CERMA '07 Proceedings of the Electronics, Robotics and Automotive Mechanics Conference
Rethinking virtual network embedding: substrate support for path splitting and migration
ACM SIGCOMM Computer Communication Review
A virtual network mapping algorithm based on subgraph isomorphism detection
Proceedings of the 1st ACM workshop on Virtualized infrastructure systems and architectures
A survey of network virtualization
Computer Networks: The International Journal of Computer and Telecommunications Networking
PolyViNE: policy-based virtual network embedding across multiple domains
Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures
Virtual network provisioning across multiple substrate networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Virtual network embedding through topology-aware node ranking
ACM SIGCOMM Computer Communication Review
Topology-awareness and reoptimization mechanism for virtual network embedding
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
ViNEYard: virtual network embedding algorithms with coordinated node and link mapping
IEEE/ACM Transactions on Networking (TON)
Real-time traffic transmission over the Internet
IEEE Transactions on Multimedia
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
Interdomain traffic engineering with BGP
IEEE Communications Magazine
| Hi-index | 0.00 |
One of the main challenges of network virtualization is the virtual network embedding problem (VNE) that consists of mapping virtual network demands in physical network resources. VNE can be decomposed into two stages: virtual node and virtual link mapping. In the first stage, each virtual node is mapped to a suitable node in the physical network whereas the second stage is in charge of mapping the links connecting virtual nodes to paths in the physical network that suit the virtual network demands. In this paper we propose the utilization of a mathematical multi-constraint routing framework called ''paths algebra'' to solve the virtual link mapping stage. Paths algebra provides the flexibility to introduce an unlimited number of linear and non-linear constraints and metrics to the problem while finding all the eligible paths in the physical network to perform the virtual link mapping resulting in better and more flexible embeddings.