{"title":"Tail probabilities for a multiplexer with self-similar traffic","authors":"M. Parulekar, A. Makowski","doi":"10.1109/INFCOM.1996.493094","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493094","url":null,"abstract":"We consider the large buffer asymptotics of a multiplexer under two different self-similar traffic input models, viz., the infinite server model of Cox and the fractional Gaussian noise input model. In the former case the tail probabilities for the buffer content (in steady state) are shown to decay at most hyperbolically, while in the latter they are asymptotically Weibullian. Therefore, for given input rate and Hurst parameter, these dissimilar asymptotics result in vastly differing buffer engineering practices, thereby pointing to the inadequacy of the Hurst parameter as the sole parameter to characterize long-range dependence in traffic input models.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121321709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Network security via reverse engineering of TCP code: vulnerability analysis and proposed solutions","authors":"Biswaroop Guha, B. Mukherjee","doi":"10.1109/INFCOM.1996.493354","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493354","url":null,"abstract":"The transmission control protocol/Internet protocol (TCP/IP) suite is widely used to interconnect computing facilities in modern network environments. However, there exist several security vulnerabilities in the TCP specification and additional weaknesses in a number of its implementations. These vulnerabilities may enable an intruder to \"attack\" TCP-based systems, allowing him/her to \"hijack\" a TCP connection or cause denial of service to legitimate users. We analyze TCP code via a \"reverse engineering\" technique called \"slicing\" to identify several of these vulnerabilities, especially those that are related to the TCP state-transition diagram. We discuss many of the flaws present in the TCP implementation of many widely used operating systems, such as SUNOS 4.1.3, SVR4, and ULTRIX 4.3. We describe the corresponding TCP attack \"signatures\" (including the well-known 1994 Christmas Day Mitnick Attack) and provide recommendations to improve the security state of a TCP-based system, e.g., incorporation of a \"timer escape route\" from every TCP state.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123098969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A bandwidth allocation protocol for MPEG VBR traffic in ATM networks","authors":"S. El-Henaoui, R. Coelho, S. Tohmé","doi":"10.1109/INFCOM.1996.493053","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493053","url":null,"abstract":"A periodic allocation protocol, called anticipated traffic allocation protocol (ATAP) for real time VBR traffic is proposed. The main objective of this protocol is to dynamically allocate the available bandwidth to real-time VBR sources, i.e. to be more efficient than the CBR allocation and at the same time more secure that the \"walk-in\" allocation. The ATAP unit is located at the network entry node between the real-time encoder and the applied bandwidth allocation protocol in the network, the fast reservation protocol FRP/DT. This reservation protocol cannot satisfy the real-time requirements, since the source would have to wait at least a round trip delay to reserve a required bandwidth increase. Hence, the ATAP proposes to anticipate and allocate the bandwidth one period in advance. This permits the encoder to adjust its coding bit rate according to the network loading condition. Doing so, a congestion will gracefully degrade the subjective quality of the signal, instead of \"blindly\" loosing cells at the network entry node. A minimum bit rate negotiated at the connection set-up is always guaranteed to assure the connection continuity in the case of the case of bandwidth reservation refusal. On the network side, the ATAP interacts with the FRP/DT. Reservation failures are used as congestion indicators to control the entering traffic and to adjust the cell priority. A simulation analysis investigates the performance of the ATAP and its interaction with the FRP/DT for two real MPEG VBR audio sequences under different bit rate anticipation approaches.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126308156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"RMTP: a reliable multicast transport protocol","authors":"J. Lin, S. Paul","doi":"10.1109/INFCOM.1996.493090","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493090","url":null,"abstract":"This paper describes the design and implementation of a multi-cast transport protocol called RMTP. RMTP provides sequenced, lossless delivery of bulk data from one sender to a group of receivers. RMTP achieves reliability by using a packet-based selective repeat retransmission scheme, in which each acknowledgment (ACK) packet carries a sequence number and a bitmap. ACK handling is based on a multi-level hierarchical approach, in which the receivers are grouped into a hierarchy of local regions, with a designated receiver (DR) in each local region. Receivers in each local region periodically send ACKs to their corresponding DR, DRs send ACKs to the higher-level DRs, until the DRs in the highest level send ACKs to the sender, thereby avoiding the ACK-implosion problem. DRs cache received data and respond to retransmission requests of the receivers in their corresponding local regions, thereby decreasing end-to-end latency and improving resource usage. This paper also provides the measurements of RMTP's performance with receivers located at various sites in the Internet.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125164213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A server array approach for video-on-demand service on local area networks","authors":"Jack Y. B. Lee, P. Wong","doi":"10.1109/INFCOM.1996.497874","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.497874","url":null,"abstract":"Most video-on-demand (VOD) systems use a single, powerful server to deliver video streams to users. We consider a novel server array approach for delivering video services on networks. Such an approach has the benefits of (l) greater system capacity, as individual server has individual disk and network channel, (2) scalability, as more clients can be supported by adding more servers without data duplication, and (3) fault tolerance, as server-level fault-tolerant and fault-recovery schemes can be devised. We describe our experiences and results in the implementation of a server-array-based VOD system. Our system now has four P5-90 servers serving 40 PC-486 stations using a 10 Mbps Ethernet switch. The system can deliver 40 simultaneous and independent 1.2 Mbps, 30 fps, full TV size, MPEG-1 video streams. Our results demonstrate that with careful protocol design, Ethernet can deliver continuous video and audio services.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132747754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Carry-over round robin: a simple cell scheduling mechanism for ATM networks","authors":"D. Saha, S. Mukherjee, S. Tripathi","doi":"10.1109/INFCOM.1996.493357","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493357","url":null,"abstract":"We propose a work-conserving scheduling mechanism for providing deterministic performance guarantees in ATM networks. The most attractive feature of the proposed mechanism, which we call carry-over round robin (CORR), is its simplicity. It is an extension of weighted round robin scheduling. We have derived closed form bounds for worst case end-to-end delay when CORR is used in conjunction with the composite leaky bucket, and moving window regulators. Our results show that albeit its simplicity, CORR is very competitive with some of the more complex scheduling disciplines such as packet-by-packet generalised processor sharing and stop-and-go queueing.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"381 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134051383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"\"call-level\" and \"burst-level\" priorities for an effective management of multimedia services in UMTS","authors":"A. Iera, S. Marano, A. Molinaro","doi":"10.1109/INFCOM.1996.493084","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493084","url":null,"abstract":"It is not an easy task in the UMTS environment to effectively design the transport and the management of traffic belonging to multimedia teleservices, due to the difficult communication requirements of such applications. It is proposed to contemporary use at the \"transport\" layer of the system several bearers, one for each traffic component of the multimedia service. Furthermore, a two-level (static and dynamic) priority mechanism is to be adopted by the higher protocol levels of the UMTS for the adaptation of call set-up, channel access, and admission control procedures to the nature of the multimedia services and to optimise the sharing of radio channel resources and the management of the reservation buffer. The results achieved demonstrate that the proposed mechanism shows a good performance especially during periods in which the system traffic load is high and reacts well to the worsening of the multimedia service quality, both in terms of information loss and synchronisation of its traffic components.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114749944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A simple approximation for modeling nonstationary queues","authors":"Wei-Pang Wang, D. Tipper, S. Banerjee","doi":"10.1109/INFCOM.1996.497901","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.497901","url":null,"abstract":"Evaluation of the behavior of queues with nonstationary arrival processes is of importance in several applications including communication networks. However, the analysis of nonstationary queues is in general computationally complex and seldom produces closed form expressions. Thus approximation methods may be more appropriate. The pointwise stationary fluid flow approximation (PSFFA) for determining the mean queue length of nonstationary queues is presented. The PSFFA combines steady state queueing results with a simple fluid flow model to develop a single nonlinear differential equation model of the queue. Numerical integration techniques are used to solve the PSFFA model and the method is illustrated by several examples. The power of this approach is that it can handle very general queueing systems.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"65 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116163183","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Timescale of interest in traffic measurement for link bandwidth allocation design","authors":"Yonghwan Kim, San-qi Li","doi":"10.1109/INFCOM.1996.493371","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493371","url":null,"abstract":"Consider the link bandwidth allocation for transport of correlated traffic through a queueing system under a maximum allowable delay constraint d/sub max/. We decomposed the traffic into three frequency regions: low-frequency traffic in 0<|/spl omega/|/spl les//spl omega//sub L/, high-frequency traffic in |/spl omega/|/spl ges//spl omega//sub H/ and mid-frequency traffic in /spl omega//sub L/<|/spl omega/|</spl omega//sub H/. The zero-frequency component (DC term) of the traffic provides the average input rate which corresponds to the minimum link bandwidth requirement. Subject to delay constraint d/sub max/, we identify /spl omega//sub /spl lambda//=0.01/spl pi//d/sub max/ and /spl omega//sub H/=2/spl pi//d/sub max/. Hence, the transport of low-frequency traffic exceeds the limit of d/sub max/-constrained buffer capacity; its link bandwidth is essentially captured by its peak rate. In contrast, for the transport of high-frequency traffic the d/sub max/-constrained buffering is most effective and no additional link bandwidth is required. Essentially, the solution of /spl omega//sub L/ and /spl omega//sub H/ plays a role as \"sampling theory\" in traffic measurement for buffer capacity design and link bandwidth allocation. Equivalently in the time domain, the timescale of the low-frequency traffic is longer than or equal to 200d/sub max/; the timescale of high-frequency traffic is shorter than or equal to d/sub max/. Since the link bandwidth allocation of low- and high-frequency traffic requires no measurement of second-order statistics, the timescale of interest for traffic measurement must be identified in [d/sub max/, 200d/sub max/].","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115423576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"GoS-based pricing and resource allocation for multimedia broadband networks","authors":"Hongbin Ji, J. Hui, Ezhan Karasan","doi":"10.1109/INFCOM.1996.493044","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493044","url":null,"abstract":"Broadband network are developed to carry a wide range of traffic which has different characteristics and grade-of-service (GoS) requirements. To meet these distinct requirements, we propose to decompose each network component into multiple sub-components. Each sub-component has a dedicated bandwidth and buffer, and it only carries traffic which has a similar GoS requirement. Thus it will reduce the interference from other types of traffic which has totally different GoS requirements. First, we develop a GoS-based pricing scheme which will entail the resources are efficiently utilized. The equilibrium stability is also studied. Then we address the problem of how to optimally allocate available resources among the sub-components. Resource expansion becomes necessary when the network is congested. Two kinds of routing schemes are proposed. One is least cost routing for GoS-insensitive traffic and the other is best GoS routing for GoS-sensitive traffic.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122942044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}