基于变化概率的网络选课系统公平算法  

Algorithms of Web Course Selection-Arrangement System Based on Varied Probability

作　　者：张戈[1] 

机构地区：[1]中国青年政治学院计算机教学与应用中心,北京100089

出　　处：《计算机系统应用》2010年第4期181-184,共4页Computer Systems & Applications

摘　　要：网络选课系统研发工作的重点和难点就是找到一种算法既能充分体现选课活动的公平性又能很好地解决大批量并发访问系统带来的网络拥堵问题。对现有选课算法进行了分析和研究,提出并详细阐述用于实时选课系统的一种新算法——基于变化概率的公平算法。该算法使得每个学生在选课活动当中能拥有趋于均等的选课概率,从而使选课活动在最大程度上实现了公平性原则并极大的缓解了网络拥堵问题。The most important and difficult thing is how to find an algorithm which can resolve the equity problem and network congestion problem caused by concurrent visit to system by multitudinous students. This paper analyzes and researches these existing algorithm,and proposes new algorithms-Algorithms of Web Course Selection-Arrangement System based on probability. These algorithms make every student have equal probability on the move of course selection. Therefore,the equity and network congestion can be resolved at large.

关 键 词：选课算法 变化概率 公平性 网络拥堵 

分 类 号：TP311.52[自动化与计算机技术—计算机软件与理论]