Java是全球使用广泛的一门网络编程语言,当今许多系统都是用Java语言进行编写的;SQL Server 2005是Microsoft公司推出的大型数据库系统,现在在一些大中型系统中有着广泛的使用,它的编程接口非常丰富、易用,提供了JDBC编程接口。在基于J...Java是全球使用广泛的一门网络编程语言,当今许多系统都是用Java语言进行编写的;SQL Server 2005是Microsoft公司推出的大型数据库系统,现在在一些大中型系统中有着广泛的使用,它的编程接口非常丰富、易用,提供了JDBC编程接口。在基于Java的软件系统中通过加载JDBC驱动和相关jar包,既可以实现在Java编程中连接SQL Server,也可通过连接池来连接SQL Server数据库。展开更多
Content delivery networks are designed to extend the end-to-end transport capability of the Internet to cope with increases in video traffic. For further improvement, bursty request arrivals should be efficiently addr...Content delivery networks are designed to extend the end-to-end transport capability of the Internet to cope with increases in video traffic. For further improvement, bursty request arrivals should be efficiently addressed. As opposed to previous approaches, in which the best client-server pair is individually selected (individual optimization), this paper proposes an algorithm for dealing with simultaneous arrival requests, in which client-server pairs are selected such that all requests receive good service (social optimization). The performance of the proposed algorithm is compared with that of the closest algorithm, an individual optimization algorithm, under the condition that a large number of requests arrive simultaneously. The evaluation criterion is the worst link stress, which is the largest number of streams per link. The numerical results show that the proposed algorithm is effective for large-scale networks and that the closest algorithm does not provide near-optimal solutions, especially when all requests arrive in a small part of the network or when there are many servers.展开更多
文摘Java是全球使用广泛的一门网络编程语言,当今许多系统都是用Java语言进行编写的;SQL Server 2005是Microsoft公司推出的大型数据库系统,现在在一些大中型系统中有着广泛的使用,它的编程接口非常丰富、易用,提供了JDBC编程接口。在基于Java的软件系统中通过加载JDBC驱动和相关jar包,既可以实现在Java编程中连接SQL Server,也可通过连接池来连接SQL Server数据库。
文摘Content delivery networks are designed to extend the end-to-end transport capability of the Internet to cope with increases in video traffic. For further improvement, bursty request arrivals should be efficiently addressed. As opposed to previous approaches, in which the best client-server pair is individually selected (individual optimization), this paper proposes an algorithm for dealing with simultaneous arrival requests, in which client-server pairs are selected such that all requests receive good service (social optimization). The performance of the proposed algorithm is compared with that of the closest algorithm, an individual optimization algorithm, under the condition that a large number of requests arrive simultaneously. The evaluation criterion is the worst link stress, which is the largest number of streams per link. The numerical results show that the proposed algorithm is effective for large-scale networks and that the closest algorithm does not provide near-optimal solutions, especially when all requests arrive in a small part of the network or when there are many servers.
