{"title":"Applying objective perceptual quality assessment methods in network performance modeling","authors":"A. Conway, Yali Zhu","doi":"10.1109/ICCCN.2002.1043055","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043055","url":null,"abstract":"A quantitative approach is developed for modeling and analyzing objectively the perceptual performance of computer-communication networks and computer systems that involve real-time human interaction and communication with real-time streamed signals such as audio, speech, or video. The proposed 'perceptual analysis' method is based on augmenting traditional system performance models with the incorporation of ITU-T recommended objective perceptual quality assessment methods such as PEAQ (perceived audio quality) or PESQ (perceptual evaluation of speech quality). The approach provides an avenue for including the quantitative evaluation of perceptual quality measures, such as MOS (mean opinion score), in system performance modeling. The analysis of a voice-over-IP network access link model with G.711 and G.729 multiplexed calls is presented to demonstrate a perceptual teletraffic engineering application.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131136633","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 flexible soft DiffServ test-bed","authors":"Z. Dwekat, K. Narasimhan, Y. Viniotis, M. Vouk","doi":"10.1109/ICCCN.2002.1043062","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043062","url":null,"abstract":"This paper reports on a teaching and research SLA test-bed that we have constructed using specially developed soft DiffServ routing nodes operating in a Linux environment. The test-bed, and the associated tools, are intended for various levels of study of SLA translation and mapping algorithms. It is instrumented to provide considerable insight into the DiffServ behavior. The software is more modular, flexible and easier to configure than the \"standard\" Linux DiffServ offerings. This paper presents the architecture of our system, and reports on the proof-of-concept experiments that show that it can be used to implement a general Services Level Agreement (SLA) solution and study related issues. Initial empirical studies involve implementation of some of the quality of service (QoS) related IETF drafts and RFCs in a five-node test-bed, including an implementation and empirical evaluation of expedited forwarding (EF) PHB, assured forwarding (AF) PHB, virtual wire (VW) PDB, and of assured forwarding PDB.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134590318","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":"Blocking probability in WDM switching networks with limited wavelength conversion","authors":"Xiangdong Qin, Yuanyuan Yang","doi":"10.1109/ICCCN.2002.1043105","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043105","url":null,"abstract":"We study the benefits of wavelength conversion in all-optical WDM switching networks. In particular, we focus on investigating network performance improvement by using the more realistic limited wavelength conversion. We present an analytical model for calculating the blocking probability of WDM switching networks with limited wavelength conversion and validate the model through simulations. The analytical and simulation results reveal that a significant improvement in the blocking performance of the network can be achieved by limited wavelength conversion with small conversion degrees (e.g., d=2,3,4). We take the view that utilizing limited wavelength conversion with small conversion degrees in a WDM switching network is a more cost-effective choice.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134287943","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":"Improving SLP efficiency and extendability by using global attributes and preference filters","authors":"Weibin Zhao, H. Schulzrinne","doi":"10.1109/ICCCN.2002.1043131","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043131","url":null,"abstract":"The paper presents two new mechanisms, global attributes and preference filters, that improve the efficiency and extendability of the service location protocol (SLP). Global attributes describe common service properties, which can be used to perform queries across different service types, and can be standardized for service management. Preference filters facilitate processing of search results, such as finding the best match, in SLP servers. They can reduce the amount of data transferred to the client, and better support thin clients with limited resources and capabilities.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133974602","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":"Access protocols for an efficient optical packet-switched metropolitan area ring network supporting IP datagrams","authors":"K. Bengi","doi":"10.1109/ICCCN.2002.1043079","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043079","url":null,"abstract":"Novel distributed medium access protocols for a time-slotted WDM metro ring employing optical packet switching and supporting variable-length data packets such as IP datagrams directly in the optical layer are proposed in this paper. In the underlying control-channel based network architecture, much more nodes than available wavelengths may be accommodated and each node is equipped with three transmitters (two fixed-tuned and one tunable) and two fixed-tuned receivers. The new access control scheme relies on a frame-based slot reservation strategy including reservation of successive slots for data packets longer than the given slot size, and immediate access for packets shorter than the slot length. Thus, an efficient EP-over-WDM metro network with simple receiver hardware is obtained.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134323852","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":"Implementation and evaluation of transparent fault-tolerant Web service with kernel-level support","authors":"N. Aghdaie, Y. Tamir","doi":"10.1109/ICCCN.2002.1043047","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043047","url":null,"abstract":"Most of the techniques used for increasing the availability of Web services do not provide fault tolerance for requests being processed at the time of server failure. Other schemes require deterministic servers or changes to the Web client. These limitations are unacceptable for many current and future applications of the Web. We have developed an efficient implementation of a client-transparent mechanism for providing fault-tolerant Web service that does not have the limitations mentioned above. The scheme is based on a hot standby backup server that maintains logs of requests and replies. The implementation includes modifications to the Linux kernel and to the Apache Web server, using their respective module mechanisms. We describe the implementation and present an evaluation of the impact of the backup scheme in terms of throughput, latency, and CPU processing cycles overhead.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133269302","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":"Router assisted schemes for performance improvement in the Internet","authors":"M. Viswanathan, A. Kamal","doi":"10.1109/ICCCN.2002.1043060","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043060","url":null,"abstract":"Congestion handling in the TCP protocol is through implicit feedback about the network conditions to the traffic source. If the feedback can be obtained sooner at the source, the congestion handling can be more effective. The goal of this work is to expedite the feedback process and enhance the performance of the Internet under congestion. We motivate the need for the proposed schemes with the help of a simplified analytical model which evaluates the time to detect a packet loss through duplicate acknowledgements. We show that this time can be significant when the number of flows going through a router is large. We then present two schemes, Triple Packet Buffering on Congestion, and Triple Truncated Packets, that enables congestion information to be fed back to the source faster. This results in a faster response to congestion conditions, and a faster retransmission of discarded packets. With the help of simulation results, we show that the proposed schemes perform better than the standard implementation in a variety of network scenarios and achieve higher throughput and lower mean delay. This scheme also does not require any changes in the standard TCP protocols, but a simple (optional) modification at the routers.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122066938","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":"RF Rendez-Blue: reducing power and inquiry costs in Bluetooth-enabled mobile systems","authors":"E. Hall, D. Vawdrey, C. Knutson","doi":"10.1109/ICCCN.2002.1043140","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043140","url":null,"abstract":"In resource-limited mobile computing devices, Bluetooth wireless technology imposes a weighty burden due to inefficient power utilization and a sluggish device discovery process. Buttressing Bluetooth with radiofrequency identification (RFID) technology by performing an operation we call \"Rendez-Blue\" alleviates these limitations. In the Rendez-Blue process, an RFID signal is used as a cue to \"wake-up\" a sleeping Bluetooth radio. This ensures that the Bluetooth radio is active only when needed, significantly reducing power consumption. In addition, RFID is used to communicate Bluetooth device information, allowing the user to bypass the traditional 10.24-second discovery process.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131884521","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":"An OSPF based load sensitive QoS routing algorithm using alternate paths","authors":"A. Sahoo","doi":"10.1109/ICCCN.2002.1043072","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043072","url":null,"abstract":"Real-time applications such as Voice over IP, audio and video streaming require quality of service (QoS). Such applications are being executed over the public Internet. Since today's Internet largely supports best effort traffic, QoS routing in the best effort environment is required to support real-time applications. Some QoS routing uses source routing and others use flooding of some QoS attributes of the nodes. There were also some variants of the shortest path algorithm reported in the literature. But those algorithms require changes to the packet forwarding engine and logic for loop detection. We believe a better way of implementing QoS routing is to localize the QoS routing changes to the region where QoS has deteriorated and choose loop-free alternate paths. We present such an algorithm based on OSPF (open shortest path first) called the LSR algorithm. In the LSR algorithm, congestion notification is limited to neighbors of the congested node and the neighbors try to use alternate next hops to route packets. Alternate LSR next hop is chosen in such a way that it preserves the next hop property of OSPF routing which enables the LSR algorithm to avoid a loop. We present three such methods to choose an alternate LSR next hop and prove that these methods provide loop-free routing. Our simulation results based on the three methods show that on average the LSR algorithm performs better than the OSPF algorithm in terms of delay and jitter.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125965701","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":"Enhancement of passive cluster based routing protocol for mobile adhoc networks","authors":"A. Rangaswamy, H. Pung","doi":"10.1109/ICCCN.2002.1043094","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043094","url":null,"abstract":"On-demand routing protocols in mobile ad hoc networks use a process called flooding to seek the route to a destination computer. This process usually incurs a very large overhead. We examine a protocol called passive cluster-based routing protocol (PCBRP). This protocol when applied on top of any of the current routing protocols provides substantial advantages in the form of reduced overhead during flooding, minimal or no setup time and formation of more stable mobile device clusters. There are however several enhancements that can be applied to this protocol to make it more efficient and provide better connectivity among the mobile nodes. Some of the assumptions made in PCBRP regarding network traffic may not be general or realistic enough for real-world network applications. We simulate our modified protocol under a number of different conditions and attempt to optimize it so that it can perform better under varying conditions of network traffic patterns and node positions.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114012663","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}