Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Purchase individual online access for 1 year to this journal.
Price: EUR 135.00Impact Factor 2024: 0.7
This journal publishes papers on a number of topics ranging from design to practical experiences with operational high performance/speed networks.
The topics covered will include but not be limited to:
- Communication network architectures
- Evolutionary networking protocols, services and architectures
- Network Security
Authors: Saha, Debanjan | Tripathi, Satish
Article Type: Other
Citation: Journal of High Speed Networks, vol. 7, no. 2, pp. 75-76, 1998
Authors: Apostolopoulos, George | Guérin, Roch | Kamat, Sanjay | Tripathi, Satish K.
Article Type: Research Article
Abstract: Quality of Service (QoS) routing algorithms have become the focus of recent research due to their potential for increasing the utilization of an Integrated Services Packet Network (ISPN) serving requests with QoS requirements. While heuristics for determining paths for such requests have been formulated for a variety of QoS models, little attention has been given to the overall processing complexity of the QoS routing protocol. This paper deals with the processing complexity of determining QoS paths in link state based routing architectures. Although on‐demand path computation is very attractive due to its simplicity, many believe that its processing cost will …be prohibitive in environments with high request rates. In this work, we first characterize the processing cost of QoS routing algorithms that use the widest‐shortest path heuristic. Then we study alternatives to on‐demand path computation that can reduce this processing overhead. In addition to the well known solution of path pre‐computation, we introduce and study path caching, an incremental modification of on‐demand path computation. By simulating realistic topologies and traffic conditions we investigate the performance of both alternatives. Our results show that caching is an effective alternative to path pre‐computation and that both path caching and pre‐computation can achieve significant processing cost savings without severely compromising routing performance. Show more
Keywords: Path caching, path pre‐computation, link state routing, trunk reservation
Citation: Journal of High Speed Networks, vol. 7, no. 2, pp. 77-98, 1998
Authors: Pornavalai, Chotipat | Chakraborty, Goutam | Shiratori, Norio
Article Type: Research Article
Abstract: In this paper we study QoS based routing algorithm for supporting resource reservation in high‐speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP‐complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss‐free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Then such a multiple QoS constrained route could be searched in polynomial time. We also present that routing algorithm (called ‘QoSR_{\mathrm{BF}} ’), which is a modified version of …Bellman–Ford shortest path algorithm. Simulation results show that QoSR_{\mathrm{BF}} has better performance compared to the existing QoS routing algorithms. Show more
Keywords: Routing algorithm, QoS constraints, resource reservation, Integrated Services Packet Networks
Citation: Journal of High Speed Networks, vol. 7, no. 2, pp. 99-112, 1998
Authors: Rajagopalan, Bala | Nair, Raj
Article Type: Research Article
Abstract: The integrated services Internet architecture introduces the need for receiver‐initiated multicast routing of flows with heterogeneous resource requirements. Multicast routing with resource reservation, however, raises many issues. First, there is a scalability problem; straightforward decentralized implementations of Steiner heuristics require complete information on resource allocation for each multicast flow at every router. This is in addition to the basic scalability concerns with Internet multicasting when dealing with large and dynamic groups. Second, there is an efficiency issue; receiver‐initiated, decentralized multicast routing may lead to inefficient resource allocation if not properly designed. Third, there is a potential for incorrect operation when …multicast delivery paths are constructed in an uncoordinated manner. Finally, the integration of the resource reservation model with multicast routing is an issue. This paper describes these problems and proposes solutions that address them, based on decentralized implementations of a new heuristic. Detailed analyses of the proposed schemes using simulations indicate good performance and acceptable overheads. Show more
Keywords: Multicast, integrated services Internet, Quality of Service, Steiner heuristics
Citation: Journal of High Speed Networks, vol. 7, no. 2, pp. 113-139, 1998
Authors: Segall, Adrian | Bhagwat, Pravin | Krishna, Arvind
Article Type: Research Article
Abstract: A QoS routing protocol based on alternative path selection is described. Using a combination of source routing and shortest path routing, packets are routed along alternate paths when available resources along the shortest path cannot satisfy the QoS requirements of end to end flows. For path selection, the QoS routing protocol makes use of the information already available in the OSPF link information database. Packet forwarding uses existing mechanisms within the Internet protocols. Thus, support for QoS routing is provided without requiring major changes to the existing installed base of OSPF routers. Our proposal provides QoS routes for unicast as …well as multicast connections. The major virtues of the solution are that of providing an evolutionary approach, whereby only a subset of the routers need to be enabled, and that the additional algorithms are computationally simple without requiring state maintenance at every router. Simulations of our proposed routing protocols on the UUnet backbone show that they perform well, almost optimal in terms of delivering the desired QoS for end to end flows. Show more
Citation: Journal of High Speed Networks, vol. 7, no. 2, pp. 141-158, 1998
Authors: White, Paul Patrick | Crowcroft, Jon
Article Type: Research Article
Abstract: In this paper we discuss the need for resource reservation in the Internet and examine some of the strengths and weaknesses of RSVP, which is currently the most popular of Internet reservation protocols that have been developed. We also discuss some alternative reservation protocols for packet networks, in particular the ATM Block Transfer (ABT) reservation protocol that has been designed for use in Asynchronous Transfer Mode (ATM) networks and which uses ‘in‐line’ control packets to modify reservations ‘on the fly’ to achieve very efficient bandwidth utilisation. Finally, we present a proposal for a new reservation protocol, known as DRP (Dynamic …Reservation Protocol) which combines many of the strengths of RSVP and ABT with few of the weaknesses to achieve a highly bandwidth‐efficient reservation mechanism with excellent scalability with regards to round trip time, data rate and number of hosts. Show more
Citation: Journal of High Speed Networks, vol. 7, no. 2, pp. 159-185, 1998
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]