T. Choi, S. Yoon, H.S. Chung, J.S. Park, B. Lee, S. Yoon, T. Jeong
{"title":"On the design and performance of an Internet application traffic monitoring system","authors":"T. Choi, S. Yoon, H.S. Chung, J.S. Park, B. Lee, S. Yoon, T. Jeong","doi":"10.1109/IPOM.2004.1547590","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547590","url":null,"abstract":"In recent years, traffic measurement and analysis have received significant attention due to the increased requirements from various aspects such as SLA monitoring, P2P traffic monitoring and security attacks, etc. But technical challenges have been increased as well because link speed and traffic volume to measure have become huge and the characteristics of Internet applications, which takes major portion of entire traffic volume, have changed dramatically. Traffic measurement system has to deal with very high-speed links such as OC-48 and above. Newly emerging applications such as P2P, streaming, and network game applications don't follow the traditional application identification method, that is, the use of fixed port numbers. These applications, however, take most of the Internet bandwidth. In this paper, we propose novel mechanisms to cope with such challenges and provide performance study results of them. We have incorporated the proposed mechanisms into our proof-of-concept system called WiseTrafView, whose main target application is usage-based accounting.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125334110","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 preemption-aware path selection algorithm for DiffServ/MPLS networks","authors":"Yu-Kung Ke, Zhang Lin, Hui-min Zhang","doi":"10.1109/IPOM.2004.1547604","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547604","url":null,"abstract":"In a multi-service network in which multiple classes with different priorities and different QoS requirements exist, preemption is an efficient mechanism for bandwidth allocation and management. By considering preemption-related information in the path selection procedure, we can minimize rerouting and improve network stability. In this paper, we propose a preemption-aware bandwidth-constrained path selection algorithm for DiffServ-enabled MPLS networks. The basic idea is that the available resource reservation information of lower priority LSPs, i.e. the bandwidth to be preempted and the affected highest priority level, is introduced in the path selection. Simulations show that our proposed algorithm can achieve preemption minimization as well as load balancing, and efficiently improve overall network performance.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127919308","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 quality of service approach for managing tele-medicine multimedia applications requirements","authors":"A. Lage, J. Martins, J. Oliveira, W. Cunha","doi":"10.1109/IPOM.2004.1547615","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547615","url":null,"abstract":"Research reported in this paper presents the design principles, the services and the proposed architecture for a QoS provisioning and management framework. An experimental implementation and the measurements evaluating the QoS provided using different DiffServ mechanisms are also discussed. The research reported here relates to InfraVIDA development scenario, a tele-medicine system that intends to allow remotely located health professionals to make tele-diagnosis and get second medical opinion from consultants on central hospitals.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"1649 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125265261","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":"TPBT - a traversal probability based conformance testing method for protocols specified as communicating finite state machines","authors":"Xingang Shi, Jianping Wu, Xia Yin","doi":"10.1109/IPOM.2004.1547626","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547626","url":null,"abstract":"Conformance testing is the procedure to verify whether protocol implementations conform to their specifications. In this paper, we propose a traversal probability based conformance testing method - TPBT, which can be used to test protocols specified as communicating finite state machines (CFSM) efficiently. In fact, TPBT is a random walk based adaptive method, which aims to traverse all transitions in component machines in steps as few as possible. We apply it to two example CFSM models, and the results show that it achieves better performance than other random walk based adaptive methods. Applying TPBT to the mobile IPv6 protocol, all component machines' transitions are traversed within about 600 steps, for which pre-generated test cases are tedious long and error-prone.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125378157","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":"Managing grids communication infrastructure through policy translations","authors":"R. Neisse, L. Granville, M. Almeida, L. Tarouco","doi":"10.1109/IPOM.2004.1547629","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547629","url":null,"abstract":"Computing grids require the underlying network infrastructure to be properly configured in order to have appropriate communications among the grids' nodes. The management of networks and the management of grids are currently executed by different tools operated by different administrative personnel. Eventually, the grid communication requirements will need corresponding support from the network management tools, but such requirements are fulfilled only when grid administrators manually asks network administrators for corresponding configurations. In this paper we propose a policy translation mechanism that creates network policies given grid requirements expressed in grid policies. We also present a system prototype that allows (a) grid administrators to define grid policies, and (b) network administrators to define translating rules. These rules are used by the proposed translation mechanism to generate the necessary underlying network configuration policies.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131094619","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":"Control transmission pace at IP layer to avoid packet drop","authors":"Guojun Jin, Haina Tang","doi":"10.1109/IPOM.2004.1547593","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547593","url":null,"abstract":"Avoiding packet loss is critical for time sensitive network applications, such as multimedia streams for video/voice. Delaying and dropping low priority packets to ensure high priority and time sensitive data stream deliver during network congestion is a basic QoS (quality of service) mechanism over current network infrastructure. This mechanism works if time sensitive data stream is the minority of the network traffic and if the network is not very congested. The methodology of dropping low priority data does not scale when time sensitive data stream uses high percentage of network bandwidth. This is because bandwidth required by video/audio applications can vary in very wide range when real-time data becomes majority network traffic, that is, television (TV), telephone, visual telephone, videoconferencing, gaming, and other video/audio based applications are all deployed on Internet. Then, what is the proper percentage of bandwidth to reserve? and which packets should be dropped if available bandwidth is less than demanding? A major issue is that letting bottleneck routers drop packets is not a proper methodology to guarantee quality of service. If packets cannot be delivered due to exhausted network bandwidth, these packets should be tossed as earlier as possible to reduce bandwidth waste or should be delayed at transmission hosts for later transmission. Also, applications should have right to selectively toss data for enhancing service quality, rather than let routers randomly drop packets. Therefore, mechanisms to avoid packet drop need to be deployed in Internet infrastructure. This paper studies how well priority (class) based traffic shaping can help time sensitive data delivery, addresses technology of packet drop avoidance (PDA), and shows how packet drop avoidance mechanism improves real-time applications' performance by reducing bandwidth waste, packet delay and loss. This paper then addresses why PDA should be deployed in Internet protocol (IP) layer.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116219515","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 performance monitoring architecture for IP videoconferencing","authors":"Haina Tang, Lian Duan, Jun Yu Li","doi":"10.1109/IPOM.2004.1547591","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547591","url":null,"abstract":"In recent years, IP videoconferencing applications are promoting. Since video over IP is sensitive to delay and jitter, network providers are now deploying quality of services (QoS) to support real-time application requirement over their network. Our goal in this paper is to disseminate a performance monitoring architecture for IP videoconference, which is able to both detect end-to-end QoS degradation and locate where it occurs in the network path. We use this architecture to study how QoS affects videoconferencing performance and to analyze what QoS configuration parameter is most suitable to guarantee the delivery quality of IP videoconference.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116396990","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}
Jianguo Ding, Bernd J. Krämer, Shihao Xu, Hansheng Chen, Yingcai Bai
{"title":"Predictive fault management in the dynamic environment of IP networks","authors":"Jianguo Ding, Bernd J. Krämer, Shihao Xu, Hansheng Chen, Yingcai Bai","doi":"10.1109/IPOM.2004.1547622","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547622","url":null,"abstract":"The growing complexity of IP networks in terms of hardware components, operating system, communication and application software and the huge amount of dependencies among them have caused an increase in demand for network management systems, particularly in fault management An efficient fault detection system needs to work effectively even in face of incomplete management information, uncertain situations and dynamic changes. In this paper, dynamic Bayesian networks are proposed to model static and dynamic dependencies between managed objects in IP networks. Prediction strategies and a backward inference approach are provided for the proactive management in fault detection based on the dynamic changes of IP networks.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114800849","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":"On the difficulty of establishing interdomain LSPs","authors":"C. Pelsser, S. Uhlig, O. Bonaventure","doi":"10.1109/IPOM.2004.1547605","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547605","url":null,"abstract":"Nowadays, the success of MPLS is mostly due to the increasing demand for BGP/MPLS VPNs. Even though the need for interdomain LSPs is growing, no ISP today proposes the dynamic establishment of LSPs across AS boundaries. In this paper, we investigate the complexity of establishing end-to-end interdomain LSPs with QoS guarantees, based on the BGP routes locally available at a router. We explain the main issues of relying on BGP for the computation of interdomain constrained paths. To illustrate our point, we compare two LSP establishment techniques. Our benchmark technique is centralized and assumes the complete knowledge of the intradomain topologies. The second path computation technique is decentralized and relies on the BGP routes locally available by each router. Our simulations confirm that the difficulty in designing BGP-based interdomain LSP establishment techniques lies within the trade-off between the scalability of the computation technique and the quality of the path found in terms of the considered metrics.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134164059","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":"Web-pages sojourn times in high speed networks","authors":"S. Malik, U. Killat","doi":"10.1109/IPOM.2004.1547601","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547601","url":null,"abstract":"Processor sharing (PS) queuing systems have been historically applied for the estimation of file Sojourn times. We present a model for Web-pages sojourn times at the session-layer by incorporating the time spent by TCP in its slow start and congestion avoidance phases. The model is a function of not only the residual capacity of the bottleneck link but also of the packet loss probability and round trip time (RTT) delay. We show that the model effectively captures the Web-pages sojourn times in high speed networks.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122037855","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}