A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Minimum Interference Routing: The Precomputation Perspective
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
The main contribution of the paper is a method to assess the degree of link criticality facilitating efficient route precomputation even in the case, when up to date resource availability information is ...
The basic idea comes from Minimum Interference Routing: select a feasible path that puts the least possible restriction on the transmission capacity offered by the network for other communicating parties ...
The author is grateful to Miklós Boda (Ericsson), Tamás Henk and Tibor Cinkler (HSNLab) for their support. ...
doi:10.1007/978-3-540-39404-4_19
fatcat:aissxhih6feircr6fhqwulgacy
Precomputation schemes for QoS routing
2003
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we investigate precomputation methods in the context of Quality-of-Service (QoS) routing. ...
Precomputation is highly desirable for QoS routing schemes due to the high computation complexity of selecting QoS paths on the one hand, and the need to promptly provide a satisfactory path upon a request ...
In this paper, we focus on the precomputation perspective of Quality-of-Service (QoS) routing. ...
doi:10.1109/tnet.2003.815299
fatcat:vunnxdxd75hj5gj3tnn5pathsy
QoS routing: the precomputation perspective
Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Accordingly, we consider the precomputation perspective, focusing on two major settings of QoS routing. ...
A major algorithmic challenge posed by QoS routing is the need to promptly identify a suitable path upon a connection request, while at the same time ensure that the selected path is satisfactory, both ...
Accordingly, this study considered the precomputation perspective, focusing on two major settings of QoS routing. ...
doi:10.1109/infcom.2000.832181
dblp:conf/infocom/OrdaS00
fatcat:u3uf6crdczb5rfb3yszdrifktu
QoS routing granularity in MPLS networks
2002
IEEE Communications Magazine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
This study investigates how constraint-based routing decision granularity significantly affects the scalability and blocking performance of QoS routing in an MPLS network. ...
The overflowed cache of the per-pair/flow scheme adds a per-pair cache and a per-flow cache as the routing cache, and performs well in blocking probability. ...
ACKNOWLEDGMENT The authors wish to acknowledge the constructive comments from the anonymous reviewers. ...
doi:10.1109/mcom.2002.1007409
fatcat:fk7yd4vce5bptdrjau7pao6agq
Research challenges in QoS routing
2006
Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
by the current QoS-unaware routing protocols. ...
Indeed, the problem of QoS Routing with multiple additive constraints is known to be NP-hard. ...
Acknowledgements This work has been supported by the European Commission within the IST E-Next project FP6-506869 ...
doi:10.1016/j.comcom.2005.06.008
fatcat:mldnjuev6nhpbf5rbkk6wr2kt4
Adaptive proportional routing: a localized QoS routing approach
2002
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Furthermore, stale QoS state information causes the performance of these QoS routing schemes to degrade drastically. ...
Solutions to these questions affect the performance and cost trade-offs in QoS routing. ...
This approach to QoS routing is thus referred to as the global QoS routing approach. ...
doi:10.1109/tnet.2002.804832
fatcat:timdz2la6baztkorcvswbcu7li
Proactive QoS Routing in Ad Hoc Networks
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we analyze the advantages and disadvantages of the proactive QoS routing in ad-hoc networks. ...
Our analysis of the simulation results shows that the additional message overhead generated by the proactive QoS routing have a negative impact on the performance of the routing protocol. ...
Acknowledgements: This work is funded by the Defense Research and Development Canada (DRDC) and benefited from various discussions with members of the CRC RNS mobile networking group. ...
doi:10.1007/978-3-540-39611-6_6
fatcat:hsaaywx3yfh5hhxsx6ad3rhami
Virtual Strategy QoS routing in satellite networks
2016
Science China Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
And then, the supporting QoS routing solution enables the committed QoS services over Virtual Strategy. Finally, we provide a comparison between the previous satellite networks and our work. ...
The simulation results show that our Virtual Strategy QoS routing scheme demonstrates dominated performances under complex architecture. ...
Conflict of interest The authors declare that they have no conflict of interest. ...
doi:10.1007/s11432-015-5364-0
fatcat:xrmffwa3jvaobogzcv3oruht2i
Conditions that impact the complexity of QoS routing
2005
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The goal of this paper is to argue that in practice QoS routing may be tractable. ...
This proof has dramatically influenced the research community, resulting into the common belief that exact QoS routing is intractable in practice. ...
has been distributed throughout the network and is accurately maintained at each node using QoS routing protocols. ...
doi:10.1109/tnet.2005.852882
fatcat:llz5qqxchjfrrllnipcn33wo64
Hierarchical Routing with QoS Constraints in Optical Transport Networks
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Hierarchical routing is required in the ASON recommendations to achieve scalability. ...
Main skill of this routing mechanism is to reduce the connection blocking increase because of selecting paths based on inaccurate routing information. ...
Shaded areas in Fig.l show the whole network perspective seen by nodes betonging to Routing Area X1. ...
doi:10.1007/978-3-540-24693-0_55
fatcat:niol54ncczb4pm5ufvdypx46tq
An approximation algorithm for QoS routing with two additive constraints
2008
Network Protocols (ICNP), Proceedings of the IEEE International Conference on
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Unfortunately, these algorithms cannot be applied directly in the Internet because routing in the Internet is based on table lookups and routing tables are computed before a request arrives. ...
In this paper, we develop an approximation algorithm for computing the supported QoS going across a domain. ...
[2] , [3] , [9] , [14] are the works that consider the problem of precomputing the supported QoS. ...
doi:10.1109/icnp.2008.4697051
dblp:conf/icnp/HouLLB08
fatcat:xt4qovz375ab3fj5hecknlkmru
QoS-driven multipath routing for on-demand video streaming in a Publish-Subscribe Internet
2015
2015 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Our scheme is developed in the context of the Publish-Subscribe Internet architecture and is shown to outperform state-of-the-art multi-constrained multipath selection mechanisms by up to 7%, and single-path ...
or singleconstrained multipath selection schemes by up to 17%, in terms of feasible path discovery, while at the same time improving on bandwidth aggregation. ...
QoS routing and path formation Path formation algorithms for QoS routing are classified in three categories wrt. their complexity, and thus their feasibility [11] . ...
doi:10.1109/icmew.2015.7169758
dblp:conf/icmcs/ThomasFP15
fatcat:liei3a4whnccjf2r7imcpu3g4e
Internet QoS: a big picture
1999
IEEE Network
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Putting all these together, we give the readers a grasp of the big picture of the emerging Internet QoS. s Table 2 . The relative positions of the components in the QoS framework. ...
In this article we present a framework for the emerging Internet quality of service (QoS). ...
The authors sincerely thank the anonymous reviewers for their insightful comments. ...
doi:10.1109/65.768484
fatcat:nec3ifyg3vbl3fs5dfmasigfqe
Sensor management policies to provide application QoS
2003
Ad hoc networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
This maximization is achieved by jointly scheduling active sensor sets and finding paths for data routing. significantly increased through optimized several heuristic methods. ...
These goals are typically contradicting and must be balanced at the point where the application is best satisfied. ...
Acknowledgements
Mark Perillo is supported by the Office of Naval Research through an NDSEG fellowship. ...
doi:10.1016/s1570-8705(03)00004-0
fatcat:ekbqhvzujrartad2mwshhihcva
A scalable approach to the partition of QoS requirements in unicast and multicast
2005
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In addition, our algorithms readily generalize to support QoS routing in typical settings of large-scale networks. ...
As opposed to previous solutions, our technique considerably reduces the computational complexity in terms of dependence on network size; moreover, it enables the development of precomputation schemes. ...
Precomputation-based methods have recently been proposed [9] , [10] (in the context of QoS routing) as an instrument to facilitate scalability, improve response time, and reduce the computational load ...
doi:10.1109/tnet.2005.857122
fatcat:uhxzyrngbbgyngiqfk6pzz7uje
« Previous
Showing results 1 — 15 out of 295 results