Extensible signaling for temporal resource sharing

被引:0
作者
Chandra, PR [1 ]
Steenkiste, P
Fisher, A
机构
[1] Intel Corp, San Jose, CA 95134 USA
[2] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA 15213 USA
[3] Carnegie Mellon Univ, Dept Elect & Comp Engn, Pittsburgh, PA 15213 USA
[4] Carnegie Technol Educ, Pittsburgh, PA 15213 USA
关键词
active networks; resource allocation; signaling protocols;
D O I
10.1109/49.917705
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The internet is rapidly evolving from a network that provides basic best-effort communication service to an infrastructure capable of supporting complex value-added services. These services typically have multiple flows with interdependent resource requirements. These dependencies provide opportunities to share the same set of resources among related flows over time leading to significant resource gains. We call this type of sharing temporal resource sharing. Exploiting temporal sharing requires support in the signaling protocol that performs resource allocation for the related flows. In this paper, we examine the problem of supporting temporal sharing in a signaling protocol. This paper makes the case that temporal sharing support must be designed to be extensible, so that service providers ran define and implement new sharing behaviors without having to modify the signaling protocol. We motivate the need for an extensible design by showing that the range of possible temporal sharing behaviors is large and supporting the most general forms of temporal sharing is computationally expensive. We then present a design for extensible signaling support for temporal sharing, We have implemented the temporal sharing design presented in this paper in the Beagle signaling protocol. We present an evaluation of the Beagle design and contrast it with other signaling protocols like RSVP and Tenet-2.
引用
收藏
页码:438 / 451
页数:14
相关论文
共 23 条
[1]  
[Anonymous], 1997, P ACM SIGCOMM 1997 O
[2]  
BRADEN R, 1995, DESIGN RSVP PROTOCOL
[3]  
CAMPBELL AT, 1999, COMPUT COMMUN REV, V29, P7
[4]  
Cho K, 1998, PROCEEDINGS OF THE USENIX 1998 ANNUAL TECHNICAL CONFERENCE, P247
[5]  
Cormen T. H., 1990, INTRO ALGORITHMS
[6]  
DELGROSSI L, 1995, 1819 RFC
[7]   LINK-SHARING AND RESOURCE-MANAGEMENT MODELS FOR PACKET NETWORKS [J].
FLOYD, S ;
JACOBSON, V .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1995, 3 (04) :365-386
[8]   Random Early Detection Gateways for Congestion Avoidance [J].
Floyd, Sally ;
Jacobson, Van .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1993, 1 (04) :397-413
[9]  
GUPTA A, 1995, IEEE INFOCOM SER, P1230, DOI 10.1109/INFCOM.1995.516002
[10]  
STOICA I, 1998, P ACM SIGCOMM 98 VAN, P118