{"title":"Integration of flow and QOS control in multicast routing","authors":"K. Ravindran, Xiliang Liu","doi":"10.1109/ICCCN.2002.1043116","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043116","url":null,"abstract":"Current works on QOS-routing allow flow and QOS control to be exercised on multicast paths after an underlying routing protocol (e.g., DVMRP and CBT) sets up these paths. The 'QOS-control-after-routing' paradigm limits the ability of routers to provide cost-efficient routing (in a network-wide sense) because they can explore only those paths already set up even if more cost-efficient alternate paths exist. This motivates the need to integrate routing with flow and QOS control, wherein alternate paths can be considered to enable cost-efficient path setups. The paper proposes scalable IntServ-style mechanisms at the flow management and routing protocol levels.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"38 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":"132522713","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":"TIP6: a transition mechanism for implementing mobile networks","authors":"Edgard Jamhour, Simone Storoz","doi":"10.1109/ICCCN.2002.1043089","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043089","url":null,"abstract":"The use of the IPv4 protocol in mobile networks has considerably increased the number of hosts that can potentially access the global Internet. Because the IPv4 address space is almost exhausted, the pressure for more IP addresses has increased again the attention on the IPv6 protocol. Because the transition from IPv4 to IPv6 is supposed to gradually happen, IETF is publishing a set of transition mechanisms that permits communicating IPv6 and IPv4 hosts and network devices. This paper describes an approach for implementing mobile networks with global Internet connectivity using transition mechanisms. It consists in virtually assigning IPv6 addresses to IPv4 hosts without modifying end-user devices. As shown in the paper, it permits the deployment of mobile networks with global Internet connectivity using legacy IPv4 equipments and private IPv4 addresses.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"78 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":"133289455","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":"Considerations for scheduling and servicing events using a calendar structure","authors":"W. Olesinski, R. Robotham, M. Aïssaoui, Jordan Lu","doi":"10.1109/ICCCN.2002.1043041","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043041","url":null,"abstract":"Networks are supposed to support multiple service categories that include real-time services and best-effort services. In both types of applications, it is important to differentiate between the requirements of different streams, and allow for an appropriate distribution of resources among them. Work-conserving disciplines may be implemented with the use of queue or scheduling calendars. Since calendars have finite resolutions, theoretical emission times that determine the positions of frames within the calendar slots have to be rounded to match the boundaries of the slots. The selection of a rounding method affects the performance of a work-conserving discipline. We present an efficient calendar structure and examine several rounding methods.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"136 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":"131851623","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 pragmatic approach for service provisioning based on a small set of per-hop behaviors","authors":"V. Sander, M. Fidler","doi":"10.1109/ICCCN.2002.1043061","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043061","url":null,"abstract":"In this paper we describe the implementation of a network providing advanced services such as a Premium service that aims at providing low loss, low delay, and low delay jitter and an Olympic service that allows for a service differentiation in terms of delay within three additional classes. Our implementation of this network is based on the Differentiated Services Architecture, which is the most recent approach of the Internet Engineering Task Force towards quality of service. Access to service classes is controlled by a bandwidth broker, which can perform traffic engineering by means of multiprotocol label switching. The Premium service is implemented as expedited forwarding and the Olympic service as a group of assured forwarding per-hop-behavior. We present a thorough evaluation of the proposed services implemented by the careful assignment of micro-flows to a small set of per-hop behaviors.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"128 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":"128670438","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":"Performance evaluation of path searching heuristics for multicast QoS routing","authors":"D. Zappala, Dayi Zhou","doi":"10.1109/ICCCN.2002.1043074","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043074","url":null,"abstract":"Quality of service routing for multicast enables a group member to find and install a branch of the multicast tree that can meet its QoS constraints. The most promising protocols in this area use receiver-oriented path searching heuristics to find feasible routes. In this paper, we examine the performance of the path searching heuristics used by these protocols, to determine which techniques are the most effective. We find that several low-overhead path searching heuristics are effective, and that generic path searching can work as well as targeted, QoS-specific searching.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"86 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":"126138953","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 distributed control scheme for causality and media synchronization in networked multimedia games","authors":"Y. Ishibashi, S. Tasaka","doi":"10.1109/ICCCN.2002.1043059","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043059","url":null,"abstract":"This paper proposes a distributed control scheme for causality and media synchronization in networked games where plural media streams such as computer data, voice, and video are dealt with together. According to the network load, the scheme adaptively preserves the temporal and causal relationships which exist among the media streams. It also performs group (or inter-destination) synchronization control, which adjusts the output timing among terminals for keeping the fairness among them. Furthermore, it exerts error control over computer data and video traffic control. We demonstrate the effectiveness of the scheme by carrying out an experiment of a networked shooting game.","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":"130316177","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":"Fully power-aware and location-aware protocols for wireless multi-hop ad hoc networks","authors":"Y. Tseng, Ten-Yueng Hsieh","doi":"10.1109/ICCCN.2002.1043135","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043135","url":null,"abstract":"A mobile ad hoc network (MANET) is one consisting of a set of mobile hosts which can operate independently without infrastructure base stations. Power saving is a critical issue for MANET since most mobile hosts will be operated by battery power. In this paper, we address the power-saving issue for IEEE 802.11-based MANET from several protocol layers, including physical, MAC, and network layers. Our solution is fully power-aware and location-aware in the sense that it exploits location information of mobile hosts to achieve energy conservation on all these protocol layers. In comparison, existing protocols only exploit location information in limited layers (e.g., power control, power mode management, power-aware MAC, and power-aware routing). Similar to cellular networks, our approach is based on partitioning the network area into squares/hexagons, thus leading to a powerful energy and mobility management capability.","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":"130367893","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 multicast framework for multimedia applications","authors":"De-Kai Liu, Ren-Hung Hwang, Jenq-Muh Hsu","doi":"10.1109/ICCCN.2002.1043067","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043067","url":null,"abstract":"Describes a novel framework, which supports scalable and efficient multicast transmission for distributed multimedia applications, referred to as SEMA. SEMA has two key features: scalable and efficient multicasting, and information classification. In the proposed SEMA, the scalable and efficient multicast mechanism takes time constraints of multimedia transmission into account. Hence, it is suitable for multimedia transmission having the real-time properties. Simulations are performed to justify the scalability and efficiency features. Additionally, information classification can encourage multimedia servers to decompose original multimedia streams into several layered sub-streams such that each sub-stream has part of the presentation capability and can be transmitted to media clients on a chosen multicast group. Media clients then can choose what sub-streams to receive according to their playback capability.","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":"128910845","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 applications of analyzing cellular digital packet data (CDPD) billing data","authors":"Allison T. Gau, S. Hardy, T. Randhawa","doi":"10.1109/ICCCN.2002.1043078","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043078","url":null,"abstract":"This paper investigates the management applications of analyzing CDPD billing data. Using three non-contiguous weeks of data, we demonstrate how to extract usage patterns, detect registration idiosyncrasies and network faults, and chart the impact of signing roaming agreements with other carriers. We describe the fields available in billing data and how to collect parameters of interest with these fields. Demonstrating how to extract usage parameters, we graph the number of successful registrations and packets transmitted on a temporal and geographical basis. We detail an approach to detect and locate faults resulting in discarded packets. We describe the difficulties in detecting mobility patterns. The impact of foreign mobiles on a network is also explored. Further research into the analysis of billing data will help both researchers and service providers learn about their current implementations and plan future networks.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"70 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":"115543096","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":"Different implementations of token tree algorithm for DWDM network protection/restoration","authors":"Yuna Zhang, O. Yang","doi":"10.1109/ICCCN.2002.1043080","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043080","url":null,"abstract":"High-speed optical networks need efficient protection/restoration schemes. A heuristic distributed MST algorithm, called the token tree (TT) algorithm, is proposed in this paper. The TT algorithm consists of four subalgorithms, Namely the upward root selection (URS) algorithm, the star token polling (STP) algorithm, the passive state (PS) algorithm and the active state (AS) algorithm cooperate together to form a logical spanning tree for network protection. Tokens are polled between the PS and AS algorithm and thus decide the node sequence in a spanning tree. The restoration strategy lies in two points: using tree links to protect non-tree links, and seeking a shortest path from a node to its parent in order to protect the corresponding tree link. Performance analysis of the algorithms is performed in some topologies based on existing networks.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"133 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":"114122638","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}