CN101163033A - Authentication and automatically planning server - Google Patents
Authentication and automatically planning server Download PDFInfo
- Publication number
- CN101163033A CN101163033A CNA2006101171173A CN200610117117A CN101163033A CN 101163033 A CN101163033 A CN 101163033A CN A2006101171173 A CNA2006101171173 A CN A2006101171173A CN 200610117117 A CN200610117117 A CN 200610117117A CN 101163033 A CN101163033 A CN 101163033A
- Authority
- CN
- China
- Prior art keywords
- gene
- node
- server
- network
- user
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to an authentication and automatic planning server, which mainly comprises a system mainboard, an operation system software, a storage unit, a state display lattice screen, a dedicated configuration and query keyboard, a power management system and a heat-dissipating system, and the system applies an industrial database to store user information, an asymmetric encryption algorithm to encrypt and store user passwords and the method of HTTP plus CGI to realize the management and maintenance of users via a browser. In terms of advantages, the the invention utilizes a hierarchical structure to multiplex data transmission, realizes the purpose of saving the network bandwidth by logarithmic scale and reorganizes access servers to increase the number of layers in order to reduce the network load, and along with the change of application, the system automatically adjusts the allocation of the access servers of each multimedia terminal, thus realizing the control on stream media transmission paths and therefore optimizing the efficiency of the whole network.
Description
Technical field
The present invention relates to a kind of management system of the communications field, particularly a kind of authentication and automatically planning server.
Technical background
Fast development along with long-range audiovisual applications, the specification requirement of its core product " multipoint control unit " MCU constantly improves, aspect networking model, between MCU and the MCU, terminal no longer is that stationary is connected with MCU, therefore the organization and administration flow process of audio/video flow is complicated, has the problem of selecting mutually between terminal and the MCU.For example: how terminal inserts this territory MCU that is connected, and how other territory terminals join that this MCU goes up or this MCU overflows and how to be linked on the contiguous MCU.Selecting on the route in addition, relatively disperseing if access terminal, the MCU that how to select any terminal seat is as the side of convening, and the other-end tandem is to this MCU or the like problem, and the MCU of present stage itself does not solve well.
Summary of the invention
The objective of the invention is at the defective that exists in the prior art, the invention provides a kind of authentication and automatically planning server.The present invention mainly comprises: system board, operating system software, storage element, state show the dot matrix screen, inquiry keyboard special, power-supply management system, cooling system are set, it is characterized in that described system adopts technical grade database MySQL storing subscriber information, adopt the RSA rivest, shamir, adelman to encrypt the stored user password, the built-in Apache Web of server Server, adopt the mode of HTTP+CGI to realize carrying out user management and maintenance, and comprise following steps by browser:
A carries out authentification of user by IE or the login of other browsers for each connection, adopts the RSA asymmetric arithmetic, and secret key length is 1024, and overall process adopts the SSL encrypted transmission,
B carries out the management of user, Control Room, meeting room;
The C system realizes the first level logical topology on the bottom hardware topological structure, whether server is responsible for monitoring current network condition and is adapted with current application;
D judges the whether over balance of load of each node, and according to current situation the logical topology of network is formed at any time and adjusted;
Advantage of the present invention is to utilize the structure multiplex data transmission of layer, the purpose that realizes saving the network bandwidth with the logarithm rank.Increase the number of plies by the reorganization access server and reduce offered load.Along with the variation of using, system can adjust the distribution of the access server of each multimedia terminal automatically, realizes the control in convection current media delivery path, reaches to make whole network efficiency optimization.
Description of drawings
Fig. 1 system module block diagram of the present invention;
Fig. 2 data protocol Organization Chart of the present invention;
Fig. 3 system construction drawing of the present invention;
Fig. 4 network system figure of the present invention;
Embodiment
Further specify embodiments of the invention below in conjunction with accompanying drawing:
This server adopts technical grade database MySQL storing subscriber information.User cipher adopts the RSA rivest, shamir, adelman to encrypt and stores.The built-in Apache Web of server Server adopts the mode of HTTP+CGI to realize carrying out user management and maintenance by browser, and in addition, proprietary hypervisor adopts proprietary protocol, also can the user who be stored in database inside be managed.Referring to Fig. 1.
Privately owned authentication protocol is adopted in authentication, the user utilizes PKI that identity information is encrypted, the authentication end utilizes private key to be decrypted and does to mate comparison operation, distributes disposal password by authenticating the back for it, and the user can carry out access operation by the disposal password of its acquisition then.X.509 whole process using ssl protocol encryption communication also utilizes that agreement prevents user counterfeit.Referring to Fig. 2.
The continuous monitoring server equipment of the status report place network of network state that server comes by the transmission of reception distributed flow media access server, and utilize proprietary quick negative feedback algorithm that the logical topology of system is adjusted.This adjustment algorithm is divided into several layers with the access server in the whole system, referring to Fig. 3.
The basic thought of this adjustment algorithm is to use adaptive evolutionary strategy, seeks the optimal path between two nodes.For example begin to search out the optimal path of 4 nodes, provide under us as giving a definition by 0 node:
1, node set NodeSet promptly is the set of router in the network, also is nodal set.
NodeSet＝{0，1，2，3，4}。But in the implementation procedure of algorithm, we always are considered as vector to NodeSet, and promptly the preface of its element is to consider.
2, gene gene promptly is the character string of the element composition of node set NodeSet.For the gene gene that sets in advance Origin And Destination, if press the order of character string, a paths of all elements energy pie graph, we claim that gene is (COMPLETE) that finishes, and promptly is in ripe attitude.
In this example, a jejune gene is:
gene＝014；
And a ripe gene is:
gene＝0234。
3, in algorithm, the Origin And Destination of route represents with from and to, and, be respectively first and last element of non-NULL gene all the time.Notice that the rear-node of non-NULL gene is defined as the forerunner of to.
In this example, if begin to search out the optimal path of 4 nodes by 0 node, from=0 then, to=4.And, this moment gene ' s rear-node=0.
On this basis, we have following origin operation:
The effect of origin operation title
*RANDOM (node-set) gets a node at random in node-set
*NEXTHOP (node) gets the adjacent node set of node
*NODE (gene) gets the node set that the gene element constitutes
And for each gene gene, all there is oppositional gene _ gene of a gene in (its node set is NodeSet) in one network, satisfies following relation:
NODE(_gene)+NODE(gene)＝NodeSet.
For the gene gene that becomes ripe attitude (COMPLETE), all be stored among the ripe gene sets GeneSet.We define GeneSet following operation:
The action name effect
*GeneSet.AddRear (); Increase gene at tail end
*GeneSet.GetFirst (); Obtain first gene
*GeneSet.RemoveFirst (); Delete first gene
*GeneSet.Sort (); From getting well to going bad to all gene
Ordering
*GeneSet.GetBest (); Obtain best gene
*GeneSet.RemoveHalf (); Delete the gene of half
*GeneSet.RemoveAll (); Delete all gene
As above, if begin to search out the optimal path of 4 nodes by 0 node, the basic principle of the routing algorithm that then develops is, initialization gene gene=04, and we make gene become ripe attitude by the method that develops, i.e. a complete path.At last population is sorted, we can obtain a good gene, promptly good path, thus obtain the next stop router of 0 node to 4 node.A key that develops is that gene is by the developmental process of jejune state to ripe attitude.This developmental process is based on the origin operation in the above-mentioned definition.As:
If the new segment (being new node) that obtains gene is RANDOM (NODE (_ gene)), then gene=034 that may be new; If new segment is RANDOM (NEXTHOP (gene ' srear-node)-NODE (gene)), gene=014 that may be new then.New segment is always among the follow-up adding gene as the rear-node of gene.
Have a kind of situation to be, NODE (gene) has equaled NodeSet, but gene still is not ripe attitude, and this moment, we should begin from the rear-node of gene to delete one section at random to forerunner's direction, allows gene grow up from newly beginning then, thereby makes algorithmic statement.
This routing algorithm that promptly develops is sought the basic principle of optimal path.The routing algorithm of definition evolution now.
Algorithm?1.Gene-Init.
The initialization of // gene gene
BEGIN
NODE(gene)＝{from，to}；
END.
Algorithm?2.RANDOM(node-set).
// from node-set, take out an element at random
BEGIN
Probability possibility return failure with 0.1;
The cardinal of the set of SIZE=node-set;
Return the node of node-set from 0 to SIZE at random;
END.
In the evolution routing algorithm, the growth industry of gene is compound, and basic developmental process is conservative growth, the enlightened growth.Be defined as follows respectively:
Algorithm?3.Gene-Builder1.
The conservative growth of // gene gene
BEGIN
newNode＝RANDOM(NEXTHOP(gene’s?rear-node)-NODE(gene))；
If (RANDOM is failure not)
Increase the new precursor element of newNode as among the gene, the length of gene increases 1;
END.
Algorithm?4.Gene-Builder2.
The enlightenment of // gene gene is grown up
BEGIN
newNode＝RANDOM(NODE(_gene))；
If (RANDOM is failure not)
Increase the new precursor element of newNode as among the gene, the length of gene increases 1;
EDN.
Algorithm?5.Gene-Builder.
The growth of // gene gene
BEGIN
Probable value between one 0 to 1 of the p=;
If (p＜PBUILDER) //PBUILDER is a value of presetting
Gene-Builder1；
Else
Gene-Builder2；
END.
Ensuing algorithm will judge whether gene can't restrain; If will delete at random the gene fragment and remove the endless loop of evolution routing algorithm.
Algorithm?6.Gene-DECOMPLETE.
// judge whether gene can not become COMPLETE's
BEGIN
If(gene?IS?NOT?COMPLETE?AND_gene?IS?NIL)
Return?TRUE；
Else
Return?FALSE；
END.
Algorithm?7.Gene-RANDOMDELETE.
// gene gene is the deletion fragment at random
BEGIN
The length of SIZE=gene;
The random integers of randInteger=between 0 to SIZE-2;
For?I＝0?To?randInteger-1?Do
BEGIN
The forerunner of to element among the deletion gene;
END；
END.
Wherein in the operation to GeneSet.Sort (), the good and bad comparison of gene is arranged.We define gene preferably, and it is less promptly to be that gene representative routed path dissipates in network, and this is the evaluation function definition of gene.The dissipation information of supposing network is by matrix V alArray[] [] storage.
Algorithm?8.Gene-Distance-Function.
The dissipation value of // calculating gene (class is in distance)
BEGIN
distance＝0；
node-set＝NODE(gene)；
The cardinal of the set of SIZE=node-set;
For?i＝0?To?SIZE-2?Do
BEGIN
row＝node-set[i]；
col＝node-set[i+1]；
distance＝distance+ValArray[row][col]；
END；
Return distance;
END.
Algorithm?9.Gene-Evolution.
Evolution again after the // gene gene maturation
BEGIN
{ // conservative variations
Randomly?select?two?adjacent?node?XY?in?NODE(gene)where?Y！＝to；
node＝RANDOM(NEXTHOP(X))；
Change?Y?with?node；
} ﹠amp; { // enlightened variation
Randomly?select?two?adjacent?node?XY?in?NODE(gene)where?Y！＝to；
node＝RANDOM(NODE(_gene))；
Change?Y?with?node；
} ﹠amp; { // certainly given up one section
Gene-RANDOMDELETE(gene)；
}；
While(gene?IS?NOT?COMPLETE)
The gene of { //grows to maturation
Gene-Builder；
If(Gene-DECOMPLETE)
Gene-RANDOMDELETE；
}；
END.
Utilize the structure multiplex data transmission of layer, the purpose that realizes saving the network bandwidth with the logarithm rank.When offered load rises to a critical value, reduce offered load thereby increase the number of plies by the reorganization access server.Each multimedia terminal all can have one and upload access server and a plurality of biography access server down, and the Media Stream of oneself is uploaded to upload server, again by passing the Media Stream that server receives other multimedia terminals down.Along with the variation of using, system can adjust the distribution of the access server of each multimedia terminal automatically, thereby realizes the control in convection current media delivery path, reaches the purpose that makes whole network efficiency maximum.Referring to Fig. 4.
Claims (1)
1. one kind authenticates and automatically planning server, mainly comprise: system board, operating system software, storage element, state show the dot matrix screen, inquiry keyboard special, power-supply management system, cooling system are set, it is characterized in that described system adopts technical grade database MySQL storing subscriber information, adopt the RSA rivest, shamir, adelman to encrypt the stored user password, the built-in Apache Web of server Server, adopt the mode of HTTP+CGI to realize carrying out user management and maintenance, and comprise following steps by browser:
A carries out authentification of user by IE or the login of other browsers for each connection, adopts the RSA asymmetric arithmetic, and secret key length is 1024, and overall process adopts the SSL encrypted transmission;
B manages user, Control Room, meeting room by browser;
The C system realizes the first level logical topology on the bottom hardware topological structure, whether server is responsible for monitoring current network condition and is adapted with current application,
D judges the whether over balance of load of each node, and according to current situation the logical topology of network is formed at any time and adjusted;
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2006101171173A CN101163033A (en) | 2006-10-13 | 2006-10-13 | Authentication and automatically planning server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2006101171173A CN101163033A (en) | 2006-10-13 | 2006-10-13 | Authentication and automatically planning server |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101163033A true CN101163033A (en) | 2008-04-16 |
Family
ID=39297868
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2006101171173A Pending CN101163033A (en) | 2006-10-13 | 2006-10-13 | Authentication and automatically planning server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101163033A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101730094B (en) * | 2009-11-30 | 2012-12-05 | 广州市聚晖电子科技有限公司 | Method for accessing terminal equipment to service platform of security system and transmitting information |
-
2006
- 2006-10-13 CN CNA2006101171173A patent/CN101163033A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101730094B (en) * | 2009-11-30 | 2012-12-05 | 广州市聚晖电子科技有限公司 | Method for accessing terminal equipment to service platform of security system and transmitting information |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jiang et al. | Energy-efficient multi-constraint routing algorithm with load balancing for smart city applications | |
| Chen et al. | Enabling technologies for future data center networking: a primer | |
| Shi et al. | On the effect of bandwidth fragmentation on blocking probability in elastic optical networks | |
| US9407494B1 (en) | Reassigning source peers | |
| CN100583820C (en) | Routing system and method of content distribution network | |
| CN111654438B (en) | Method, controller and system for establishing forwarding path in network | |
| CN109768987A (en) | A kind of storage of data file security privacy and sharing method based on block chain | |
| US8161181B2 (en) | Content delivering method and system for computer network | |
| Uludag et al. | Analysis of topology aggregation techniques for QoS routing | |
| CN103917958A (en) | Distributed mapping function for large scale media clouds | |
| Tuncer et al. | Scalable cache management for ISP-operated content delivery services | |
| Zhong et al. | Decentralized optimization for multicast adaptive video streaming in edge cache-assisted networks | |
| Nakajima et al. | A light-weight content distribution scheme for cooperative caching in telco-cdns | |
| CN112260825B (en) | Quantum key synchronization system and method based on hierarchical tree cluster unit | |
| Azimdoost et al. | Resolution-based content discovery in network of caches: Is the control traffic an issue? | |
| Pal et al. | Priority-based scheduling scheme for live video streaming in peer-to-peer network | |
| Kokkinos et al. | Scheduling efficiency of resource information aggregation in grid networks | |
| Mokhtarian et al. | Capacity management of seed servers in peer-to-peer streaming systems with scalable video streams | |
| Malik et al. | On the effects of subpacketization in content-centric mobile networks | |
| CN101163033A (en) | Authentication and automatically planning server | |
| Pal et al. | A survey on adaptive multimedia streaming | |
| Hu et al. | Not so cooperative caching in named data networking | |
| Jia et al. | Modeling dynamic adaptive streaming over information-centric networking | |
| Bracciale et al. | A push-based scheduling algorithm for large scale P2P live streaming | |
| Papapanagiotou et al. | Aggregation network design methodologies for triple play services |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20080416 |