{"title":"An architecture of wireless Web and dialogue system convergence for multimodal service interaction over converged networks","authors":"W. Chou, X. Shan, J. J. Li","doi":"10.1109/ICCCN.2002.1043048","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043048","url":null,"abstract":"This paper presents an approach based on wireless Web and dialogue system convergence for multimodal, multimedia communication services over converged networks. It uses a unique event-triggered service delivery method that separates service interaction and wirelessWeb-based service delivery. Our approach results in an architecture of WAP-based, location-independent, wireless service monitoring, notification and service access for mobile users that can be applied over various network bearers in enterprise environment. A new wireless secure server (WSS) provides secure connections to dialogue systems. It allows one-key switching to retrieve the multimedia content. A prototype system was implemented and performance advantages were demonstrated on several enterprise service applications.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"16 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":"121653391","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 lantern-tree-based QoS multicast protocol for wireless ad-hoc networks","authors":"Yuh-Shyan Chen, Yun-Wen Ko, Ting-Lung Lin","doi":"10.1109/ICCCN.2002.1043073","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043073","url":null,"abstract":"In this paper, we propose a lantern-tree-based QoS multicast protocol with a reliable mechanism for wireless ad-hoc networks, where the MAC sublayer adopts the CDMA-over-TDMA channel model. In this paper, we identify a lantern-tree for developing an on-demand QoS multicast protocol to satisfy certain bandwidth requirements from a source to a set of destination nodes. The lantern-tree serves as the multicast-tree. Our lantern-tree-based scheme offers a higher success rate to construct the QoS multicast tree due to using the lantern-tree. The lantern-tree is a tree whose sub-path is constituted by the lantern-path, where the lantern-path is a special multi-path structure. This greatly improves the success rate by means of multi-path routing. In particular, our proposed scheme can be easily applied to most existing on-demand multicast protocols. Performance analysis results demonstrate the QoS achievements of our proposed protocol.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"26 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":"125951985","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":"SUMA - the synchronous unscheduled multiple access protocol for mobile ad hoc networks","authors":"K. Grace","doi":"10.1109/ICCCN.2002.1043040","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043040","url":null,"abstract":"The use of unscheduled contention based channel access protocols in mobile ad hoc networks is very attractive due to their transparency to topological change, relatively low overhead, and ease of implementation. Recent reports (see Shugong Xu and Tarek Saadawi, IEEE Commun. Magazine, vol.39, no.6, p.130-7, 2001), however, have shown that the widely available asynchronous contention based 802.11 protocol has significant fairness issues, especially with regard to exposed terminals. These fairness issues are a direct result of the asynchronous nature of the protocol. We present SUMA, the synchronous unscheduled multiple access protocol, which has all the benefits of a contention based access protocol while ensuring fair access to all nodes.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"1 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":"128122545","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":"Transitional behaviors of general AIMD rate control","authors":"G. Xu, Y. Huang","doi":"10.1109/ICCCN.2002.1043057","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043057","url":null,"abstract":"Internet applications use rate control algorithms, such as the additive-increase/multiplicative-decrease (AIMD) mechanism of TCP, to adjust transmission rates dynamically. Previous analytical work of rate control algorithms mainly focuses on steady state behaviors, for instance, the steady state throughput. The goal of this paper is to analyze the General AIMD (GAIMD) rate control during transition periods, when traffic flows increase or decrease sending rates in response to changes in network conditions. We present mathematic characterizations of GAIMD flows in transition periods, verify our analytic results by simulation, and investigate the change responsiveness of GAIMD flows using our model. The results of this study show that our model is accurate unless under extremely adverse conditions. Moreover, such adverse conditions exist only for very short periods of time, and thus the errors of the proposed model are likely insignificant. Our results also reveal that previous estimation methods of change responsiveness consistently underestimate the lengths of transition periods. This research advances the understanding of how Internet traffic reacts to changes in network conditions. Such knowledge in turn are expected to help make informed design decisions of rate control algorithms.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"33 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":"131689502","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":"QoS negotiations and real-time renegotiations for multimedia communications","authors":"A. L. Chan, K. Law","doi":"10.1109/ICCCN.2002.1043118","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043118","url":null,"abstract":"The performance of multimedia applications on the Internet relates to network bandwidth availability, packet loss, and delay factors, as well as the human perceptions. Quality also links to the network delivery cost that a user is willing to pay. The paper presents a protocol, service bidding protocol, that allows multimedia applications to negotiate and re-negotiate on resource reservation with the networks. It enables a flexibility that applications can adapt to different network resources on-the-fly. This protocol works with the differentiated service (DiffServ) model, but can be extended easily to other service models. An implementation is constructed to evaluate the design performance.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"96 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":"132741342","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 reliable protocol for processing within IP-routed networks","authors":"Sonali Pandey, Arun Kumar Somani, A. Tyagi","doi":"10.1109/ICCCN.2002.1043050","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043050","url":null,"abstract":"The task of an Internet router is to scan the IP headers for the destination address and make a routing decision based on the information. If the processing capability of a router is enhanced to support computation on a datagram, some of the host computation may be delegated to the intermediate routers. The instructions about how to do the processing may be provided by the end hosts. We propose a reliable transport layer protocol, Intermediate Processing Protocol (IPP) for processing within the Internet. The protocol design makes provisions for connection set up handshake, router reservation, intermediate processing, data acknowledgement, buffering and retransmission, flow and congestion control, ordered delivery and security issues.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"13 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":"131670432","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 comparative study on the coherent approaches to cooperation between TCP and ATM congestion control algorithms","authors":"Q. Yu, D. Hoang, D. Feng","doi":"10.1109/ICCCN.2002.1043129","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043129","url":null,"abstract":"Numerous studies have indicated that ATM available bit rate (ABR) service can provide low-delay, fairness, and high throughput, and can handle congestion effectively inside the ATM network. However, network congestion is not really eliminated but rather it is pushed out to the edge of the ATM network, packets from TCP sources competing for the available ATM bandwidth are buffered in the routers or switches at the network edges, causing severe congestion, degraded throughput, and unfairness. This poor performance is mainly due to the uncoordinated interaction between the congestion control mechanism of TCP and ATM. It is well accepted that some form of cooperation at edge device would help to control TCP traffic flow over ATM more effectively. We have previously proposed the fair intelligent explicit window adaptation (FIEWA) scheme and fair intelligent ACK bucket control (FIABC) scheme. The key idea is to combine the feedback information from the receiver, from the underlying ATM network, and from the local information at the edge device intelligently to explicitly/implicitly control the TCP rate. We present a comparative simulation study on our schemes with other established schemes; to identify the characteristics of each different scheme; and to indicate the requirement for a fairer, simpler and more robust coherent approach at the edge device.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"113 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":"133627937","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 dynamic network scenario emulation tool","authors":"D. Herrscher, K. Rothermel","doi":"10.1109/ICCCN.2002.1043076","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043076","url":null,"abstract":"Comparative performance measurements of distributed applications and network protocols require the availability of appropriate network environments. Network emulation approaches offer a flexible way to mimic the properties of a variety of networks. Existing emulation tools work either with centralized real-time simulation components, limiting the scenario size and maximum traffic, or focus on the emulation of some network properties at a single point. We propose a tool for the realistic emulation of network links, and show how several emulated links can be combined to reproduce a comprehensive network model. In addition to that, the model can include changing network properties, e.g. emerging from mobile communication partners. This facilitates the distributed emulation of a comprehensive, dynamic network scenario to support repeatable performance measurements.","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":"132325922","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}
Zhuochuan Huang, Chien-Chung Shen, C. Srisathapornphat, C. Jaikaeo
{"title":"Topology control for ad hoc networks with directional antennas","authors":"Zhuochuan Huang, Chien-Chung Shen, C. Srisathapornphat, C. Jaikaeo","doi":"10.1109/ICCCN.2002.1043039","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043039","url":null,"abstract":"Topology control for ad hoc networks aims to increase effective network capacity and conserve energy. Most proposed algorithms assume the use of isotropic antennas and thus only adjust the transmission power of each node. We propose a distributed topology control mechanism for ad hoc networks with directional antennas that adjusts antenna pattern (direction) in addition to transmission power. Simulation studies have been conducted to demonstrate the effectiveness of the approach, as well as to investigate its benefits and impacts on application layer performance.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"190 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":"116531191","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 comparative study of QoS routing schemes that tolerate imprecise state information","authors":"Xin Yuan, Wei Zheng, Shiling Ding","doi":"10.1109/ICCCN.2002.1043071","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043071","url":null,"abstract":"In large networks, maintaining precise global network state information is almost impossible. Many factors, including non-negligible propagation delay, infrequent link state update due to overhead concerns, link state update policy, resource reservation, and hierarchical topology aggregation, have impacts on the precision of the global network state information. To achieve efficient quality of service (QoS) routing, a practical routing algorithm must be able to make effective routing decisions in the presence of imprecise global network state information. In this paper, we compare five QoS routing algorithms that were proposed to tolerate imprecise global network state information, safety-based routing, randomized routing, multi-path routing, localized routing, and static multi-path routing. The performance of these routing algorithms are evaluated under two link state update policies, the timer based policy and the threshold based policy. The strengths and limitations of each scheme are identified.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"18 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":"127338847","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}