{"title":"Dynamic capacity management for voice over packet networks","authors":"N. Akar, C. Sahin","doi":"10.1109/ISCC.2003.1214261","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214261","url":null,"abstract":"In this paper, dynamic capacity management refers to the process of dynamically changing the capacity allocation (reservation) of a pseudo-wire established between two network end points. This process is based on certain criteria including instantaneous traffic load for the pseudo-wire, network utilization, time of day, or day of week. Frequent adjustment of the capacity yields a scalability issue in the form of a significant amount of message processing in the network elements involved in the capacity update process. On the other hand, if the capacity is adjusted once and for the worst possible traffic conditions, a significant amount of bandwidth may be wasted depending on the actual traffic load. There is then a need for dynamic capacity management that takes into account the tradeoff between scalability and bandwidth efficiency. This problem is motivated by voice over packet networks in which end-to-end reservation requests are initiated by PSTN voice calls and these reservations are aggregated into one signal reservation in the core packet network for scalability. In this paper, we introduce a Markov decision framework for an optimal reservation aggregation scheme for voice over packet networks. Moreover, for problems with large sizes, we provide a suboptimal scheme using reinforcement learning. We show a significant improvement in bandwidth efficiency in voice over packet networks using aggregate reservations.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130366548","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":"Effects of fast routers advertisement on mobile IPv6 handovers","authors":"G. Daley, B. Pentland, R. Nelson","doi":"10.1109/ISCC.2003.1214177","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214177","url":null,"abstract":"Mobile Ipv6 protocols are retrofit of mobility onto the next generation Internet (IPv6) protocols. Many of the original IPv6 protocols have inbuilt timing mechanisms which aim at ensuring fairness of access to media and signaling efficiency. The effects of these timers on mobile IPv6 traffic has been found to significantly affect application traffic on these networks. One proposal to remove unnecessary timers in neighbor discovery is called fast router advertisement (FastRA). This paper presents performance comparisons of FastRA with unmodified neighbor discovery in mobile IPv6 environments.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115994129","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":"Management of wireless dynamic infrastructures","authors":"R. State, O. Festor","doi":"10.1109/ISCC.2003.1214305","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214305","url":null,"abstract":"The advent of multi-technologies networks offering ubiquitous services over advanced wireless network infrastructure implies new challenges to integrated management. In this paper, we address this issue in building an integrated management approach for wireless and mobile infrastructures. We especially analyze the particularities of this environment and proposing a management architecture based on application based overlay networks.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116807322","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 fault-tolerant load-balancing protocol for distributed multiserver queuing systems","authors":"A. Kostin, G. Oz","doi":"10.1109/ISCC.2003.1214276","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214276","url":null,"abstract":"A simple and efficient scheme to achieve fault tolerance in a new load-balancing protocol for a distributed multiserver queuing system is proposed. It is assumed that the distributed queuing system consists of a job producer and a number of independent servers, or workers, who compete for produced jobs. All communications between the job producer and workers in the underlying network are based on reliable multicast. The proposed scheme is empirically investigated in a LAN of Ethernet type on a cluster of computers.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128430899","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 predictive and robust active queue management for Internet congestion control","authors":"Seungwan Ryu, Christopher M. Rump, C. Qiao","doi":"10.1109/ISCC.2003.1214245","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214245","url":null,"abstract":"Recently many active queue management (AQM) algorithms have been proposed to address performance degradations of end-to-end congestion control. However, these AQM algorithms show weaknesses to detect and control congestion under dynamically changing network situations. In this paper, we propose a predictive and robust AQM algorithm, called proportional-integral-derivative (PID)-controller, using PID feedback control the incipient as well as current congestion adaptively and proactively to dynamically changing network environments. A simulation study over a wide range of IP traffic conditions shows that PID-controller outperforms other AQM algorithms such as random early detection (RED) and proportional-integral (PI) controller in terms of the queue length dynamics, the packet loss rates, and the link utilization.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128711218","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":"AMCA: an active-based multicast congestion avoidance algorithm","authors":"M. Maimour, C. Pham","doi":"10.1109/ISCC.2003.1214207","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214207","url":null,"abstract":"Many works have addressed the issue of congestion control for multicast communications and the problem is known to be highly complex. Scalability, responsiveness, stability and fairness with TCP are some of the required properties. In this paper, we present a congestion avoidance scheme for bulk data distribution called AMCA (active-based multicast congestion avoidance algorithm) that tries to meet these properties. We use the active networking technology to perform on a per-section dialogue to probe for available bandwidth along a multicast tree. The solution uses the RTT variations experienced by every branch to estimate the congestion situation in the multicast tree. The physical multicast tree is also used to appropriately aggregate the RTT variations at intermediate nodes before they reach the source. Simulations show that AMCA converges, makes use of the available bandwidth and reacts rapidly to dynamic changes while being TCP-fair.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125974653","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":"Low-cost coordinated nonblocking checkpointing in mobile computing systems","authors":"Weigang Ni, Susan V. Vrbsky, S. Ray","doi":"10.1109/ISCC.2003.1214313","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214313","url":null,"abstract":"A mobile computing system consists of mobile and stationary nodes. Checkpointing in mobile systems faces many new challenges, such as low wireless bandwidth, frequent disconnections and lack of stable storage at mobile nodes. Previously proposed checkpoint algorithms for mobile environments do not take into consideration the coordinating message overhead of the mobile participants. In this paper, we propose a new checkpoint algorithm for mobile distributed systems. Our algorithm is nonblocking and minimizes the number of checkpoint participants. We propose a new idea called proxy coordinator. By using proxy coordinator, mobile participants' coordinating message overhead is minimized to O(1), which can otherwise be as high as O(n) in other proposed algorithms.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130090496","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}
Thomas Cofino, Y. Doganata, Youssef Drissi, Tong-Haing Fin, Lev Kozakov, Meir Laker
{"title":"Towards knowledge management in autonomic systems","authors":"Thomas Cofino, Y. Doganata, Youssef Drissi, Tong-Haing Fin, Lev Kozakov, Meir Laker","doi":"10.1109/ISCC.2003.1214214","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214214","url":null,"abstract":"The classical definition of knowledge management promises to get the right knowledge to the right people at the right time so they can make the best decision [G. Petrash, 1996]. Autonomic systems, on the other hand, are expected to find and apply the right knowledge for self-managing purposes without human intervention. This article discusses the components to be built around a system to enable self-healing and managing capabilities. These are defined and described in this article as self-knowledge, self-monitoring, self-learning, problem detection, diagnosis, and search and solution components. Interaction of these system components to make knowledge available for self-healing purposes is also discussed.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122921612","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 end-to-end QoS control scheme for video transmission over Internet","authors":"Hayrettin Genel, Y. M. Erten","doi":"10.1109/ISCC.2003.1214228","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214228","url":null,"abstract":"Real-time digital video transmission over Internet is a challenging problem. Real-time video traffic is bursty, cannot tolerate delays in delivery and requires a lot of bandwidth, which contrast with the characteristics of current Internet. In this work, we address the various aspects of the problem and present a work that makes use of the standards and proposed techniques in order to implement an efficient and robust real-time video transmission framework providing adequate video presentation quality over the best effort Internet offering no quality of service (QoS) guarantees.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116988442","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 traffic characteristics and bandwidth requirements of voice over IP applications","authors":"S. Sharafeddine, A. Riedl, J. Glasmann, J. Totzke","doi":"10.1109/ISCC.2003.1214297","DOIUrl":"https://doi.org/10.1109/ISCC.2003.1214297","url":null,"abstract":"Voice over IP (VoIP) services will play an important role in future IP networks, promising cost savings and new revenue sources to operators and service providers. To provide quality of service guarantees, certain mechanisms need to be implemented which support predictable packet handling, bandwidth allocation, and call admission control. In order to configure these mechanisms, a solid understanding of VoIP traffic characteristics and its respective bandwidth requirements is necessary. In this paper, we characterize traffic traces generated by various VoIP applications. According to the H.323 standard, the characteristics are described by means of token bucket parameters, which are then used to derive the required service rates for individual traffic flows. While in most cases sources send out fairly steady packet streams, there are situations where software based clients emit rather bursty traffic resulting in unreasonably high bandwidth needs. On basis of these traffic flows, we investigate the effects that token bucket parameters have on the bandwidth demand and discuss tradeoff possibilities in order to reduce it.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114564306","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}