Pub Date : 2022-01-16DOI: 10.4269/ajtmh.2008.79.1a
J. Rosenthal, D. Gilliam, M. Alber, J. Ball, V. Blondel, K. Gałkowski, T. Georgiou, Koichi Hashimoto, B. Hanzon, M. E. Valcher, V. Vinnikov, Xiaochang A. Wang, S. Zampieri, B. Datta, J. Helton
s of Presented Talks Monday August 12, 2002 8:30-9:30 Room : 101 Plenary Talk Bruce Hajek (University of Illinois) A Basket of System Theoretic Problems in Communications Researchers are currently faced with a rich set of problems in the design and analysis of wireless communication systems and high-speed communication networks. The purpose of this talk is to survey several significant open problems which system theory could play a role in solving. The problems include: (a) Providing delay constraints in a large communication network in a distributed way, using delay calculus based on the max-plus algebra, (b) Finding the capacity of cellular networks (will survey the recent use of the theory of large random matrices and related free probability theory), (c) Predicting efficiency and fairness, and designing allocation mechanisms, for the Internet, as thousands of autonomous systems interact through self-interested pricing and congestion, and (d) Distributing limited routing information in a large amorphous network, such as a peer-to-peer network or ad hoc sensor array, to facilitate position location. 9:30-10:30 Room : 101 Invited Talk Roger Brockett (Harvard University) Optimal System Identification for NMR Applications In a wide variety of settings, the measurement of nuclear magnetic resonance (NMR) effects has proven to be a remarkably effective for investigating unknown structures on both large and small scales. Over the years a large body of technique has been developed for improving the sensitivity and resolution of NMR measurements and many recent advances in biochemistry and medicine are dependent on the sophisticated signal processing techniques now used routinely. From a system theoretic perspective, problems in this area can be thought of as identification problems involving bilinear systems. They are distinguished from linear system identification problems by the fact that the quality of the identification is strongly dependent upon the form of the excitatory input applied to the system. Many ingenious techniques, such as the “two dimensional” Fourier transform procedure have been developed based on particular types of input patterns. Because of the low signal to noise ratios inherent in NMR, the optimization of such methods requires the use of stochastic models for the dynamics and measurement processes. In this talk we take a fresh look at problems in this area with a view toward finding computational procedures that will determine the inputs which will optimize specific performance measures. In particular, we explore performance measures related to conditional entropy, and in this way develop a formalism for establishing the mathematical limits on what can be accomplished with better input design. 9:30-10:30 Room : 102 Invited Talk Hans-Andrea Loeliger (ETH) Factor Graphs, Least Squares and Kalman Filtering Factor graphs are graphical models with origins in coding theory and with close relations to Willems-type behavioral system t
{"title":"Final program","authors":"J. Rosenthal, D. Gilliam, M. Alber, J. Ball, V. Blondel, K. Gałkowski, T. Georgiou, Koichi Hashimoto, B. Hanzon, M. E. Valcher, V. Vinnikov, Xiaochang A. Wang, S. Zampieri, B. Datta, J. Helton","doi":"10.4269/ajtmh.2008.79.1a","DOIUrl":"https://doi.org/10.4269/ajtmh.2008.79.1a","url":null,"abstract":"s of Presented Talks Monday August 12, 2002 8:30-9:30 Room : 101 Plenary Talk Bruce Hajek (University of Illinois) A Basket of System Theoretic Problems in Communications Researchers are currently faced with a rich set of problems in the design and analysis of wireless communication systems and high-speed communication networks. The purpose of this talk is to survey several significant open problems which system theory could play a role in solving. The problems include: (a) Providing delay constraints in a large communication network in a distributed way, using delay calculus based on the max-plus algebra, (b) Finding the capacity of cellular networks (will survey the recent use of the theory of large random matrices and related free probability theory), (c) Predicting efficiency and fairness, and designing allocation mechanisms, for the Internet, as thousands of autonomous systems interact through self-interested pricing and congestion, and (d) Distributing limited routing information in a large amorphous network, such as a peer-to-peer network or ad hoc sensor array, to facilitate position location. 9:30-10:30 Room : 101 Invited Talk Roger Brockett (Harvard University) Optimal System Identification for NMR Applications In a wide variety of settings, the measurement of nuclear magnetic resonance (NMR) effects has proven to be a remarkably effective for investigating unknown structures on both large and small scales. Over the years a large body of technique has been developed for improving the sensitivity and resolution of NMR measurements and many recent advances in biochemistry and medicine are dependent on the sophisticated signal processing techniques now used routinely. From a system theoretic perspective, problems in this area can be thought of as identification problems involving bilinear systems. They are distinguished from linear system identification problems by the fact that the quality of the identification is strongly dependent upon the form of the excitatory input applied to the system. Many ingenious techniques, such as the “two dimensional” Fourier transform procedure have been developed based on particular types of input patterns. Because of the low signal to noise ratios inherent in NMR, the optimization of such methods requires the use of stochastic models for the dynamics and measurement processes. In this talk we take a fresh look at problems in this area with a view toward finding computational procedures that will determine the inputs which will optimize specific performance measures. In particular, we explore performance measures related to conditional entropy, and in this way develop a formalism for establishing the mathematical limits on what can be accomplished with better input design. 9:30-10:30 Room : 102 Invited Talk Hans-Andrea Loeliger (ETH) Factor Graphs, Least Squares and Kalman Filtering Factor graphs are graphical models with origins in coding theory and with close relations to Willems-type behavioral system t","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124171742","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}
Pub Date : 2014-12-29DOI: 10.1109/APNOMS.2014.6996534
Ting-Wei Lee, Yen-Lin Chiu, Yu-Shan Wu, Heng-Sung Liu
The customer analysis can be applied widely in many situations, such as surveillance system, digital signage, store entrance, etc. In digital signage application, when customers are viewing ads, the system can automatically analyze multiple attributes of customers, including customer's gender, age, height, viewing distance, the degree of interest and total number of visitors. The advertising companies or store owners can judge potential customers who might interest in some particular products and increase the probability of the products being purchased through those customer analysis data. Another application in the store entrance is to calculate the total number of customers, gender and age statistical results in each time interval. That significant information can be used not only to integrate with point of sale (POS) system for letting the customers has a relationship with their purchased products but also to make the staff arrangement more adequate. The important equipment used in this system is the RGB-D sensor (Xtion Pro Live) which can capture the 3D depth information and 2D color image simultaneously. According to the 3D depth information, the system can detect and track the human to get the viewing distance, height and total number of visitors. Then the 2D image recognition technology is adopted to detect the face from human contour region and to recognize their gender, age and attention time for degree of interest. Finally, the system returns the analysis results and statistical information to the advertising companies or store owners for providing a reference in their business strategy.
客户分析可以广泛应用于监控系统、数字标牌、店铺入口等场合。在数字标牌应用中，当客户在观看广告时，系统可以自动分析客户的多个属性，包括客户的性别、年龄、身高、观看距离、兴趣程度、访客总数等。广告公司或店主可以通过这些客户分析数据来判断可能对某些特定产品感兴趣的潜在客户，并增加购买该产品的概率。在商店入口的另一个应用是计算每个时间间隔内的顾客总数，性别和年龄统计结果。这些重要的信息不仅可以用于与销售点(POS)系统的集成，让客户与他们购买的产品建立关系，而且可以使人员安排更加充分。该系统使用的重要设备是RGB-D传感器(Xtion Pro Live)，它可以同时捕获三维深度信息和二维彩色图像。系统根据三维深度信息，对人进行检测和跟踪，得到观看距离、高度和总人数。然后采用二维图像识别技术从人体轮廓区域检测人脸，识别其性别、年龄和关注时间的兴趣度。最后，系统将分析结果和统计信息返回给广告公司或店主，为他们的经营策略提供参考。
{"title":"An intelligent image-based customer analysis service","authors":"Ting-Wei Lee, Yen-Lin Chiu, Yu-Shan Wu, Heng-Sung Liu","doi":"10.1109/APNOMS.2014.6996534","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996534","url":null,"abstract":"The customer analysis can be applied widely in many situations, such as surveillance system, digital signage, store entrance, etc. In digital signage application, when customers are viewing ads, the system can automatically analyze multiple attributes of customers, including customer's gender, age, height, viewing distance, the degree of interest and total number of visitors. The advertising companies or store owners can judge potential customers who might interest in some particular products and increase the probability of the products being purchased through those customer analysis data. Another application in the store entrance is to calculate the total number of customers, gender and age statistical results in each time interval. That significant information can be used not only to integrate with point of sale (POS) system for letting the customers has a relationship with their purchased products but also to make the staff arrangement more adequate. The important equipment used in this system is the RGB-D sensor (Xtion Pro Live) which can capture the 3D depth information and 2D color image simultaneously. According to the 3D depth information, the system can detect and track the human to get the viewing distance, height and total number of visitors. Then the 2D image recognition technology is adopted to detect the face from human contour region and to recognize their gender, age and attention time for degree of interest. Finally, the system returns the analysis results and statistical information to the advertising companies or store owners for providing a reference in their business strategy.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127255854","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}
Pub Date : 2014-12-29DOI: 10.1109/APNOMS.2014.6996516
N. Ohkawa, Y. Nomura
Degradation of networking quality is a serious problem for service providers (e.g., on-demand video subscription service) since it causes customer defection in their services and results in a decline of their sales. Insufficient path capacity is one of the typical causes which degrade networking quality. Especially, the recent technical trend to shift virtualized network, in which the network is dynamically and autonomically reconfigured, increases the risk of unexpected insufficiency of the path capacity in the network. To detect such an unexpected insufficiency of path capacity, a constant monitoring of the whole network is highly expected. Path capacity estimation with passive measurement method is an approach which suits to such a purpose since it adds no additional load to the target network. However, existing passive measurement methods tend to either 1) have insufficient accuracy on their estimation or 2) require heavy computational cost for their histogram analyses. In this paper, we introduce a novel path capacity estimation method by passive measurement for a constant monitoring of a network 24hour, 365-day. Our method can estimate the capacity of each path with sufficient accuracy by eliminating the two factors of degrading the estimation accuracy, which are the influence of TCP window flow control and the influence of cross traffic on the path. We evaluated our method using packets captured from our in-company backbone network. Our method accurately estimated the capacity of the narrowest link in every 1524 connections, in which 80% of the connections were within approximately 15% of their actual values (in over 1MB traffic case), as shown in Fig. 8.
{"title":"Path capacity estimation by passive measurement for the constant monitoring of every network path","authors":"N. Ohkawa, Y. Nomura","doi":"10.1109/APNOMS.2014.6996516","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996516","url":null,"abstract":"Degradation of networking quality is a serious problem for service providers (e.g., on-demand video subscription service) since it causes customer defection in their services and results in a decline of their sales. Insufficient path capacity is one of the typical causes which degrade networking quality. Especially, the recent technical trend to shift virtualized network, in which the network is dynamically and autonomically reconfigured, increases the risk of unexpected insufficiency of the path capacity in the network. To detect such an unexpected insufficiency of path capacity, a constant monitoring of the whole network is highly expected. Path capacity estimation with passive measurement method is an approach which suits to such a purpose since it adds no additional load to the target network. However, existing passive measurement methods tend to either 1) have insufficient accuracy on their estimation or 2) require heavy computational cost for their histogram analyses. In this paper, we introduce a novel path capacity estimation method by passive measurement for a constant monitoring of a network 24hour, 365-day. Our method can estimate the capacity of each path with sufficient accuracy by eliminating the two factors of degrading the estimation accuracy, which are the influence of TCP window flow control and the influence of cross traffic on the path. We evaluated our method using packets captured from our in-company backbone network. Our method accurately estimated the capacity of the narrowest link in every 1524 connections, in which 80% of the connections were within approximately 15% of their actual values (in over 1MB traffic case), as shown in Fig. 8.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127489430","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}
Pub Date : 2014-12-29DOI: 10.1109/APNOMS.2014.6996519
Rohit Tripathi, G. Barua
The decrease in price of internet access has brought clients' focus on a good internet service. Clients now demand guarantees for the bandwidth promised. We present a scheme in which clients are assured connection and bandwidth and if assured service is not provided, service providers pay penalty to them. The use of multi-SIM handheld devices such as mobiles and tablets have enabled clients to make a “choice” between multiple service providers for communication services. With competition, a client will prefer to connect to that provider who is providing the lowest price with guarantees. In this paper, we present a scenario of dynamic pricing and guarantees with penalties and providers have to decide on pricing strategies which will maximize their income. We present a solution among two service providers which achieves a Nash equilibrium with the maximizing of the expected income being the decision criterion.
{"title":"Dynamic internet pricing and bandwidth guarantees with nash equilibrium","authors":"Rohit Tripathi, G. Barua","doi":"10.1109/APNOMS.2014.6996519","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996519","url":null,"abstract":"The decrease in price of internet access has brought clients' focus on a good internet service. Clients now demand guarantees for the bandwidth promised. We present a scheme in which clients are assured connection and bandwidth and if assured service is not provided, service providers pay penalty to them. The use of multi-SIM handheld devices such as mobiles and tablets have enabled clients to make a “choice” between multiple service providers for communication services. With competition, a client will prefer to connect to that provider who is providing the lowest price with guarantees. In this paper, we present a scenario of dynamic pricing and guarantees with penalties and providers have to decide on pricing strategies which will maximize their income. We present a solution among two service providers which achieves a Nash equilibrium with the maximizing of the expected income being the decision criterion.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128981759","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}
Pub Date : 2014-12-29DOI: 10.1109/APNOMS.2014.6996533
Yun-Hui Wen, H. Chang, Hsiao-Wen Kao, Gwo-hwa Ju
Modern Wi-Fi network has been a convinced way to connect to internet and widely accepted by people. Base on the Wi-Fi infra-structure, we can provide location-based services which could help to increase customers' experience and engagement in the services or activities provided by area owners. In this paper, we present a Wi-Fi hot zone based Location-Aware services which can dynamically cognize user's current location and automatically offer related contents, such as activities information and indoor map services. We also address the access control and verification method to restrict users from accessing the LBS content from outside the Wi-Fi hot zone venue. Through field trial provisioning a number of Wi-Fi APs, as well as system of network-side development and deployment, we execute an experiment to verify the viability of our location-aware service and analyze the performance. The results show that our system can correctly indicate user's current location within a period of reasonable reaction time.
{"title":"Location-aware services based on Wi-Fi network","authors":"Yun-Hui Wen, H. Chang, Hsiao-Wen Kao, Gwo-hwa Ju","doi":"10.1109/APNOMS.2014.6996533","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996533","url":null,"abstract":"Modern Wi-Fi network has been a convinced way to connect to internet and widely accepted by people. Base on the Wi-Fi infra-structure, we can provide location-based services which could help to increase customers' experience and engagement in the services or activities provided by area owners. In this paper, we present a Wi-Fi hot zone based Location-Aware services which can dynamically cognize user's current location and automatically offer related contents, such as activities information and indoor map services. We also address the access control and verification method to restrict users from accessing the LBS content from outside the Wi-Fi hot zone venue. Through field trial provisioning a number of Wi-Fi APs, as well as system of network-side development and deployment, we execute an experiment to verify the viability of our location-aware service and analyze the performance. The results show that our system can correctly indicate user's current location within a period of reasonable reaction time.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121760172","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}
Pub Date : 2014-12-29DOI: 10.1109/APNOMS.2014.6996580
Congxian Yan, Ying Wang, Xue-song Qiu, Wenjing Li, Lu Guan
The performance and reliability of services relies on the network virtualization environment's capabilities to effectively detect and diagnose faults in both substrate and virtual network. However, Network Virtualization Environment (NVE) brings to fault diagnosis new challenges such as inaccessible substrate network information and multi-layer faults. To solve the above issues, a Multi-layer Fault Diagnosis Method (MFDM) is proposed. A layer-by-layer strategy is used to resolve the problem of inaccessible substrate network information. And a filtering algorithm is proposed to distinguish the multi-layer faults in the network virtualization environment. At last, a contribution-based hypothesis selection algorithm is proposed to infer the most possible faults. Simulations and experimental results show that MFDM has a higher performance in the accuracy ratio, false-positive ratio.
{"title":"Multi-layer fault diagnosis method in the Network Virtualization Environment","authors":"Congxian Yan, Ying Wang, Xue-song Qiu, Wenjing Li, Lu Guan","doi":"10.1109/APNOMS.2014.6996580","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996580","url":null,"abstract":"The performance and reliability of services relies on the network virtualization environment's capabilities to effectively detect and diagnose faults in both substrate and virtual network. However, Network Virtualization Environment (NVE) brings to fault diagnosis new challenges such as inaccessible substrate network information and multi-layer faults. To solve the above issues, a Multi-layer Fault Diagnosis Method (MFDM) is proposed. A layer-by-layer strategy is used to resolve the problem of inaccessible substrate network information. And a filtering algorithm is proposed to distinguish the multi-layer faults in the network virtualization environment. At last, a contribution-based hypothesis selection algorithm is proposed to infer the most possible faults. Simulations and experimental results show that MFDM has a higher performance in the accuracy ratio, false-positive ratio.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115974983","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}
Pub Date : 2014-12-29DOI: 10.1109/APNOMS.2014.6996586
Seonyoung Park, Youngseok Lee
A web community is an important space for online users to exchange information, ideas and thoughts. Due to collective intelligence of the web communities, marketing and advertisement activities have been highly focused on these sites. While articles in the web communities are open to the public, they cannot be easily collected and analyzed, because they are written in natural languages and their formats are diverse. Though many web crawlers are avaialble, they are not good at gathering web documents. First, the URLs of web articles are frequently changed and redundant, which will make the crawling job difficult. Second, the amount of articles is significantly large that the crawler should be designed in a scalable manner. Therefore, we propose a distributed web crawler optimized for collecting articles from popular communities. From the experiemnts we showed that our implementation achieves high throughput compared with the open-source crawler, Nutch.
{"title":"Implementation of a distributed web community crawler","authors":"Seonyoung Park, Youngseok Lee","doi":"10.1109/APNOMS.2014.6996586","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996586","url":null,"abstract":"A web community is an important space for online users to exchange information, ideas and thoughts. Due to collective intelligence of the web communities, marketing and advertisement activities have been highly focused on these sites. While articles in the web communities are open to the public, they cannot be easily collected and analyzed, because they are written in natural languages and their formats are diverse. Though many web crawlers are avaialble, they are not good at gathering web documents. First, the URLs of web articles are frequently changed and redundant, which will make the crawling job difficult. Second, the amount of articles is significantly large that the crawler should be designed in a scalable manner. Therefore, we propose a distributed web crawler optimized for collecting articles from popular communities. From the experiemnts we showed that our implementation achieves high throughput compared with the open-source crawler, Nutch.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130791831","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}
Pub Date : 2014-12-29DOI: 10.1109/APNOMS.2014.6996513
Wen-Che Yang, Jhih-Dao Jhan, Dong-Yie Chen, Kuo-Hsiang Lai, Rong-Ruey Lee
As the growth of digital home application, the quality of service (QoS) of network is a very critical issue and influences the satisfaction of end users to enjoy the desired service, especially for real-time sensitive service. It is important for service provider to verify the actual QoS parameters, such as delay, jitter and packet loss are satisfying the service requirement of their customers. The popular method to check the QoS is using ICMP ping function to gather the QoS parameters, but results in the precision argument and lacks of one-way information for IPTV downstream flow. The other issue is how to activate the QoS test function for the large scale CPEs (Customer Promise Equipment). In this research, we propose a QoS test mechanism at home gateway to exclude all factors of home networking. The proposed approach integrates the TR-069 remote management methodology to increase the scalability to activate the proposed QoS test action for a large number of home gateways. We illustrate the implementation and integration procedure of the proposed test approach and TR-069 mechanism of the managed home gateway. We also execute the proposed test by TR-069 management server, and comfirm its accuracy. The proposed mechanism provides a convenient way for the service providers to clarify the service quality of subscribed lines of broadband access network, and decreases the complaint and increases the satisfaction of their customers.
{"title":"Quality of service test mechanism and management of broadband access network","authors":"Wen-Che Yang, Jhih-Dao Jhan, Dong-Yie Chen, Kuo-Hsiang Lai, Rong-Ruey Lee","doi":"10.1109/APNOMS.2014.6996513","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996513","url":null,"abstract":"As the growth of digital home application, the quality of service (QoS) of network is a very critical issue and influences the satisfaction of end users to enjoy the desired service, especially for real-time sensitive service. It is important for service provider to verify the actual QoS parameters, such as delay, jitter and packet loss are satisfying the service requirement of their customers. The popular method to check the QoS is using ICMP ping function to gather the QoS parameters, but results in the precision argument and lacks of one-way information for IPTV downstream flow. The other issue is how to activate the QoS test function for the large scale CPEs (Customer Promise Equipment). In this research, we propose a QoS test mechanism at home gateway to exclude all factors of home networking. The proposed approach integrates the TR-069 remote management methodology to increase the scalability to activate the proposed QoS test action for a large number of home gateways. We illustrate the implementation and integration procedure of the proposed test approach and TR-069 mechanism of the managed home gateway. We also execute the proposed test by TR-069 management server, and comfirm its accuracy. The proposed mechanism provides a convenient way for the service providers to clarify the service quality of subscribed lines of broadband access network, and decreases the complaint and increases the satisfaction of their customers.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128906053","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}
Pub Date : 2014-12-29DOI: 10.1109/APNOMS.2014.6996563
Duc Ngoc Minh Dang, Vandung Nguyen, Chuan Pham, Thant Zin Oo, C. Hong
Vehicular Ad hoc NETworks (VANETs) should provide the reliable safety message broadcasts and the efficient non-safety message transmissions to vehicles. The IEEE 1609.4 MAC, which supports multi-channel operations in VANETs, is not reliable enough for the safety message broadcast and not efficient in the Service CHannel (SCH) resources utilization. In this paper, we propose a MAC protocol which supports a Reliable Multi-hop Safety message Broadcast (RMSB-MAC) in VANETs. Each Multi-hop Forwarder (MF) collects the safety messages from the neighbor vehicle nodes, and then the MF uses its reserved time slot to broadcast them to all vehicle nodes in its transmission range as well as to forward them to the next MF. Moreover, by allowing vehicle nodes to exchange non-safety messages during the Control CHannel Interval (CCHI), the RMSB-MAC utilizes the SCH resources more efficiently.
{"title":"A reliable multi-hop safety message broadcast in Vehicular Ad hoc Networks","authors":"Duc Ngoc Minh Dang, Vandung Nguyen, Chuan Pham, Thant Zin Oo, C. Hong","doi":"10.1109/APNOMS.2014.6996563","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996563","url":null,"abstract":"Vehicular Ad hoc NETworks (VANETs) should provide the reliable safety message broadcasts and the efficient non-safety message transmissions to vehicles. The IEEE 1609.4 MAC, which supports multi-channel operations in VANETs, is not reliable enough for the safety message broadcast and not efficient in the Service CHannel (SCH) resources utilization. In this paper, we propose a MAC protocol which supports a Reliable Multi-hop Safety message Broadcast (RMSB-MAC) in VANETs. Each Multi-hop Forwarder (MF) collects the safety messages from the neighbor vehicle nodes, and then the MF uses its reserved time slot to broadcast them to all vehicle nodes in its transmission range as well as to forward them to the next MF. Moreover, by allowing vehicle nodes to exchange non-safety messages during the Control CHannel Interval (CCHI), the RMSB-MAC utilizes the SCH resources more efficiently.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123482831","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}
In this paper, we gather the weekly reports of an operational IP backbone network from January 2006 to January 2013, according to which, we can restore the truth and uncover the evolution of network configurations of the studied network. Our high-level analyses illustrate that rate limiting and launching routes for new customers are most frequently configured. We can identify and construct configuration templates by correlating each task to a certain set of commands in configuration files, based on which, automated configuration provisioning for an operational backbone network is feasible. In addition, we can configure redundant links for those with higher rate of failures according to our detailed analyses of link failures, which will enhance the stability and reliability of data transmission.
{"title":"Evolution of network configurations: High-level analysis of an operational IP backbone network","authors":"Fuliang Li, Jiahai Yang, Huijing Zhang, Suogang Li, Xingwei Wang, Jianping Wu","doi":"10.1109/APNOMS.2014.6996105","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996105","url":null,"abstract":"In this paper, we gather the weekly reports of an operational IP backbone network from January 2006 to January 2013, according to which, we can restore the truth and uncover the evolution of network configurations of the studied network. Our high-level analyses illustrate that rate limiting and launching routes for new customers are most frequently configured. We can identify and construct configuration templates by correlating each task to a certain set of commands in configuration files, based on which, automated configuration provisioning for an operational backbone network is feasible. In addition, we can configure redundant links for those with higher rate of failures according to our detailed analyses of link failures, which will enhance the stability and reliability of data transmission.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123235819","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：